/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:47:36,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:47:36,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:47:36,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:47:36,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:47:36,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:47:36,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:47:36,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:47:36,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:47:36,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:47:36,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:47:36,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:47:36,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:47:36,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:47:36,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:47:36,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:47:36,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:47:36,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:47:36,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:47:36,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:47:36,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:47:36,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:47:36,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:47:36,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:47:36,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:47:36,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:47:36,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:47:36,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:47:36,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:47:36,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:47:36,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:47:36,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:47:36,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:47:36,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:47:36,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:47:36,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:47:36,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:47:36,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:47:36,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:47:36,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:47:36,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:47:36,912 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 11:47:36,926 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:47:36,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:47:36,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:47:36,928 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:47:36,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:47:36,928 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:47:36,928 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:47:36,929 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:47:36,929 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:47:36,929 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:47:36,929 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:47:36,929 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:47:36,929 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:47:36,930 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:47:36,930 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:47:36,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:47:36,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:47:36,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:47:36,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:47:36,931 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:47:36,931 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:47:36,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:47:36,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:47:36,932 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:47:36,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:47:36,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:47:36,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:47:36,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:47:36,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:47:37,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:47:37,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:47:37,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:47:37,119 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:47:37,119 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:47:37,120 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 11:47:37,209 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_AJFiJS/tmp/ad8f65a97a4d497897c43c6d9e658348/FLAGab75ba0e5 [2020-07-01 11:47:37,559 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:47:37,560 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 11:47:37,567 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_AJFiJS/tmp/ad8f65a97a4d497897c43c6d9e658348/FLAGab75ba0e5 [2020-07-01 11:47:37,955 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_AJFiJS/tmp/ad8f65a97a4d497897c43c6d9e658348 [2020-07-01 11:47:37,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:47:37,968 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:47:37,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:47:37,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:47:37,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:47:37,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:47:37" (1/1) ... [2020-07-01 11:47:37,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252da92a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:37, skipping insertion in model container [2020-07-01 11:47:37,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:47:37" (1/1) ... [2020-07-01 11:47:37,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:47:38,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:47:38,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:47:38,222 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:47:38,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:47:38,252 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:47:38,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38 WrapperNode [2020-07-01 11:47:38,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:47:38,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:47:38,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:47:38,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:47:38,263 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:47:38" (1/1) ... [2020-07-01 11:47:38,268 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:47:38" (1/1) ... [2020-07-01 11:47:38,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:47:38,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:47:38,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:47:38,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:47:38,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38" (1/1) ... [2020-07-01 11:47:38,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38" (1/1) ... [2020-07-01 11:47:38,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38" (1/1) ... [2020-07-01 11:47:38,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38" (1/1) ... [2020-07-01 11:47:38,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38" (1/1) ... [2020-07-01 11:47:38,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38" (1/1) ... [2020-07-01 11:47:38,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38" (1/1) ... [2020-07-01 11:47:38,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:47:38,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:47:38,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:47:38,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:47:38,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38" (1/1) ... No working directory specified, using /export/starexec/sandbox/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:47:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2020-07-01 11:47:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2020-07-01 11:47:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2020-07-01 11:47:38,377 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2020-07-01 11:47:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:47:38,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:47:38,528 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:47:38,528 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-01 11:47:38,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:47:38 BoogieIcfgContainer [2020-07-01 11:47:38,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:47:38,533 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:47:38,533 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:47:38,536 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:47:38,537 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:47:38" (1/1) ... [2020-07-01 11:47:38,552 INFO L313 BlockEncoder]: Initial Icfg 21 locations, 26 edges [2020-07-01 11:47:38,554 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:47:38,554 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:47:38,555 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:47:38,555 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:47:38,557 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:47:38,558 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:47:38,558 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:47:38,571 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:47:38,579 INFO L200 BlockEncoder]: SBE split 0 edges [2020-07-01 11:47:38,584 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:47:38,586 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:47:38,597 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-07-01 11:47:38,600 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-07-01 11:47:38,602 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:47:38,602 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:47:38,602 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:47:38,603 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:47:38,603 INFO L313 BlockEncoder]: Encoded RCFG 17 locations, 22 edges [2020-07-01 11:47:38,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:47:38 BasicIcfg [2020-07-01 11:47:38,604 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:47:38,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:47:38,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:47:38,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:47:38,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:47:37" (1/4) ... [2020-07-01 11:47:38,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adfaed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:47:38, skipping insertion in model container [2020-07-01 11:47:38,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38" (2/4) ... [2020-07-01 11:47:38,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adfaed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:47:38, skipping insertion in model container [2020-07-01 11:47:38,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:47:38" (3/4) ... [2020-07-01 11:47:38,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adfaed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:47:38, skipping insertion in model container [2020-07-01 11:47:38,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:47:38" (4/4) ... [2020-07-01 11:47:38,613 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:47:38,623 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:47:38,630 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 11:47:38,645 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 11:47:38,672 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:47:38,672 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:47:38,672 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:47:38,673 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:47:38,673 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:47:38,673 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:47:38,673 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:47:38,673 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:47:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-07-01 11:47:38,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:47:38,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-07-01 11:47:38,781 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-01 11:47:38,781 INFO L271 CegarLoopResult]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2020-07-01 11:47:38,782 INFO L268 CegarLoopResult]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2020-07-01 11:47:38,782 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-01 11:47:38,782 INFO L268 CegarLoopResult]: For program point L12(lines 12 13) no Hoare annotation was computed. [2020-07-01 11:47:38,783 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-01 11:47:38,783 INFO L268 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2020-07-01 11:47:38,783 INFO L268 CegarLoopResult]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2020-07-01 11:47:38,783 INFO L271 CegarLoopResult]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2020-07-01 11:47:38,783 INFO L268 CegarLoopResult]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2020-07-01 11:47:38,783 INFO L268 CegarLoopResult]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2020-07-01 11:47:38,784 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-01 11:47:38,784 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-07-01 11:47:38,784 INFO L268 CegarLoopResult]: For program point L18(lines 18 19) no Hoare annotation was computed. [2020-07-01 11:47:38,784 INFO L268 CegarLoopResult]: For program point L20-2(line 20) no Hoare annotation was computed. [2020-07-01 11:47:38,784 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:47:38,784 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-01 11:47:38,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:47:38 BasicIcfg [2020-07-01 11:47:38,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:47:38,790 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:47:38,790 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:47:38,794 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:47:38,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:47:38,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:47:37" (1/5) ... [2020-07-01 11:47:38,796 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a0454d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:47:38, skipping insertion in model container [2020-07-01 11:47:38,796 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:47:38,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:47:38" (2/5) ... [2020-07-01 11:47:38,796 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a0454d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:47:38, skipping insertion in model container [2020-07-01 11:47:38,796 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:47:38,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:47:38" (3/5) ... [2020-07-01 11:47:38,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a0454d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:47:38, skipping insertion in model container [2020-07-01 11:47:38,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:47:38,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:47:38" (4/5) ... [2020-07-01 11:47:38,798 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a0454d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:47:38, skipping insertion in model container [2020-07-01 11:47:38,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:47:38,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:47:38" (5/5) ... [2020-07-01 11:47:38,799 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:47:38,827 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:47:38,827 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:47:38,828 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:47:38,828 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:47:38,828 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:47:38,828 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:47:38,828 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:47:38,828 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:47:38,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-01 11:47:38,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-01 11:47:38,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:47:38,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:47:38,861 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:47:38,861 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:47:38,862 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:47:38,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-01 11:47:38,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-01 11:47:38,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:47:38,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:47:38,865 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:47:38,865 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:47:38,870 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 18#L25true [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue [2020-07-01 11:47:38,871 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 16#L18true [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 15#L20true [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 4#rec1ENTRYtrue [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 9#L12true [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 5#rec1FINALtrue [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12#rec1EXITtrue >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 19#L20-1true [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue [2020-07-01 11:47:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:38,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 1 times [2020-07-01 11:47:38,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:38,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401931716] [2020-07-01 11:47:38,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:38,953 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:38,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1865651641, now seen corresponding path program 1 times [2020-07-01 11:47:38,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:38,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256765023] [2020-07-01 11:47:38,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:38,980 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:38,982 INFO L82 PathProgramCache]: Analyzing trace with hash -639583504, now seen corresponding path program 1 times [2020-07-01 11:47:38,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:38,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102725056] [2020-07-01 11:47:38,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:38,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:39,147 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:47:39,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:47:39,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:47:39,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:47:39,149 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:47:39,149 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:47:39,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:47:39,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:47:39,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:47:39,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:47:39,150 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:47:39,166 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:47:39,173 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:47:39,176 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:47:39,179 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:47:39,181 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:47:39,240 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:47:39,241 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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:47:39,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:47:39,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:47:39,258 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:47:39,259 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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:47:39,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:47:39,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:47:39,299 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:47:39,300 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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:47:39,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:47:39,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:47:39,339 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:47:39,339 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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:47:39,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:47:39,374 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:47:39,378 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:47:39,378 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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:47:39,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:47:39,413 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:47:39,451 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:47:39,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:47:39,458 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:47:39,488 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:47:39,488 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:47:39,488 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:47:39,488 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:47:39,488 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:47:39,489 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:47:39,489 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:47:39,489 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:47:39,489 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:47:39,489 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:47:39,489 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:47:39,491 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:47:39,494 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:47:39,497 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:47:39,499 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:47:39,507 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:47:39,552 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:47:39,558 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/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:47:39,564 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:47:39,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:47:39,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:47:39,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:47:39,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:47:39,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:47:39,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:47:39,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:47:39,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/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:47:39,608 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:47:39,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:47:39,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:47:39,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:47:39,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:47:39,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:47:39,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:47:39,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:47:39,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/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:47:39,649 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:47:39,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:47:39,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:47:39,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:47:39,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:47:39,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:47:39,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:47:39,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:47:39,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/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:47:39,689 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:47:39,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:47:39,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:47:39,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:47:39,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:47:39,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:47:39,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:47:39,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:47:39,697 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:47:39,702 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:47:39,702 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:47:39,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:47:39,708 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:47:39,709 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:47:39,709 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2020-07-01 11:47:39,743 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:47:39,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:39,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:47:39,796 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:39,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:47:39,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:39,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:47:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:39,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:47:39,996 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:40,084 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:47:40,084 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-07-01 11:47:40,089 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 9 loop predicates [2020-07-01 11:47:40,091 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states. Second operand 7 states. [2020-07-01 11:47:40,798 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states.. Second operand 7 states. Result 193 states and 255 transitions. Complement of second has 56 states. [2020-07-01 11:47:40,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 11 non-accepting loop states 2 accepting loop states [2020-07-01 11:47:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:47:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 99 transitions. [2020-07-01 11:47:40,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 99 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-01 11:47:40,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:47:40,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 99 transitions. Stem has 10 letters. Loop has 8 letters. [2020-07-01 11:47:40,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:47:40,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 99 transitions. Stem has 2 letters. Loop has 16 letters. [2020-07-01 11:47:40,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:47:40,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 255 transitions. [2020-07-01 11:47:40,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-01 11:47:40,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 40 states and 58 transitions. [2020-07-01 11:47:40,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-07-01 11:47:40,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-07-01 11:47:40,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2020-07-01 11:47:40,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:47:40,848 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2020-07-01 11:47:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2020-07-01 11:47:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2020-07-01 11:47:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 11:47:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-07-01 11:47:40,883 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-01 11:47:40,883 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-01 11:47:40,883 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 11:47:40,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2020-07-01 11:47:40,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-01 11:47:40,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:47:40,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:47:40,885 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:47:40,885 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:47:40,886 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 373#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 370#rec2ENTRY [2020-07-01 11:47:40,887 INFO L796 eck$LassoCheckResult]: Loop: 370#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 372#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 387#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 388#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 391#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 375#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 374#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 381#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 382#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 383#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 380#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 374#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 381#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 382#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 383#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 377#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 374#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 381#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 382#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 383#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 385#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 390#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 389#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 371#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 370#rec2ENTRY [2020-07-01 11:47:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 2 times [2020-07-01 11:47:40,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:40,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289835764] [2020-07-01 11:47:40,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:40,893 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash -129367784, now seen corresponding path program 1 times [2020-07-01 11:47:40,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:40,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013881305] [2020-07-01 11:47:40,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:40,927 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:40,928 INFO L82 PathProgramCache]: Analyzing trace with hash -287187007, now seen corresponding path program 1 times [2020-07-01 11:47:40,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:40,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623620152] [2020-07-01 11:47:40,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:40,962 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:41,206 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:47:41,206 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:47:41,206 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:47:41,206 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:47:41,206 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:47:41,206 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:47:41,207 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:47:41,207 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:47:41,207 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:47:41,207 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:47:41,207 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:47:41,208 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:47:41,215 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:47:41,217 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:47:41,219 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:47:41,226 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:47:41,255 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:47:41,255 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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:47:41,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:47:41,259 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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:47:41,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:47:41,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:47:41,301 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:47:41,330 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:47:41,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:47:41,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:47:41,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:47:41,331 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:47:41,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:47:41,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:47:41,331 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:47:41,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:47:41,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:47:41,332 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:47:41,333 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:47:41,340 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:47:41,343 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:47:41,345 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:47:41,347 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:47:41,372 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:47:41,372 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:47:41,376 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:47:41,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:47:41,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:47:41,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:47:41,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:47:41,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:47:41,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:47:41,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:47:41,382 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:47:41,386 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 11:47:41,386 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:47:41,390 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:47:41,390 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:47:41,390 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:47:41,391 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2020-07-01 11:47:41,420 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:47:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:41,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:47:41,446 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:41,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-01 11:47:41,480 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-01 11:47:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:41,695 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:47:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:41,725 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:47:41,725 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization [2020-07-01 11:47:41,725 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 10 loop predicates [2020-07-01 11:47:41,726 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand 10 states. [2020-07-01 11:47:42,429 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 145 states and 219 transitions. Complement of second has 72 states. [2020-07-01 11:47:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2020-07-01 11:47:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 11:47:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2020-07-01 11:47:42,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 73 transitions. Stem has 2 letters. Loop has 24 letters. [2020-07-01 11:47:42,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:47:42,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 73 transitions. Stem has 26 letters. Loop has 24 letters. [2020-07-01 11:47:42,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:47:42,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 73 transitions. Stem has 2 letters. Loop has 48 letters. [2020-07-01 11:47:42,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:47:42,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 219 transitions. [2020-07-01 11:47:42,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-07-01 11:47:42,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 134 states and 208 transitions. [2020-07-01 11:47:42,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2020-07-01 11:47:42,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2020-07-01 11:47:42,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 208 transitions. [2020-07-01 11:47:42,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:47:42,454 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 208 transitions. [2020-07-01 11:47:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 208 transitions. [2020-07-01 11:47:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 52. [2020-07-01 11:47:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-01 11:47:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2020-07-01 11:47:42,470 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2020-07-01 11:47:42,471 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2020-07-01 11:47:42,471 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 11:47:42,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 75 transitions. [2020-07-01 11:47:42,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-01 11:47:42,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:47:42,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:47:42,474 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:47:42,474 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-07-01 11:47:42,474 INFO L794 eck$LassoCheckResult]: Stem: 782#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 783#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 787#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 748#L18 [2020-07-01 11:47:42,475 INFO L796 eck$LassoCheckResult]: Loop: 748#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 772#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 784#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 777#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 757#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 754#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 755#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 758#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 756#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 753#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 774#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 775#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 791#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 790#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 789#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 779#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 747#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 746#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 748#L18 [2020-07-01 11:47:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash 76732, now seen corresponding path program 1 times [2020-07-01 11:47:42,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:42,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422379088] [2020-07-01 11:47:42,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:42,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1000338971, now seen corresponding path program 2 times [2020-07-01 11:47:42,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:42,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688004561] [2020-07-01 11:47:42,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-07-01 11:47:42,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688004561] [2020-07-01 11:47:42,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895825323] [2020-07-01 11:47:42,666 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:47:42,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:47:42,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:47:42,726 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:47:42,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-07-01 11:47:42,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:47:42,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-01 11:47:42,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264863422] [2020-07-01 11:47:42,758 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:47:42,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:47:42,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:47:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:47:42,763 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. cyclomatic complexity: 27 Second operand 8 states. [2020-07-01 11:47:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:47:42,859 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2020-07-01 11:47:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:47:42,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 85 transitions. [2020-07-01 11:47:42,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-01 11:47:42,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 85 transitions. [2020-07-01 11:47:42,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-01 11:47:42,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-07-01 11:47:42,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 85 transitions. [2020-07-01 11:47:42,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:47:42,868 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 85 transitions. [2020-07-01 11:47:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 85 transitions. [2020-07-01 11:47:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2020-07-01 11:47:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-01 11:47:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2020-07-01 11:47:42,875 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 82 transitions. [2020-07-01 11:47:42,875 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 82 transitions. [2020-07-01 11:47:42,875 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 11:47:42,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 82 transitions. [2020-07-01 11:47:42,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-01 11:47:42,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:47:42,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:47:42,879 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:47:42,879 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 7, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-07-01 11:47:42,879 INFO L794 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1105#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1108#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1067#L18 [2020-07-01 11:47:42,880 INFO L796 eck$LassoCheckResult]: Loop: 1067#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1072#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1071#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1073#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1079#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1097#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1120#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1077#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1086#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1078#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1097#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1120#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1084#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1097#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1120#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1077#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1086#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1083#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1097#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1120#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1077#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1086#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1085#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1097#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1120#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1077#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1086#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1099#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1100#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1119#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1080#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1097#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1120#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1084#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1097#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1120#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1077#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1086#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1083#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1097#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1120#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1077#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1086#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1085#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1097#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1120#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1077#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1086#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1099#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1100#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1119#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1118#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1116#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1115#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 1066#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 1065#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1067#L18 [2020-07-01 11:47:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:42,881 INFO L82 PathProgramCache]: Analyzing trace with hash 76732, now seen corresponding path program 2 times [2020-07-01 11:47:42,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:42,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725318567] [2020-07-01 11:47:42,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:42,886 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1577716842, now seen corresponding path program 3 times [2020-07-01 11:47:42,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:42,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031869950] [2020-07-01 11:47:42,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-07-01 11:47:43,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031869950] [2020-07-01 11:47:43,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078867712] [2020-07-01 11:47:43,027 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:47:43,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2020-07-01 11:47:43,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:47:43,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:47:43,076 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 115 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-07-01 11:47:43,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:47:43,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-01 11:47:43,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905901574] [2020-07-01 11:47:43,098 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:47:43,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:47:43,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:47:43,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:47:43,099 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. cyclomatic complexity: 30 Second operand 8 states. [2020-07-01 11:47:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:47:43,207 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2020-07-01 11:47:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:47:43,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 100 transitions. [2020-07-01 11:47:43,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-01 11:47:43,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 100 transitions. [2020-07-01 11:47:43,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-07-01 11:47:43,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-07-01 11:47:43,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 100 transitions. [2020-07-01 11:47:43,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:47:43,217 INFO L688 BuchiCegarLoop]: Abstraction has 67 states and 100 transitions. [2020-07-01 11:47:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 100 transitions. [2020-07-01 11:47:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2020-07-01 11:47:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-01 11:47:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2020-07-01 11:47:43,224 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2020-07-01 11:47:43,224 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2020-07-01 11:47:43,224 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 11:47:43,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 90 transitions. [2020-07-01 11:47:43,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-01 11:47:43,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:47:43,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:47:43,228 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:47:43,228 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 13, 9, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2020-07-01 11:47:43,228 INFO L794 eck$LassoCheckResult]: Stem: 1530#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1531#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1533#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1490#L18 [2020-07-01 11:47:43,229 INFO L796 eck$LassoCheckResult]: Loop: 1490#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1495#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1494#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1496#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1502#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1508#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1500#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1511#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1507#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1500#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1511#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1509#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1500#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1511#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1526#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1527#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1544#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1504#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1508#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1500#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1511#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1507#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1500#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1511#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1509#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1500#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1511#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1526#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1527#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1544#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1510#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1508#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1500#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1511#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1507#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1500#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1511#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1509#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1524#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1547#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1500#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1511#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1526#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1527#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1544#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1542#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1540#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1537#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 1489#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 1488#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1490#L18 [2020-07-01 11:47:43,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:43,230 INFO L82 PathProgramCache]: Analyzing trace with hash 76732, now seen corresponding path program 3 times [2020-07-01 11:47:43,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:43,230 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868671105] [2020-07-01 11:47:43,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:43,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:43,236 INFO L82 PathProgramCache]: Analyzing trace with hash -865815173, now seen corresponding path program 4 times [2020-07-01 11:47:43,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:43,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242286656] [2020-07-01 11:47:43,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 57 proven. 58 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-07-01 11:47:43,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242286656] [2020-07-01 11:47:43,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261666426] [2020-07-01 11:47:43,401 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:47:43,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-01 11:47:43,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:47:43,453 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:47:43,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 194 proven. 23 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2020-07-01 11:47:43,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:47:43,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-01 11:47:43,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777356231] [2020-07-01 11:47:43,482 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:47:43,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:47:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 11:47:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:47:43,483 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. cyclomatic complexity: 34 Second operand 10 states. [2020-07-01 11:47:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:47:43,581 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2020-07-01 11:47:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 11:47:43,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 65 transitions. [2020-07-01 11:47:43,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 11:47:43,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 65 transitions. [2020-07-01 11:47:43,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-01 11:47:43,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-07-01 11:47:43,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 65 transitions. [2020-07-01 11:47:43,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:47:43,588 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 65 transitions. [2020-07-01 11:47:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 65 transitions. [2020-07-01 11:47:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2020-07-01 11:47:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 11:47:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-07-01 11:47:43,593 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-07-01 11:47:43,593 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-07-01 11:47:43,593 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 11:47:43,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 57 transitions. [2020-07-01 11:47:43,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 11:47:43,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:47:43,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:47:43,595 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:47:43,595 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 11:47:43,595 INFO L794 eck$LassoCheckResult]: Stem: 2026#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1993#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1992#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1994#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1999#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1998#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2000#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2010#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2020#rec1ENTRY [2020-07-01 11:47:43,595 INFO L796 eck$LassoCheckResult]: Loop: 2020#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2029#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2008#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2020#rec1ENTRY [2020-07-01 11:47:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 1 times [2020-07-01 11:47:43,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:43,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363923750] [2020-07-01 11:47:43,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:43,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:43,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash 69333, now seen corresponding path program 1 times [2020-07-01 11:47:43,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:43,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960377959] [2020-07-01 11:47:43,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:43,607 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:43,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1667358318, now seen corresponding path program 2 times [2020-07-01 11:47:43,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:43,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671509450] [2020-07-01 11:47:43,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:43,615 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:43,644 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:47:43,644 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:47:43,645 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:47:43,645 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:47:43,645 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:47:43,645 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:47:43,645 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:47:43,645 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:47:43,645 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-07-01 11:47:43,645 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:47:43,646 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:47:43,647 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:47:43,650 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:47:43,656 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:47:43,658 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:47:43,661 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:47:43,664 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:47:43,692 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:47:43,692 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:47:43,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:47:43,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:47:43,701 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:47:43,701 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:47:43,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:47:43,735 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:47:43,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:47:43,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:47:43,807 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:47:43,809 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:47:43,809 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:47:43,809 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:47:43,809 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:47:43,809 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:47:43,809 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:47:43,809 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:47:43,809 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:47:43,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-07-01 11:47:43,810 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:47:43,810 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:47:43,811 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:47:43,813 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:47:43,820 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:47:43,822 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:47:43,824 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:47:43,826 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:47:43,851 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:47:43,851 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:47:43,856 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:47:43,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:47:43,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:47:43,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:47:43,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:47:43,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:47:43,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:47:43,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:47:43,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:47:43,895 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:47:43,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:47:43,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:47:43,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:47:43,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:47:43,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:47:43,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:47:43,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:47:43,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:47:43,903 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 11:47:43,903 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/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:47:43,907 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:47:43,907 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:47:43,907 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:47:43,907 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2020-07-01 11:47:43,937 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:47:43,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,969 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:47:43,970 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:43,978 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:47:43,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:43,993 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:47:44,000 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 11:47:44,000 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 3 loop predicates [2020-07-01 11:47:44,000 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 57 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-07-01 11:47:44,069 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 57 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 180 states and 213 transitions. Complement of second has 47 states. [2020-07-01 11:47:44,070 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:47:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 11:47:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-01 11:47:44,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-01 11:47:44,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:47:44,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-01 11:47:44,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:47:44,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-01 11:47:44,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:47:44,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 213 transitions. [2020-07-01 11:47:44,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-01 11:47:44,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 83 states and 113 transitions. [2020-07-01 11:47:44,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-07-01 11:47:44,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-07-01 11:47:44,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 113 transitions. [2020-07-01 11:47:44,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:47:44,081 INFO L688 BuchiCegarLoop]: Abstraction has 83 states and 113 transitions. [2020-07-01 11:47:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 113 transitions. [2020-07-01 11:47:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2020-07-01 11:47:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-01 11:47:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2020-07-01 11:47:44,088 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. [2020-07-01 11:47:44,088 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. [2020-07-01 11:47:44,088 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 11:47:44,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 77 transitions. [2020-07-01 11:47:44,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 11:47:44,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:47:44,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:47:44,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:47:44,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2020-07-01 11:47:44,090 INFO L794 eck$LassoCheckResult]: Stem: 2351#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 2317#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 2316#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 2318#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 2337#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 2353#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2372#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2324#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2322#rec1ENTRY [2020-07-01 11:47:44,091 INFO L796 eck$LassoCheckResult]: Loop: 2322#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2325#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2332#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2352#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2325#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2332#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2352#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2349#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2331#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2333#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 2344#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 2338#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2358#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2357#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2356#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 2343#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 2338#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2358#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2357#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2356#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 2342#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 2346#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2373#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 2344#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 2338#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2358#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2323#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2322#rec1ENTRY [2020-07-01 11:47:44,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:44,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 3 times [2020-07-01 11:47:44,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:44,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149995179] [2020-07-01 11:47:44,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:44,098 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:44,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:44,098 INFO L82 PathProgramCache]: Analyzing trace with hash -561081304, now seen corresponding path program 1 times [2020-07-01 11:47:44,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:44,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058337215] [2020-07-01 11:47:44,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-01 11:47:44,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058337215] [2020-07-01 11:47:44,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951112302] [2020-07-01 11:47:44,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:47:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:44,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:47:44,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:47:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-01 11:47:44,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:47:44,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-01 11:47:44,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497112467] [2020-07-01 11:47:44,217 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:47:44,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:47:44,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:47:44,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:47:44,218 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. cyclomatic complexity: 19 Second operand 8 states. [2020-07-01 11:47:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:47:44,282 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2020-07-01 11:47:44,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 11:47:44,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 83 transitions. [2020-07-01 11:47:44,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 11:47:44,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 83 transitions. [2020-07-01 11:47:44,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-07-01 11:47:44,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-07-01 11:47:44,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 83 transitions. [2020-07-01 11:47:44,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:47:44,288 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 83 transitions. [2020-07-01 11:47:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 83 transitions. [2020-07-01 11:47:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-07-01 11:47:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-01 11:47:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2020-07-01 11:47:44,294 INFO L711 BuchiCegarLoop]: Abstraction has 69 states and 83 transitions. [2020-07-01 11:47:44,294 INFO L591 BuchiCegarLoop]: Abstraction has 69 states and 83 transitions. [2020-07-01 11:47:44,294 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 11:47:44,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 83 transitions. [2020-07-01 11:47:44,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 11:47:44,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:47:44,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:47:44,296 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:47:44,296 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2, 2, 2, 1, 1, 1, 1] [2020-07-01 11:47:44,297 INFO L794 eck$LassoCheckResult]: Stem: 2614#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 2576#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 2575#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 2577#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 2597#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 2616#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2624#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2583#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2581#rec1ENTRY [2020-07-01 11:47:44,297 INFO L796 eck$LassoCheckResult]: Loop: 2581#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2584#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2603#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2630#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2635#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2629#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2611#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 2612#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 2598#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2622#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2620#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2619#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 2605#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 2608#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2623#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2582#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2581#rec1ENTRY [2020-07-01 11:47:44,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:44,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 4 times [2020-07-01 11:47:44,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:44,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516716624] [2020-07-01 11:47:44,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:47:44,305 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:47:44,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:47:44,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1762080644, now seen corresponding path program 1 times [2020-07-01 11:47:44,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:47:44,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604946481] [2020-07-01 11:47:44,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:47:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:47:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-01 11:47:44,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604946481] [2020-07-01 11:47:44,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:47:44,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 11:47:44,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819136906] [2020-07-01 11:47:44,357 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:47:44,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:47:44,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:47:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:47:44,357 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. cyclomatic complexity: 17 Second operand 6 states. [2020-07-01 11:47:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:47:44,416 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2020-07-01 11:47:44,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 11:47:44,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 79 transitions. [2020-07-01 11:47:44,419 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:47:44,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2020-07-01 11:47:44,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 11:47:44,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 11:47:44,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 11:47:44,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:47:44,420 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:47:44,420 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:47:44,420 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:47:44,420 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-01 11:47:44,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:47:44,420 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:47:44,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 11:47:44,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:47:44 BasicIcfg [2020-07-01 11:47:44,427 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 11:47:44,429 INFO L168 Benchmark]: Toolchain (without parser) took 6460.37 ms. Allocated memory was 649.6 MB in the beginning and 848.3 MB in the end (delta: 198.7 MB). Free memory was 561.7 MB in the beginning and 798.6 MB in the end (delta: -236.9 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:47:44,429 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:47:44,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.71 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 561.7 MB in the beginning and 648.5 MB in the end (delta: -86.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-07-01 11:47:44,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.86 ms. Allocated memory is still 685.2 MB. Free memory was 648.5 MB in the beginning and 647.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:47:44,431 INFO L168 Benchmark]: Boogie Preprocessor took 16.70 ms. Allocated memory is still 685.2 MB. Free memory was 647.2 MB in the beginning and 643.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:47:44,432 INFO L168 Benchmark]: RCFGBuilder took 229.34 ms. Allocated memory is still 685.2 MB. Free memory was 643.0 MB in the beginning and 627.2 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 50.3 GB. [2020-07-01 11:47:44,432 INFO L168 Benchmark]: BlockEncodingV2 took 70.99 ms. Allocated memory is still 685.2 MB. Free memory was 627.2 MB in the beginning and 621.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:47:44,433 INFO L168 Benchmark]: TraceAbstraction took 184.12 ms. Allocated memory is still 685.2 MB. Free memory was 621.8 MB in the beginning and 609.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:47:44,433 INFO L168 Benchmark]: BuchiAutomizer took 5636.57 ms. Allocated memory was 685.2 MB in the beginning and 848.3 MB in the end (delta: 163.1 MB). Free memory was 608.3 MB in the beginning and 798.6 MB in the end (delta: -190.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:47:44,436 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 21 locations, 26 edges - StatisticsResult: Encoded RCFG 17 locations, 22 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 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 283.71 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 561.7 MB in the beginning and 648.5 MB in the end (delta: -86.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 32.86 ms. Allocated memory is still 685.2 MB. Free memory was 648.5 MB in the beginning and 647.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 16.70 ms. Allocated memory is still 685.2 MB. Free memory was 647.2 MB in the beginning and 643.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 229.34 ms. Allocated memory is still 685.2 MB. Free memory was 643.0 MB in the beginning and 627.2 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 70.99 ms. Allocated memory is still 685.2 MB. Free memory was 627.2 MB in the beginning and 621.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 184.12 ms. Allocated memory is still 685.2 MB. Free memory was 621.8 MB in the beginning and 609.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5636.57 ms. Allocated memory was 685.2 MB in the beginning and 848.3 MB in the end (delta: 163.1 MB). Free memory was 608.3 MB in the beginning and 798.6 MB in the end (delta: -190.3 MB). There was no memory consumed. 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 3 procedures, 17 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=17occurred 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, 8 LocationsWithAnnotation, 23 PreInvPairs, 23 NumberOfFragments, 8 HoareAnnotationTreeSize, 23 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function \old(j) and consists of 15 locations. One nondeterministic module has affine ranking function \old(j) and consists of 18 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 9 iterations. TraceHistogramMax:13. Analysis of lassos took 2.7s. Construction of modules took 0.6s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 136 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 69 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 19/24 HoareTripleCheckerStatistics: 157 SDtfs, 189 SDslu, 414 SDs, 0 SdLazy, 714 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq144 hnf93 smp100 dnf100 smp100 tf113 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 11:47:34.673 ----------------------------------------------- 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/sandbox/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/sandbox/tmp/BenchExec_run_AJFiJS/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:47:45.474 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check