/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:23:34,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:23:34,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:23:34,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:23:34,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:23:34,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:23:34,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:23:34,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:23:34,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:23:34,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:23:34,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:23:34,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:23:34,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:23:34,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:23:34,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:23:34,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:23:34,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:23:34,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:23:34,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:23:34,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:23:34,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:23:34,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:23:34,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:23:34,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:23:34,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:23:34,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:23:34,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:23:34,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:23:34,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:23:34,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:23:34,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:23:34,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:23:34,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:23:34,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:23:34,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:23:34,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:23:34,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:23:34,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:23:34,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:23:34,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:23:34,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:23:34,982 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:23:34,997 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:23:34,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:23:34,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:23:34,999 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:23:34,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:23:34,999 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:23:34,999 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:23:34,999 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:23:35,000 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:23:35,000 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:23:35,000 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:23:35,000 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:23:35,000 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:23:35,000 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:23:35,001 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:35,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:23:35,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:23:35,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:23:35,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:23:35,001 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:23:35,002 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:23:35,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:23:35,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:23:35,002 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:23:35,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:23:35,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:23:35,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:23:35,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:23:35,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:23:35,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:23:35,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:23:35,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:23:35,194 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:23:35,194 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:23:35,195 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:23:35,254 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_HZridP/tmp/19fd7b2a3ebb4e12830a02587e5809f5/FLAGd91c06d26 [2020-07-01 11:23:35,615 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:23:35,616 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:23:35,623 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_HZridP/tmp/19fd7b2a3ebb4e12830a02587e5809f5/FLAGd91c06d26 [2020-07-01 11:23:36,023 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_HZridP/tmp/19fd7b2a3ebb4e12830a02587e5809f5 [2020-07-01 11:23:36,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:23:36,036 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:23:36,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:23:36,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:23:36,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:23:36,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bdd225c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36, skipping insertion in model container [2020-07-01 11:23:36,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:23:36,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:23:36,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:23:36,293 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:23:36,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:23:36,323 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:23:36,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36 WrapperNode [2020-07-01 11:23:36,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:23:36,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:23:36,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:23:36,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:23:36,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:23:36,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:23:36,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:23:36,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:23:36,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:23:36,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:23:36,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:23:36,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:23:36,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:23:36,448 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-01 11:23:36,448 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-01 11:23:36,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:23:36,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:23:36,617 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:23:36,618 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-01 11:23:36,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:23:36 BoogieIcfgContainer [2020-07-01 11:23:36,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:23:36,623 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:23:36,623 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:23:36,625 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:23:36,626 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:23:36" (1/1) ... [2020-07-01 11:23:36,641 INFO L313 BlockEncoder]: Initial Icfg 17 locations, 21 edges [2020-07-01 11:23:36,643 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:23:36,643 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:23:36,644 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:23:36,644 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:23:36,646 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:23:36,647 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:23:36,647 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:23:36,661 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:23:36,677 INFO L200 BlockEncoder]: SBE split 3 edges [2020-07-01 11:23:36,681 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:23:36,683 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:23:36,694 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-07-01 11:23:36,696 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 11:23:36,698 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:23:36,698 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:23:36,704 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 11:23:36,704 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:23:36,705 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:23:36,705 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:23:36,705 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:23:36,706 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:23:36,706 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 16 edges [2020-07-01 11:23:36,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:23:36 BasicIcfg [2020-07-01 11:23:36,707 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:23:36,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:23:36,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:23:36,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:23:36,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:23:36" (1/4) ... [2020-07-01 11:23:36,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72db72d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:23:36, skipping insertion in model container [2020-07-01 11:23:36,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (2/4) ... [2020-07-01 11:23:36,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72db72d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:23:36, skipping insertion in model container [2020-07-01 11:23:36,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:23:36" (3/4) ... [2020-07-01 11:23:36,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72db72d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:23:36, skipping insertion in model container [2020-07-01 11:23:36,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:23:36" (4/4) ... [2020-07-01 11:23:36,716 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:23:36,728 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:23:36,735 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 11:23:36,752 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 11:23:36,776 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:23:36,776 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:23:36,776 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:23:36,777 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:23:36,777 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:23:36,777 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:23:36,777 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:23:36,777 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:23:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-07-01 11:23:36,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:23:36,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-07-01 11:23:36,873 INFO L268 CegarLoopResult]: For program point L17(lines 17 21) no Hoare annotation was computed. [2020-07-01 11:23:36,874 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 11:23:36,874 INFO L268 CegarLoopResult]: For program point L14(lines 14 22) no Hoare annotation was computed. [2020-07-01 11:23:36,874 INFO L268 CegarLoopResult]: For program point fEXIT(lines 13 23) no Hoare annotation was computed. [2020-07-01 11:23:36,874 INFO L271 CegarLoopResult]: At program point fENTRY(lines 13 23) the Hoare annotation is: true [2020-07-01 11:23:36,874 INFO L268 CegarLoopResult]: For program point fFINAL(lines 13 23) no Hoare annotation was computed. [2020-07-01 11:23:36,875 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-01 11:23:36,875 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 11:23:36,875 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-01 11:23:36,875 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:23:36,875 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-07-01 11:23:36,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:23:36 BasicIcfg [2020-07-01 11:23:36,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:23:36,880 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:23:36,880 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:23:36,884 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:23:36,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:23:36,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:23:36" (1/5) ... [2020-07-01 11:23:36,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2814ed06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:23:36, skipping insertion in model container [2020-07-01 11:23:36,886 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:23:36,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:23:36" (2/5) ... [2020-07-01 11:23:36,886 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2814ed06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:23:36, skipping insertion in model container [2020-07-01 11:23:36,886 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:23:36,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:23:36" (3/5) ... [2020-07-01 11:23:36,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2814ed06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:23:36, skipping insertion in model container [2020-07-01 11:23:36,887 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:23:36,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:23:36" (4/5) ... [2020-07-01 11:23:36,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2814ed06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:23:36, skipping insertion in model container [2020-07-01 11:23:36,888 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:23:36,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:23:36" (5/5) ... [2020-07-01 11:23:36,890 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:23:36,917 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:23:36,917 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:23:36,917 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:23:36,917 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:23:36,917 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:23:36,917 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:23:36,918 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:23:36,918 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:23:36,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-01 11:23:36,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 11:23:36,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:23:36,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:23:36,949 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:23:36,949 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:23:36,949 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:23:36,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-01 11:23:36,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 11:23:36,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:23:36,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:23:36,951 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:23:36,952 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:23:36,956 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [66] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_8) (<= 0 v_ULTIMATE.start_main_~x~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret4] 9#L29true [41] L29-->fENTRY: Formula: (and (= |v_f_#in~yInParam_3| v_ULTIMATE.start_main_~y~0_7) (= |v_f_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f_#in~y=|v_f_#in~yInParam_3|, f_#in~x=|v_f_#in~xInParam_3|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 5#fENTRYtrue [2020-07-01 11:23:36,957 INFO L796 eck$LassoCheckResult]: Loop: 5#fENTRYtrue [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 6#L14true [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 12#L17true [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 4#L20true [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 5#fENTRYtrue [2020-07-01 11:23:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash 3048, now seen corresponding path program 1 times [2020-07-01 11:23:36,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:36,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432535302] [2020-07-01 11:23:36,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:37,051 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:23:37,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:37,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2413106, now seen corresponding path program 1 times [2020-07-01 11:23:37,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:37,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641659632] [2020-07-01 11:23:37,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:37,066 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:23:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1478585703, now seen corresponding path program 1 times [2020-07-01 11:23:37,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:37,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057136031] [2020-07-01 11:23:37,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:37,090 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:23:37,187 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:23:37,188 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:23:37,188 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:23:37,188 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:23:37,189 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:23:37,189 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:37,189 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:23:37,189 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:23:37,189 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:23:37,189 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:23:37,190 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:23:37,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,337 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:23:37,338 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:37,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:23:37,345 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:23:37,354 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:23:37,355 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_~x=0} Honda state: {f_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:37,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:23:37,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:23:37,392 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:23:37,392 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_~y=0} Honda state: {f_~y=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:37,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:23:37,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:23:37,429 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:23:37,429 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#t~ret1=0} Honda state: {f_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:37,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:23:37,461 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:37,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:23:37,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:23:37,599 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:23:37,602 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:23:37,602 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:23:37,602 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:23:37,602 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:23:37,602 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:23:37,602 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:37,602 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:23:37,603 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:23:37,603 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:23:37,603 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:23:37,603 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:23:37,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:37,685 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:23:37,691 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:37,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:23:37,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:23:37,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:23:37,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:23:37,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:23:37,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:23:37,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:23:37,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:23:37,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:37,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:23:37,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:23:37,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:23:37,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:23:37,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:23:37,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:23:37,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:23:37,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:23:37,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:37,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:23:37,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:23:37,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:23:37,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:23:37,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:23:37,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:23:37,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:23:37,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:23:37,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:37,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:23:37,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:23:37,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:23:37,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:23:37,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:23:37,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:23:37,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:23:37,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:23:37,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:23:37,828 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:23:37,829 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:37,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:23:37,839 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:23:37,839 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:23:37,840 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~y, f_#in~x) = 1*f_#in~y + 1*f_#in~x Supporting invariants [] [2020-07-01 11:23:37,873 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:23:37,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:37,931 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:23:37,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:23:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:37,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:23:37,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:23:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:23:38,043 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 11:23:38,049 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-01 11:23:38,050 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states. Second operand 5 states. [2020-07-01 11:23:38,431 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states.. Second operand 5 states. Result 237 states and 458 transitions. Complement of second has 86 states. [2020-07-01 11:23:38,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-07-01 11:23:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 11:23:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2020-07-01 11:23:38,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-01 11:23:38,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:23:38,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-01 11:23:38,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:23:38,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-01 11:23:38,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:23:38,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237 states and 458 transitions. [2020-07-01 11:23:38,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2020-07-01 11:23:38,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237 states to 90 states and 130 transitions. [2020-07-01 11:23:38,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-07-01 11:23:38,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2020-07-01 11:23:38,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-07-01 11:23:38,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:23:38,491 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-07-01 11:23:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-07-01 11:23:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 20. [2020-07-01 11:23:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 11:23:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2020-07-01 11:23:38,528 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 32 transitions. [2020-07-01 11:23:38,528 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 32 transitions. [2020-07-01 11:23:38,528 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 11:23:38,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 32 transitions. [2020-07-01 11:23:38,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-01 11:23:38,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:23:38,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:23:38,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:23:38,530 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:23:38,530 INFO L794 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY [66] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_8) (<= 0 v_ULTIMATE.start_main_~x~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret4] 388#L29 [41] L29-->fENTRY: Formula: (and (= |v_f_#in~yInParam_3| v_ULTIMATE.start_main_~y~0_7) (= |v_f_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f_#in~y=|v_f_#in~yInParam_3|, f_#in~x=|v_f_#in~xInParam_3|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 402#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 394#L14 [2020-07-01 11:23:38,530 INFO L796 eck$LassoCheckResult]: Loop: 394#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 404#L17 [63] L17-->L20: Formula: (> 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 389#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 390#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 394#L14 [2020-07-01 11:23:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:38,531 INFO L82 PathProgramCache]: Analyzing trace with hash 94536, now seen corresponding path program 1 times [2020-07-01 11:23:38,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:38,531 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916606466] [2020-07-01 11:23:38,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:38,543 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:23:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2772657, now seen corresponding path program 1 times [2020-07-01 11:23:38,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:38,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641569645] [2020-07-01 11:23:38,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:38,554 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:23:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:38,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1408484472, now seen corresponding path program 1 times [2020-07-01 11:23:38,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:38,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729213870] [2020-07-01 11:23:38,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:23:38,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729213870] [2020-07-01 11:23:38,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:23:38,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:23:38,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011667343] [2020-07-01 11:23:38,686 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:23:38,686 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:23:38,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:23:38,686 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:23:38,686 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:23:38,687 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:38,687 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:23:38,687 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:23:38,687 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:23:38,687 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:23:38,688 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:23:38,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:38,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:38,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:38,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:38,783 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:23:38,783 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:38,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:23:38,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:23:38,792 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:23:38,792 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#t~ret1=0} Honda state: {f_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:38,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:23:38,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:23:38,828 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:23:38,828 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#t~ret0=0} Honda state: {f_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:38,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:23:38,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:23:38,865 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:23:38,865 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#res=0} Honda state: {f_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:38,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:23:38,897 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:38,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:23:38,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:23:39,271 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:23:39,274 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:23:39,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:23:39,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:23:39,298 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:23:39,298 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:23:39,298 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:39,298 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:23:39,298 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:23:39,298 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:23:39,298 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:23:39,299 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:23:39,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:39,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:39,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:39,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:39,404 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:23:39,404 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:39,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:23:39,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:23:39,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:23:39,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:23:39,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:23:39,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:23:39,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:23:39,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:23:39,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:39,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:23:39,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:23:39,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:23:39,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:23:39,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:23:39,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:23:39,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:23:39,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:23:39,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:39,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:23:39,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:23:39,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:23:39,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:23:39,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:23:39,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:23:39,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:23:39,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:23:39,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:39,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:23:39,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:23:39,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:23:39,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:23:39,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:23:39,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:23:39,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:23:39,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:23:39,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:23:39,540 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 11:23:39,541 INFO L444 ModelExtractionUtils]: 4 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:39,548 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:23:39,548 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:23:39,548 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:23:39,548 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_~x) = -1*f_~x Supporting invariants [] [2020-07-01 11:23:39,579 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:23:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:39,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:23:39,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:23:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:39,620 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:23:39,621 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:23:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:23:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:39,694 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:23:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:39,702 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:23:39,702 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 11:23:39,702 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-01 11:23:39,703 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 32 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-07-01 11:23:40,549 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 32 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 7458 states and 10292 transitions. Complement of second has 1835 states. [2020-07-01 11:23:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 13 non-accepting loop states 3 accepting loop states [2020-07-01 11:23:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 11:23:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 60 transitions. [2020-07-01 11:23:40,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 60 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-01 11:23:40,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:23:40,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 60 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-01 11:23:40,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:23:40,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 60 transitions. Stem has 3 letters. Loop has 8 letters. [2020-07-01 11:23:40,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:23:40,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7458 states and 10292 transitions. [2020-07-01 11:23:40,676 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 338 [2020-07-01 11:23:40,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7458 states to 673 states and 950 transitions. [2020-07-01 11:23:40,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 146 [2020-07-01 11:23:40,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 261 [2020-07-01 11:23:40,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 673 states and 950 transitions. [2020-07-01 11:23:40,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:23:40,694 INFO L688 BuchiCegarLoop]: Abstraction has 673 states and 950 transitions. [2020-07-01 11:23:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states and 950 transitions. [2020-07-01 11:23:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 43. [2020-07-01 11:23:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 11:23:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 72 transitions. [2020-07-01 11:23:40,709 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 72 transitions. [2020-07-01 11:23:40,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:23:40,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:23:40,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:23:40,714 INFO L87 Difference]: Start difference. First operand 43 states and 72 transitions. Second operand 5 states. [2020-07-01 11:23:40,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:23:40,761 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2020-07-01 11:23:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:23:40,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 90 transitions. [2020-07-01 11:23:40,764 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2020-07-01 11:23:40,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 54 states and 86 transitions. [2020-07-01 11:23:40,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-01 11:23:40,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-01 11:23:40,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 86 transitions. [2020-07-01 11:23:40,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:23:40,767 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 86 transitions. [2020-07-01 11:23:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 86 transitions. [2020-07-01 11:23:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2020-07-01 11:23:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 11:23:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 76 transitions. [2020-07-01 11:23:40,771 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 76 transitions. [2020-07-01 11:23:40,772 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 76 transitions. [2020-07-01 11:23:40,772 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 11:23:40,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 76 transitions. [2020-07-01 11:23:40,772 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2020-07-01 11:23:40,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:23:40,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:23:40,773 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 11:23:40,773 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2020-07-01 11:23:40,773 INFO L794 eck$LassoCheckResult]: Stem: 9874#ULTIMATE.startENTRY [66] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_8) (<= 0 v_ULTIMATE.start_main_~x~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret4] 9875#L29 [41] L29-->fENTRY: Formula: (and (= |v_f_#in~yInParam_3| v_ULTIMATE.start_main_~y~0_7) (= |v_f_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f_#in~y=|v_f_#in~yInParam_3|, f_#in~x=|v_f_#in~xInParam_3|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 9898#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 9911#L14 [61] L14-->L17: Formula: (> 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 9904#L17 [2020-07-01 11:23:40,774 INFO L796 eck$LassoCheckResult]: Loop: 9904#L17 [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 9876#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 9880#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 9886#L14 [61] L14-->L17: Formula: (> 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 9910#L17 [63] L17-->L20: Formula: (> 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 9877#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 9914#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 9908#L14 [61] L14-->L17: Formula: (> 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 9904#L17 [2020-07-01 11:23:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2930677, now seen corresponding path program 1 times [2020-07-01 11:23:40,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:40,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229079992] [2020-07-01 11:23:40,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:23:40,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229079992] [2020-07-01 11:23:40,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:23:40,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:23:40,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872437846] [2020-07-01 11:23:40,800 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 11:23:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1302907716, now seen corresponding path program 1 times [2020-07-01 11:23:40,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:40,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848498509] [2020-07-01 11:23:40,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:23:40,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848498509] [2020-07-01 11:23:40,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:23:40,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:23:40,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995034583] [2020-07-01 11:23:40,832 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:23:40,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:23:40,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:23:40,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:23:40,833 INFO L87 Difference]: Start difference. First operand 45 states and 76 transitions. cyclomatic complexity: 35 Second operand 5 states. [2020-07-01 11:23:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:23:40,868 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2020-07-01 11:23:40,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:23:40,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 84 transitions. [2020-07-01 11:23:40,872 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2020-07-01 11:23:40,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 84 transitions. [2020-07-01 11:23:40,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-07-01 11:23:40,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-07-01 11:23:40,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 84 transitions. [2020-07-01 11:23:40,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:23:40,874 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2020-07-01 11:23:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 84 transitions. [2020-07-01 11:23:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2020-07-01 11:23:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 11:23:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2020-07-01 11:23:40,877 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 74 transitions. [2020-07-01 11:23:40,877 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 74 transitions. [2020-07-01 11:23:40,877 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 11:23:40,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 74 transitions. [2020-07-01 11:23:40,878 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2020-07-01 11:23:40,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:23:40,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:23:40,878 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 11:23:40,879 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:23:40,879 INFO L794 eck$LassoCheckResult]: Stem: 9986#ULTIMATE.startENTRY [66] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_8) (<= 0 v_ULTIMATE.start_main_~x~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret4] 9987#L29 [41] L29-->fENTRY: Formula: (and (= |v_f_#in~yInParam_3| v_ULTIMATE.start_main_~y~0_7) (= |v_f_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f_#in~y=|v_f_#in~yInParam_3|, f_#in~x=|v_f_#in~xInParam_3|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10006#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 10015#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10012#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 9999#L18 [2020-07-01 11:23:40,879 INFO L796 eck$LassoCheckResult]: Loop: 9999#L18 [42] L18-->fENTRY: Formula: (and (= |v_f_#in~xInParam_1| v_f_~y_6) (= |v_f_#in~yInParam_1| (+ v_f_~y_6 (- 1)))) InVars {f_~y=v_f_~y_6} OutVars{f_#in~y=|v_f_#in~yInParam_1|, f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10007#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 9997#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10001#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 9999#L18 [2020-07-01 11:23:40,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:40,880 INFO L82 PathProgramCache]: Analyzing trace with hash 90850999, now seen corresponding path program 1 times [2020-07-01 11:23:40,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:40,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024175111] [2020-07-01 11:23:40,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:40,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:23:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:40,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2222774, now seen corresponding path program 1 times [2020-07-01 11:23:40,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:40,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208060630] [2020-07-01 11:23:40,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:23:40,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208060630] [2020-07-01 11:23:40,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:23:40,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:23:40,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564961875] [2020-07-01 11:23:40,919 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:23:40,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:23:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:23:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:23:40,920 INFO L87 Difference]: Start difference. First operand 45 states and 74 transitions. cyclomatic complexity: 33 Second operand 5 states. [2020-07-01 11:23:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:23:40,987 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2020-07-01 11:23:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:23:40,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 89 transitions. [2020-07-01 11:23:40,990 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2020-07-01 11:23:40,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 55 states and 88 transitions. [2020-07-01 11:23:40,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-01 11:23:40,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-07-01 11:23:40,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 88 transitions. [2020-07-01 11:23:40,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:23:40,991 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 88 transitions. [2020-07-01 11:23:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 88 transitions. [2020-07-01 11:23:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2020-07-01 11:23:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-01 11:23:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 79 transitions. [2020-07-01 11:23:40,995 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 79 transitions. [2020-07-01 11:23:40,995 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 79 transitions. [2020-07-01 11:23:40,995 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 11:23:40,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 79 transitions. [2020-07-01 11:23:40,995 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2020-07-01 11:23:40,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:23:40,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:23:40,996 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 11:23:40,996 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:23:40,997 INFO L794 eck$LassoCheckResult]: Stem: 10099#ULTIMATE.startENTRY [66] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_8) (<= 0 v_ULTIMATE.start_main_~x~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret4] 10100#L29 [41] L29-->fENTRY: Formula: (and (= |v_f_#in~yInParam_3| v_ULTIMATE.start_main_~y~0_7) (= |v_f_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f_#in~y=|v_f_#in~yInParam_3|, f_#in~x=|v_f_#in~xInParam_3|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10117#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 10109#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10110#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 10118#L18 [2020-07-01 11:23:40,997 INFO L796 eck$LassoCheckResult]: Loop: 10118#L18 [42] L18-->fENTRY: Formula: (and (= |v_f_#in~xInParam_1| v_f_~y_6) (= |v_f_#in~yInParam_1| (+ v_f_~y_6 (- 1)))) InVars {f_~y=v_f_~y_6} OutVars{f_#in~y=|v_f_#in~yInParam_1|, f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10119#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 10128#L14 [61] L14-->L17: Formula: (> 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10116#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 10118#L18 [2020-07-01 11:23:40,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:40,997 INFO L82 PathProgramCache]: Analyzing trace with hash 90850999, now seen corresponding path program 2 times [2020-07-01 11:23:40,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:40,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533890335] [2020-07-01 11:23:40,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:41,006 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:23:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:41,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2222805, now seen corresponding path program 1 times [2020-07-01 11:23:41,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:41,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458508521] [2020-07-01 11:23:41,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:23:41,014 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:23:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:41,015 INFO L82 PathProgramCache]: Analyzing trace with hash 620619403, now seen corresponding path program 1 times [2020-07-01 11:23:41,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:23:41,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650836277] [2020-07-01 11:23:41,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:23:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:23:41,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650836277] [2020-07-01 11:23:41,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408905239] [2020-07-01 11:23:41,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:23:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:41,076 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:23:41,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:23:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:23:41,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:23:41,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2020-07-01 11:23:41,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562955926] [2020-07-01 11:23:41,181 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:23:41,181 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:23:41,181 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:23:41,181 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:23:41,181 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:23:41,181 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:41,182 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:23:41,182 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:23:41,182 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 11:23:41,182 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:23:41,182 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:23:41,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:41,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:41,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:41,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:41,262 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:23:41,263 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:41,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:23:41,271 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:23:41,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:23:41,314 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:23:43,392 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:23:43,395 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:23:43,396 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:23:43,396 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:23:43,396 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:23:43,396 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:23:43,396 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:43,396 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:23:43,396 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:23:43,396 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 11:23:43,397 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:23:43,397 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:23:43,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:43,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:43,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:43,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:23:43,467 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:23:43,468 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:43,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:23:43,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:23:43,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:23:43,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:23:43,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:23:43,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:23:43,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:23:43,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:23:43,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:23:43,482 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:23:43,483 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:23:43,487 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:23:43,487 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:23:43,487 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:23:43,487 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_~y) = 2*f_~y + 1 Supporting invariants [] [2020-07-01 11:23:43,517 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:23:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:23:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:43,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:23:43,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:23:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:23:43,551 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:23:43,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:23:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:24:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:24:05,058 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:24:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:24:05,067 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:24:05,067 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 11:24:05,068 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-01 11:24:05,068 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 48 states and 79 transitions. cyclomatic complexity: 35 Second operand 5 states. [2020-07-01 11:24:35,553 WARN L192 SmtUtils]: Spent 5.06 s on a formula simplification that was a NOOP. DAG size: 19 [2020-07-01 11:25:06,404 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 48 states and 79 transitions. cyclomatic complexity: 35. Second operand 5 states. Result 233 states and 312 transitions. Complement of second has 79 states. [2020-07-01 11:25:06,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-07-01 11:25:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 11:25:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2020-07-01 11:25:06,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-01 11:25:06,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:25:06,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-01 11:25:06,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:25:06,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-01 11:25:06,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:25:06,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 233 states and 312 transitions. [2020-07-01 11:25:06,414 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 92 [2020-07-01 11:25:06,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 233 states to 116 states and 177 transitions. [2020-07-01 11:25:06,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2020-07-01 11:25:06,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-07-01 11:25:06,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 177 transitions. [2020-07-01 11:25:06,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:25:06,417 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 177 transitions. [2020-07-01 11:25:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 177 transitions. [2020-07-01 11:25:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 55. [2020-07-01 11:25:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-01 11:25:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 93 transitions. [2020-07-01 11:25:06,421 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 93 transitions. [2020-07-01 11:25:06,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:25:06,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:25:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:25:06,422 INFO L87 Difference]: Start difference. First operand 55 states and 93 transitions. Second operand 8 states. [2020-07-01 11:25:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:25:06,795 INFO L93 Difference]: Finished difference Result 109 states and 149 transitions. [2020-07-01 11:25:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 11:25:06,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 149 transitions. [2020-07-01 11:25:06,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 63 [2020-07-01 11:25:06,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 94 states and 133 transitions. [2020-07-01 11:25:06,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2020-07-01 11:25:06,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-07-01 11:25:06,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 133 transitions. [2020-07-01 11:25:06,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:25:06,803 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 133 transitions. [2020-07-01 11:25:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 133 transitions. [2020-07-01 11:25:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2020-07-01 11:25:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-01 11:25:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2020-07-01 11:25:06,807 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 104 transitions. [2020-07-01 11:25:06,807 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 104 transitions. [2020-07-01 11:25:06,807 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 11:25:06,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 104 transitions. [2020-07-01 11:25:06,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2020-07-01 11:25:06,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:25:06,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:25:06,808 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 11:25:06,808 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-01 11:25:06,809 INFO L794 eck$LassoCheckResult]: Stem: 10725#ULTIMATE.startENTRY [66] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_8) (<= 0 v_ULTIMATE.start_main_~x~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret4] 10726#L29 [41] L29-->fENTRY: Formula: (and (= |v_f_#in~yInParam_3| v_ULTIMATE.start_main_~y~0_7) (= |v_f_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f_#in~y=|v_f_#in~yInParam_3|, f_#in~x=|v_f_#in~xInParam_3|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10744#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 10763#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10755#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 10729#L18 [2020-07-01 11:25:06,809 INFO L796 eck$LassoCheckResult]: Loop: 10729#L18 [42] L18-->fENTRY: Formula: (and (= |v_f_#in~xInParam_1| v_f_~y_6) (= |v_f_#in~yInParam_1| (+ v_f_~y_6 (- 1)))) InVars {f_~y=v_f_~y_6} OutVars{f_#in~y=|v_f_#in~yInParam_1|, f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10747#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 10758#L14 [61] L14-->L17: Formula: (> 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10757#L17 [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 10730#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10754#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 10769#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10760#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 10729#L18 [2020-07-01 11:25:06,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash 90850999, now seen corresponding path program 3 times [2020-07-01 11:25:06,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:06,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338177609] [2020-07-01 11:25:06,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:06,818 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:25:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:06,819 INFO L82 PathProgramCache]: Analyzing trace with hash -168633468, now seen corresponding path program 1 times [2020-07-01 11:25:06,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:06,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529187230] [2020-07-01 11:25:06,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:25:06,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529187230] [2020-07-01 11:25:06,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:25:06,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:25:06,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596469289] [2020-07-01 11:25:06,863 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:25:06,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:25:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:25:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:25:06,863 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. cyclomatic complexity: 40 Second operand 5 states. [2020-07-01 11:25:07,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:25:07,008 INFO L93 Difference]: Finished difference Result 73 states and 103 transitions. [2020-07-01 11:25:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:25:07,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 103 transitions. [2020-07-01 11:25:07,013 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 49 [2020-07-01 11:25:07,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 70 states and 100 transitions. [2020-07-01 11:25:07,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-07-01 11:25:07,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-07-01 11:25:07,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 100 transitions. [2020-07-01 11:25:07,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:25:07,015 INFO L688 BuchiCegarLoop]: Abstraction has 70 states and 100 transitions. [2020-07-01 11:25:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 100 transitions. [2020-07-01 11:25:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2020-07-01 11:25:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-01 11:25:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2020-07-01 11:25:07,018 INFO L711 BuchiCegarLoop]: Abstraction has 62 states and 92 transitions. [2020-07-01 11:25:07,018 INFO L591 BuchiCegarLoop]: Abstraction has 62 states and 92 transitions. [2020-07-01 11:25:07,018 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 11:25:07,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 92 transitions. [2020-07-01 11:25:07,019 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2020-07-01 11:25:07,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:25:07,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:25:07,020 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 11:25:07,020 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-07-01 11:25:07,020 INFO L794 eck$LassoCheckResult]: Stem: 10878#ULTIMATE.startENTRY [66] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_8) (<= 0 v_ULTIMATE.start_main_~x~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret4] 10879#L29 [41] L29-->fENTRY: Formula: (and (= |v_f_#in~yInParam_3| v_ULTIMATE.start_main_~y~0_7) (= |v_f_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f_#in~y=|v_f_#in~yInParam_3|, f_#in~x=|v_f_#in~xInParam_3|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10898#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 10910#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10908#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 10891#L18 [2020-07-01 11:25:07,021 INFO L796 eck$LassoCheckResult]: Loop: 10891#L18 [42] L18-->fENTRY: Formula: (and (= |v_f_#in~xInParam_1| v_f_~y_6) (= |v_f_#in~yInParam_1| (+ v_f_~y_6 (- 1)))) InVars {f_~y=v_f_~y_6} OutVars{f_#in~y=|v_f_#in~yInParam_1|, f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10890#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 10892#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10895#L17 [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 10904#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10920#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 10919#L14 [61] L14-->L17: Formula: (> 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10918#L17 [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 10884#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 10916#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 10917#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 10912#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 10891#L18 [2020-07-01 11:25:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:07,021 INFO L82 PathProgramCache]: Analyzing trace with hash 90850999, now seen corresponding path program 4 times [2020-07-01 11:25:07,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:07,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228979024] [2020-07-01 11:25:07,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:07,029 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:25:07,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:07,029 INFO L82 PathProgramCache]: Analyzing trace with hash -791067597, now seen corresponding path program 2 times [2020-07-01 11:25:07,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:07,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877997671] [2020-07-01 11:25:07,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:25:07,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877997671] [2020-07-01 11:25:07,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550896820] [2020-07-01 11:25:07,110 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:25:07,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:25:07,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:25:07,137 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:25:07,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:25:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:25:07,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:25:07,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-01 11:25:07,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026326217] [2020-07-01 11:25:07,146 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:25:07,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:25:07,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:25:07,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:25:07,147 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. cyclomatic complexity: 34 Second operand 7 states. [2020-07-01 11:25:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:25:07,354 INFO L93 Difference]: Finished difference Result 72 states and 102 transitions. [2020-07-01 11:25:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 11:25:07,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 102 transitions. [2020-07-01 11:25:07,359 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2020-07-01 11:25:07,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 102 transitions. [2020-07-01 11:25:07,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-07-01 11:25:07,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-07-01 11:25:07,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 102 transitions. [2020-07-01 11:25:07,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:25:07,360 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2020-07-01 11:25:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 102 transitions. [2020-07-01 11:25:07,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2020-07-01 11:25:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-01 11:25:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2020-07-01 11:25:07,363 INFO L711 BuchiCegarLoop]: Abstraction has 66 states and 96 transitions. [2020-07-01 11:25:07,363 INFO L591 BuchiCegarLoop]: Abstraction has 66 states and 96 transitions. [2020-07-01 11:25:07,363 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 11:25:07,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 96 transitions. [2020-07-01 11:25:07,364 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2020-07-01 11:25:07,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:25:07,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:25:07,365 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 11:25:07,365 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 1, 1, 1] [2020-07-01 11:25:07,365 INFO L794 eck$LassoCheckResult]: Stem: 11061#ULTIMATE.startENTRY [66] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_8) (<= 0 v_ULTIMATE.start_main_~x~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret4] 11062#L29 [41] L29-->fENTRY: Formula: (and (= |v_f_#in~yInParam_3| v_ULTIMATE.start_main_~y~0_7) (= |v_f_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f_#in~y=|v_f_#in~yInParam_3|, f_#in~x=|v_f_#in~xInParam_3|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11080#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11094#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 11092#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 11081#L18 [2020-07-01 11:25:07,365 INFO L796 eck$LassoCheckResult]: Loop: 11081#L18 [42] L18-->fENTRY: Formula: (and (= |v_f_#in~xInParam_1| v_f_~y_6) (= |v_f_#in~yInParam_1| (+ v_f_~y_6 (- 1)))) InVars {f_~y=v_f_~y_6} OutVars{f_#in~y=|v_f_#in~yInParam_1|, f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11084#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11116#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 11114#L17 [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 11076#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11117#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11075#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 11077#L17 [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 11088#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11108#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11104#L14 [61] L14-->L17: Formula: (> 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 11103#L17 [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 11064#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11124#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11111#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 11096#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 11081#L18 [2020-07-01 11:25:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash 90850999, now seen corresponding path program 5 times [2020-07-01 11:25:07,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:07,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47162965] [2020-07-01 11:25:07,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:07,373 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:25:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1947353758, now seen corresponding path program 3 times [2020-07-01 11:25:07,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:07,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189888155] [2020-07-01 11:25:07,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 11:25:07,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189888155] [2020-07-01 11:25:07,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587002796] [2020-07-01 11:25:07,515 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:25:07,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-01 11:25:07,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:25:07,536 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:25:07,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:25:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-01 11:25:07,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:25:07,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 12 [2020-07-01 11:25:07,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526832547] [2020-07-01 11:25:07,638 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:25:07,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:25:07,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 11:25:07,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-07-01 11:25:07,639 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. cyclomatic complexity: 34 Second operand 13 states. [2020-07-01 11:25:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:25:08,717 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2020-07-01 11:25:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-01 11:25:08,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 120 transitions. [2020-07-01 11:25:08,721 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2020-07-01 11:25:08,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 78 states and 88 transitions. [2020-07-01 11:25:08,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2020-07-01 11:25:08,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2020-07-01 11:25:08,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 88 transitions. [2020-07-01 11:25:08,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:25:08,723 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 88 transitions. [2020-07-01 11:25:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 88 transitions. [2020-07-01 11:25:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2020-07-01 11:25:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 11:25:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2020-07-01 11:25:08,725 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2020-07-01 11:25:08,725 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2020-07-01 11:25:08,726 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-01 11:25:08,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2020-07-01 11:25:08,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2020-07-01 11:25:08,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:25:08,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:25:08,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 11:25:08,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:25:08,727 INFO L794 eck$LassoCheckResult]: Stem: 11338#ULTIMATE.startENTRY [66] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_8) (<= 0 v_ULTIMATE.start_main_~x~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret4] 11339#L29 [41] L29-->fENTRY: Formula: (and (= |v_f_#in~yInParam_3| v_ULTIMATE.start_main_~y~0_7) (= |v_f_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f_#in~y=|v_f_#in~yInParam_3|, f_#in~x=|v_f_#in~xInParam_3|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11358#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11362#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 11361#L17 [43] L17-->L18: Formula: (= 0 v_f_~x_3) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 11342#L18 [42] L18-->fENTRY: Formula: (and (= |v_f_#in~xInParam_1| v_f_~y_6) (= |v_f_#in~yInParam_1| (+ v_f_~y_6 (- 1)))) InVars {f_~y=v_f_~y_6} OutVars{f_#in~y=|v_f_#in~yInParam_1|, f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11341#fENTRY [2020-07-01 11:25:08,727 INFO L796 eck$LassoCheckResult]: Loop: 11341#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11348#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 11386#L17 [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 11340#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11341#fENTRY [2020-07-01 11:25:08,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1478586285, now seen corresponding path program 1 times [2020-07-01 11:25:08,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:08,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986893986] [2020-07-01 11:25:08,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:08,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:25:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2413106, now seen corresponding path program 2 times [2020-07-01 11:25:08,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:08,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011461414] [2020-07-01 11:25:08,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:08,743 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:25:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:08,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2059331972, now seen corresponding path program 1 times [2020-07-01 11:25:08,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:08,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060236282] [2020-07-01 11:25:08,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:08,754 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:25:08,850 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:25:08,850 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:25:08,850 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:25:08,850 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:25:08,851 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:25:08,851 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:25:08,851 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:25:08,851 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:25:08,851 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop [2020-07-01 11:25:08,851 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:25:08,851 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:25:08,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:08,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:08,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:08,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:08,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:08,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:08,978 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:25:08,978 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:25:08,981 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:25:08,982 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:25:09,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:25:09,019 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:25:09,106 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:25:09,108 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:25:09,108 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:25:09,108 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:25:09,108 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:25:09,108 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:25:09,108 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:25:09,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:25:09,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:25:09,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop [2020-07-01 11:25:09,109 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:25:09,109 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:25:09,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:09,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:09,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:09,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:09,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:09,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:09,258 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:25:09,258 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:25:09,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:25:09,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:25:09,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:25:09,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:25:09,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:25:09,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:25:09,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:25:09,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:25:09,267 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:25:09,272 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-01 11:25:09,272 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:25:09,275 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:25:09,276 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:25:09,276 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:25:09,276 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~x, f_#in~y) = 1*f_#in~x + 1*f_#in~y Supporting invariants [] [2020-07-01 11:25:09,305 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:25:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:09,348 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:25:09,349 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:25:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:09,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:25:09,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:25:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:25:09,459 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 11:25:09,459 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-01 11:25:09,459 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-07-01 11:25:09,584 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 50 states and 58 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 60 states and 68 transitions. Complement of second has 16 states. [2020-07-01 11:25:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-01 11:25:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 11:25:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2020-07-01 11:25:09,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-01 11:25:09,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:25:09,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-01 11:25:09,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:25:09,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 8 letters. [2020-07-01 11:25:09,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:25:09,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 68 transitions. [2020-07-01 11:25:09,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-07-01 11:25:09,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 43 states and 50 transitions. [2020-07-01 11:25:09,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-01 11:25:09,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-01 11:25:09,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2020-07-01 11:25:09,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:25:09,590 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-07-01 11:25:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2020-07-01 11:25:09,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 11:25:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 11:25:09,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2020-07-01 11:25:09,592 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-07-01 11:25:09,593 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-07-01 11:25:09,593 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-01 11:25:09,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2020-07-01 11:25:09,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-07-01 11:25:09,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:25:09,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:25:09,594 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-07-01 11:25:09,594 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-07-01 11:25:09,594 INFO L794 eck$LassoCheckResult]: Stem: 11519#ULTIMATE.startENTRY [66] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_8) (<= 0 v_ULTIMATE.start_main_~x~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret4] 11520#L29 [41] L29-->fENTRY: Formula: (and (= |v_f_#in~yInParam_3| v_ULTIMATE.start_main_~y~0_7) (= |v_f_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f_#in~y=|v_f_#in~yInParam_3|, f_#in~x=|v_f_#in~xInParam_3|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11529#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11530#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 11555#L17 [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 11525#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11558#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11538#L14 [2020-07-01 11:25:09,594 INFO L796 eck$LassoCheckResult]: Loop: 11538#L14 [61] L14-->L17: Formula: (> 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 11536#L17 [62] L17-->L20: Formula: (< 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 11522#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11548#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11546#L14 [60] L14-->L17: Formula: (< 0 v_f_~y_3) InVars {f_~y=v_f_~y_3} OutVars{f_~y=v_f_~y_3} AuxVars[] AssignedVars[] 11543#L17 [63] L17-->L20: Formula: (> 0 v_f_~x_4) InVars {f_~x=v_f_~x_4} OutVars{f_~x=v_f_~x_4} AuxVars[] AssignedVars[] 11537#L20 [35] L20-->fENTRY: Formula: (and (= |v_f_#in~xInParam_2| v_f_~y_7) (= |v_f_#in~yInParam_2| (+ v_f_~x_6 (- 1)))) InVars {f_~x=v_f_~x_6, f_~y=v_f_~y_7} OutVars{f_#in~y=|v_f_#in~yInParam_2|, f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~y, f_#in~x]< 11541#fENTRY [48] fENTRY-->L14: Formula: (and (= v_f_~x_1 |v_f_#in~x_1|) (= v_f_~y_1 |v_f_#in~y_1|)) InVars {f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|} OutVars{f_#in~y=|v_f_#in~y_1|, f_#in~x=|v_f_#in~x_1|, f_~x=v_f_~x_1, f_~y=v_f_~y_1} AuxVars[] AssignedVars[f_~x, f_~y] 11538#L14 [2020-07-01 11:25:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:09,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1408483511, now seen corresponding path program 2 times [2020-07-01 11:25:09,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:09,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349766115] [2020-07-01 11:25:09,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:09,604 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:25:09,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:09,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1663612671, now seen corresponding path program 1 times [2020-07-01 11:25:09,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:09,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288507322] [2020-07-01 11:25:09,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:09,613 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:25:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash -805084747, now seen corresponding path program 1 times [2020-07-01 11:25:09,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:25:09,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233568449] [2020-07-01 11:25:09,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:25:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:25:09,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233568449] [2020-07-01 11:25:09,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:25:09,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 11:25:09,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214992213] [2020-07-01 11:25:09,941 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:25:09,942 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:25:09,942 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:25:09,942 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:25:09,942 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:25:09,942 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:25:09,942 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:25:09,942 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:25:09,942 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-07-01 11:25:09,943 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:25:09,943 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:25:09,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:09,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:09,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:09,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:09,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:10,081 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:25:10,081 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:25:10,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:25:10,084 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:25:10,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:25:10,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:25:10,717 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:25:10,719 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:25:10,719 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:25:10,720 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:25:10,720 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:25:10,720 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:25:10,720 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:25:10,720 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:25:10,720 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:25:10,720 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-07-01 11:25:10,720 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:25:10,720 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:25:10,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:10,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:10,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:10,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:10,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:25:10,858 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:25:10,858 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:25:10,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:25:10,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:25:10,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:25:10,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:25:10,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:25:10,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:25:10,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:25:10,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:25:10,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:25:10,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:25:10,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:25:10,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:25:10,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:25:10,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:25:10,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:25:10,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:25:10,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:25:10,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:25:10,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:25:10,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:25:10,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:25:10,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:25:10,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:25:10,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:25:10,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:25:10,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:25:10,940 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:25:10,944 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:25:10,944 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:25:10,948 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:25:10,948 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:25:10,949 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:25:10,949 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_~x) = 1*f_~x Supporting invariants [] [2020-07-01 11:25:10,978 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:25:11,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:11,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:25:11,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:25:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:11,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:25:11,039 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:25:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:25:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:11,189 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:25:11,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:25:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:11,262 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:25:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:11,278 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:25:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:11,293 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:25:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:25:11,308 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:25:11,308 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-07-01 11:25:11,308 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-07-01 11:25:11,309 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 43 states and 50 transitions. cyclomatic complexity: 11 Second operand 7 states. [2020-07-01 11:25:11,928 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 43 states and 50 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 3437 states and 4313 transitions. Complement of second has 1140 states. [2020-07-01 11:25:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 9 non-accepting loop states 2 accepting loop states [2020-07-01 11:25:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:25:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2020-07-01 11:25:11,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 35 transitions. Stem has 7 letters. Loop has 8 letters. [2020-07-01 11:25:11,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:25:11,953 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-01 11:25:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:25:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:12,006 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:25:12,007 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:25:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:25:12,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:25:12,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:25:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:25:12,142 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-01 11:25:12,142 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 43 states and 50 transitions. cyclomatic complexity: 11 Second operand 7 states. [2020-07-01 11:25:12,471 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 43 states and 50 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 802 states and 946 transitions. Complement of second has 285 states. [2020-07-01 11:25:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2020-07-01 11:25:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:25:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2020-07-01 11:25:12,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 7 letters. Loop has 8 letters. [2020-07-01 11:25:12,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:25:12,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 15 letters. Loop has 8 letters. [2020-07-01 11:25:12,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:25:12,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 7 letters. Loop has 16 letters. [2020-07-01 11:25:12,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:25:12,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 802 states and 946 transitions. [2020-07-01 11:25:12,483 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-07-01 11:25:12,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 802 states to 139 states and 158 transitions. [2020-07-01 11:25:12,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-01 11:25:12,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-07-01 11:25:12,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 158 transitions. [2020-07-01 11:25:12,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:25:12,485 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 158 transitions. [2020-07-01 11:25:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 158 transitions. [2020-07-01 11:25:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 57. [2020-07-01 11:25:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-01 11:25:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2020-07-01 11:25:12,487 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2020-07-01 11:25:12,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:25:12,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:25:12,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:25:12,488 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 5 states. [2020-07-01 11:25:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:25:12,591 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-01 11:25:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 11:25:12,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2020-07-01 11:25:12,596 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:25:12,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2020-07-01 11:25:12,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 11:25:12,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 11:25:12,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 11:25:12,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:25:12,597 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:25:12,597 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:25:12,597 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:25:12,597 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-01 11:25:12,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:25:12,597 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:25:12,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 11:25:12,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:25:12 BasicIcfg [2020-07-01 11:25:12,604 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 11:25:12,606 INFO L168 Benchmark]: Toolchain (without parser) took 96570.26 ms. Allocated memory was 649.6 MB in the beginning and 866.6 MB in the end (delta: 217.1 MB). Free memory was 562.8 MB in the beginning and 700.7 MB in the end (delta: -137.8 MB). Peak memory consumption was 79.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:25:12,606 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 582.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:25:12,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.96 ms. Allocated memory was 649.6 MB in the beginning and 694.2 MB in the end (delta: 44.6 MB). Free memory was 562.8 MB in the beginning and 658.1 MB in the end (delta: -95.2 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:25:12,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.26 ms. Allocated memory is still 694.2 MB. Free memory was 658.1 MB in the beginning and 657.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 11:25:12,607 INFO L168 Benchmark]: Boogie Preprocessor took 17.06 ms. Allocated memory is still 694.2 MB. Free memory was 657.0 MB in the beginning and 655.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 11:25:12,608 INFO L168 Benchmark]: RCFGBuilder took 247.10 ms. Allocated memory is still 694.2 MB. Free memory was 655.9 MB in the beginning and 640.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. [2020-07-01 11:25:12,608 INFO L168 Benchmark]: BlockEncodingV2 took 84.39 ms. Allocated memory is still 694.2 MB. Free memory was 640.1 MB in the beginning and 634.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-07-01 11:25:12,609 INFO L168 Benchmark]: TraceAbstraction took 171.13 ms. Allocated memory is still 694.2 MB. Free memory was 633.7 MB in the beginning and 623.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. [2020-07-01 11:25:12,610 INFO L168 Benchmark]: BuchiAutomizer took 95724.11 ms. Allocated memory was 694.2 MB in the beginning and 866.6 MB in the end (delta: 172.5 MB). Free memory was 622.8 MB in the beginning and 700.7 MB in the end (delta: -77.9 MB). Peak memory consumption was 94.6 MB. Max. memory is 50.3 GB. [2020-07-01 11:25:12,613 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 17 locations, 21 edges - StatisticsResult: Encoded RCFG 11 locations, 16 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 582.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 286.96 ms. Allocated memory was 649.6 MB in the beginning and 694.2 MB in the end (delta: 44.6 MB). Free memory was 562.8 MB in the beginning and 658.1 MB in the end (delta: -95.2 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 33.26 ms. Allocated memory is still 694.2 MB. Free memory was 658.1 MB in the beginning and 657.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 17.06 ms. Allocated memory is still 694.2 MB. Free memory was 657.0 MB in the beginning and 655.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 247.10 ms. Allocated memory is still 694.2 MB. Free memory was 655.9 MB in the beginning and 640.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 84.39 ms. Allocated memory is still 694.2 MB. Free memory was 640.1 MB in the beginning and 634.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 171.13 ms. Allocated memory is still 694.2 MB. Free memory was 633.7 MB in the beginning and 623.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 95724.11 ms. Allocated memory was 694.2 MB in the beginning and 866.6 MB in the end (delta: 172.5 MB). Free memory was 622.8 MB in the beginning and 700.7 MB in the end (delta: -77.9 MB). Peak memory consumption was 94.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 locations, 0 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (8 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function \old(y) + \old(x) and consists of 10 locations. One nondeterministic module has affine ranking function -1 * x and consists of 17 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 6 locations. One nondeterministic module has affine ranking function \old(x) + \old(y) and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 9 locations. 8 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 95.6s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 7.0s. Construction of modules took 25.9s. Büchi inclusion checks took 62.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 936 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 68 states and ocurred in iteration 5. Nontrivial modules had stage [4, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/4 HoareTripleCheckerStatistics: 137 SDtfs, 345 SDslu, 279 SDs, 0 SdLazy, 984 SolverSat, 100 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 25.9s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT2 conc0 concLT3 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf100 lsp91 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf90 smp100 dnf100 smp100 tf107 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 11:23:32.658 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_HZridP/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:25:13.447 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check