YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:31:09,814 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:31:09,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:31:09,828 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:31:09,828 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:31:09,829 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:31:09,831 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:31:09,832 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:31:09,834 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:31:09,834 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:31:09,835 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:31:09,836 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:31:09,836 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:31:09,837 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:31:09,838 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:31:09,839 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:31:09,840 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:31:09,842 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:31:09,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:31:09,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:31:09,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:31:09,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:31:09,849 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:31:09,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:31:09,849 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:31:09,850 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:31:09,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:31:09,851 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:31:09,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:31:09,852 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:31:09,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:31:09,854 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:31:09,855 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:31:09,855 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:31:09,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:31:09,856 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:31:09,856 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:31:09,857 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:31:09,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:31:09,858 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 05:31:09,872 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:31:09,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:31:09,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:31:09,874 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:31:09,874 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:31:09,874 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:31:09,874 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:31:09,874 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:31:09,875 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:31:09,875 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:31:09,875 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:31:09,875 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:31:09,875 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:31:09,875 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:31:09,875 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:31:09,876 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:31:09,876 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:31:09,876 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:31:09,876 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:31:09,876 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:31:09,876 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:31:09,877 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:31:09,877 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:31:09,877 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:31:09,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:31:09,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:31:09,877 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:31:09,878 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:31:09,878 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:31:09,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:31:09,916 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:31:09,920 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:31:09,921 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:31:09,922 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:31:09,922 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:31:09,990 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/b039d4c5bc61446894f3c77fa132d246/FLAGdac914481 [2020-06-22 05:31:10,329 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:31:10,330 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:31:10,336 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/b039d4c5bc61446894f3c77fa132d246/FLAGdac914481 [2020-06-22 05:31:10,728 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/b039d4c5bc61446894f3c77fa132d246 [2020-06-22 05:31:10,739 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:31:10,741 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:31:10,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:31:10,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:31:10,745 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:31:10,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:31:10" (1/1) ... [2020-06-22 05:31:10,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2745322a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:10, skipping insertion in model container [2020-06-22 05:31:10,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:31:10" (1/1) ... [2020-06-22 05:31:10,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:31:10,775 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:31:10,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:31:10,935 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:31:11,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:31:11,035 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:31:11,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11 WrapperNode [2020-06-22 05:31:11,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:31:11,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:31:11,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:31:11,037 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:31:11,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (1/1) ... [2020-06-22 05:31:11,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (1/1) ... [2020-06-22 05:31:11,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:31:11,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:31:11,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:31:11,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:31:11,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (1/1) ... [2020-06-22 05:31:11,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (1/1) ... [2020-06-22 05:31:11,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (1/1) ... [2020-06-22 05:31:11,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (1/1) ... [2020-06-22 05:31:11,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (1/1) ... [2020-06-22 05:31:11,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (1/1) ... [2020-06-22 05:31:11,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (1/1) ... [2020-06-22 05:31:11,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:31:11,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:31:11,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:31:11,090 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:31:11,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (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-06-22 05:31:11,161 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2020-06-22 05:31:11,161 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2020-06-22 05:31:11,161 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2020-06-22 05:31:11,161 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2020-06-22 05:31:11,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:31:11,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:31:11,318 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:31:11,318 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 05:31:11,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:31:11 BoogieIcfgContainer [2020-06-22 05:31:11,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:31:11,321 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:31:11,321 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:31:11,323 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:31:11,324 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:31:11" (1/1) ... [2020-06-22 05:31:11,343 INFO L313 BlockEncoder]: Initial Icfg 21 locations, 26 edges [2020-06-22 05:31:11,345 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:31:11,345 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:31:11,346 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:31:11,346 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:31:11,348 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:31:11,349 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:31:11,349 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:31:11,365 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:31:11,373 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 05:31:11,378 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:31:11,380 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:31:11,397 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 05:31:11,399 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 05:31:11,401 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:31:11,401 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:31:11,402 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:31:11,402 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:31:11,403 INFO L313 BlockEncoder]: Encoded RCFG 17 locations, 22 edges [2020-06-22 05:31:11,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:31:11 BasicIcfg [2020-06-22 05:31:11,403 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:31:11,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:31:11,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:31:11,407 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:31:11,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:31:10" (1/4) ... [2020-06-22 05:31:11,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa7922f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:31:11, skipping insertion in model container [2020-06-22 05:31:11,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (2/4) ... [2020-06-22 05:31:11,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa7922f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:31:11, skipping insertion in model container [2020-06-22 05:31:11,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:31:11" (3/4) ... [2020-06-22 05:31:11,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa7922f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:31:11, skipping insertion in model container [2020-06-22 05:31:11,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:31:11" (4/4) ... [2020-06-22 05:31:11,411 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:31:11,421 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:31:11,429 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 05:31:11,447 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 05:31:11,479 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:31:11,480 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:31:11,480 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:31:11,480 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:31:11,480 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:31:11,480 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:31:11,480 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:31:11,481 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:31:11,481 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:31:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-06-22 05:31:11,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:31:11,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-06-22 05:31:11,580 INFO L451 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: true [2020-06-22 05:31:11,580 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2020-06-22 05:31:11,580 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2020-06-22 05:31:11,580 INFO L451 ceAbstractionStarter]: At program point L14-1(line 14) the Hoare annotation is: true [2020-06-22 05:31:11,581 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2020-06-22 05:31:11,581 INFO L451 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: true [2020-06-22 05:31:11,581 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2020-06-22 05:31:11,581 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2020-06-22 05:31:11,581 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2020-06-22 05:31:11,582 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2020-06-22 05:31:11,582 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2020-06-22 05:31:11,582 INFO L451 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: true [2020-06-22 05:31:11,582 INFO L451 ceAbstractionStarter]: At program point L20-1(line 20) the Hoare annotation is: true [2020-06-22 05:31:11,582 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2020-06-22 05:31:11,583 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2020-06-22 05:31:11,583 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:31:11,583 INFO L451 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: true [2020-06-22 05:31:11,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:31:11 BasicIcfg [2020-06-22 05:31:11,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:31:11,587 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:31:11,587 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:31:11,591 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:31:11,591 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:31:11,592 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:31:10" (1/5) ... [2020-06-22 05:31:11,592 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a3bb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:31:11, skipping insertion in model container [2020-06-22 05:31:11,592 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:31:11,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:11" (2/5) ... [2020-06-22 05:31:11,593 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a3bb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:31:11, skipping insertion in model container [2020-06-22 05:31:11,593 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:31:11,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:31:11" (3/5) ... [2020-06-22 05:31:11,594 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a3bb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:31:11, skipping insertion in model container [2020-06-22 05:31:11,594 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:31:11,594 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:31:11" (4/5) ... [2020-06-22 05:31:11,594 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a3bb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:31:11, skipping insertion in model container [2020-06-22 05:31:11,594 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:31:11,594 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:31:11" (5/5) ... [2020-06-22 05:31:11,596 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:31:11,625 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:31:11,625 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:31:11,625 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:31:11,626 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:31:11,626 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:31:11,626 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:31:11,626 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:31:11,626 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:31:11,626 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:31:11,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-06-22 05:31:11,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 05:31:11,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:31:11,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:31:11,660 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:31:11,660 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:31:11,660 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:31:11,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-06-22 05:31:11,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 05:31:11,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:31:11,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:31:11,663 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:31:11,663 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:31:11,668 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-06-22 05:31:11,669 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-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue [2020-06-22 05:31:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:11,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 1 times [2020-06-22 05:31:11,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:11,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:11,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:11,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:11,739 INFO L82 PathProgramCache]: Analyzing trace with hash 68343, now seen corresponding path program 1 times [2020-06-22 05:31:11,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:11,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:11,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:11,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:11,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:11,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:11,758 INFO L82 PathProgramCache]: Analyzing trace with hash 73741486, now seen corresponding path program 1 times [2020-06-22 05:31:11,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:11,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:11,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:11,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:11,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:11,838 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:31:11,839 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:31:11,840 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:31:11,840 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:31:11,840 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:31:11,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:31:11,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:31:11,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:31:11,841 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:31:11,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:31:11,841 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:31:11,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:11,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:11,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:11,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:11,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:11,933 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:31:11,934 INFO L412 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-06-22 05:31:11,941 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:11,941 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:11,950 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:31:11,950 INFO L448 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 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-06-22 05:31:11,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:11,979 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:11,983 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:31:11,983 INFO L448 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-06-22 05:31:12,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:12,012 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:12,015 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:31:12,015 INFO L448 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 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-06-22 05:31:12,043 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:12,044 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-06-22 05:31:12,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:31:12,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:12,108 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:31:12,110 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:31:12,111 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:31:12,111 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:31:12,111 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:31:12,111 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:31:12,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:31:12,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:31:12,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:31:12,111 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:31:12,112 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:31:12,112 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:31:12,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,191 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:31:12,197 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:31:12,199 INFO L122 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-06-22 05:31:12,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:12,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:12,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:12,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:12,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:12,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:12,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:12,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:31:12,209 INFO L122 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-06-22 05:31:12,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:12,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:12,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:12,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:12,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:12,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:12,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:12,218 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:31:12,223 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:31:12,224 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:31:12,226 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:31:12,226 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:31:12,226 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:31:12,227 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2020-06-22 05:31:12,228 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:31:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:12,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:31:12,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:31:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:12,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:31:12,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:31:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:31:12,350 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:31:12,355 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-06-22 05:31:12,357 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states. Second operand 4 states. [2020-06-22 05:31:12,444 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states.. Second operand 4 states. Result 36 states and 45 transitions. Complement of second has 16 states. [2020-06-22 05:31:12,444 INFO L142 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-06-22 05:31:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 05:31:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-06-22 05:31:12,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 05:31:12,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:12,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 05:31:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:12,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 05:31:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:12,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2020-06-22 05:31:12,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:31:12,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 25 states and 33 transitions. [2020-06-22 05:31:12,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 05:31:12,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 05:31:12,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-06-22 05:31:12,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:31:12,474 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-06-22 05:31:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-06-22 05:31:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-06-22 05:31:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 05:31:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-06-22 05:31:12,509 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-06-22 05:31:12,509 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-06-22 05:31:12,509 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:31:12,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2020-06-22 05:31:12,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:31:12,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:31:12,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:31:12,512 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:31:12,512 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:31:12,513 INFO L794 eck$LassoCheckResult]: Stem: 130#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] 110#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]< 109#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] 111#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[] 114#L20 [50] L20-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 112#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] 116#L18 [53] L18-->rec2FINAL: Formula: (and (<= v_rec2_~j_2 0) (= |v_rec2_#res_2| 0)) InVars {rec2_~j=v_rec2_~j_2} OutVars{rec2_~j=v_rec2_~j_2, rec2_#res=|v_rec2_#res_2|} AuxVars[] AssignedVars[rec2_#res] 131#rec2FINAL [41] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 132#rec2EXIT >[62] rec2EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec2_#resOutParam_1|) InVars {rec2_#res=|v_rec2_#resOutParam_1|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec2_#in~jInParam_1| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j] 121#L20-1 [57] L20-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 117#rec1ENTRY [2020-06-22 05:31:12,513 INFO L796 eck$LassoCheckResult]: Loop: 117#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] 123#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[] 122#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]< 117#rec1ENTRY [2020-06-22 05:31:12,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:12,514 INFO L82 PathProgramCache]: Analyzing trace with hash -640237945, now seen corresponding path program 1 times [2020-06-22 05:31:12,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:12,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:12,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:12,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash 69333, now seen corresponding path program 1 times [2020-06-22 05:31:12,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:12,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:12,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash 621181583, now seen corresponding path program 1 times [2020-06-22 05:31:12,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:12,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:12,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:12,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:12,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 05:31:12,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:31:12,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 05:31:12,626 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:31:12,626 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:31:12,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:31:12,626 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:31:12,626 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:31:12,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:31:12,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:31:12,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:31:12,627 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:31:12,627 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:31:12,628 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:31:12,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,679 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:31:12,679 INFO L412 LassoAnalysis]: Checking for nontermination... 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-06-22 05:31:12,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:12,687 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:31:12,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:31:12,720 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:12,750 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:31:12,752 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:31:12,752 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:31:12,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:31:12,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:31:12,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:31:12,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:31:12,754 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:31:12,754 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:31:12,754 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:31:12,754 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:31:12,754 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:31:12,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:12,810 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:31:12,810 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:31:12,811 INFO L122 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-06-22 05:31:12,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:12,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:12,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:12,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:12,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:12,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:12,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:12,820 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:31:12,823 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-06-22 05:31:12,823 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 05:31:12,823 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:31:12,824 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:31:12,824 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:31:12,824 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2020-06-22 05:31:12,824 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:31:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:12,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:31:12,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:31:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:12,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:31:12,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:31:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:31:12,996 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:31:12,996 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-06-22 05:31:12,997 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 31 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-06-22 05:31:13,167 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 31 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 50 states and 65 transitions. Complement of second has 17 states. [2020-06-22 05:31:13,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 05:31:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:31:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-06-22 05:31:13,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 10 letters. Loop has 3 letters. [2020-06-22 05:31:13,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:13,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 13 letters. Loop has 3 letters. [2020-06-22 05:31:13,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:13,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-22 05:31:13,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:13,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2020-06-22 05:31:13,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:31:13,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 39 states and 53 transitions. [2020-06-22 05:31:13,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 05:31:13,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-06-22 05:31:13,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 53 transitions. [2020-06-22 05:31:13,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:31:13,180 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-06-22 05:31:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 53 transitions. [2020-06-22 05:31:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-06-22 05:31:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 05:31:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2020-06-22 05:31:13,186 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-06-22 05:31:13,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:31:13,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:31:13,190 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 6 states. [2020-06-22 05:31:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:31:13,257 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2020-06-22 05:31:13,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 05:31:13,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2020-06-22 05:31:13,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:31:13,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 53 transitions. [2020-06-22 05:31:13,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-06-22 05:31:13,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-06-22 05:31:13,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2020-06-22 05:31:13,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:31:13,265 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 53 transitions. [2020-06-22 05:31:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2020-06-22 05:31:13,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-06-22 05:31:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 05:31:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2020-06-22 05:31:13,271 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-06-22 05:31:13,272 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-06-22 05:31:13,272 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 05:31:13,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2020-06-22 05:31:13,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:31:13,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:31:13,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:31:13,275 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:31:13,276 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2020-06-22 05:31:13,276 INFO L794 eck$LassoCheckResult]: Stem: 378#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] 350#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]< 349#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] 351#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[] 353#L20 [50] L20-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 352#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] 355#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[] 354#L20 [50] L20-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 352#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] 356#L18 [53] L18-->rec2FINAL: Formula: (and (<= v_rec2_~j_2 0) (= |v_rec2_#res_2| 0)) InVars {rec2_~j=v_rec2_~j_2} OutVars{rec2_~j=v_rec2_~j_2, rec2_#res=|v_rec2_#res_2|} AuxVars[] AssignedVars[rec2_#res] 379#rec2FINAL [41] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 387#rec2EXIT >[62] rec2EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec2_#resOutParam_1|) InVars {rec2_#res=|v_rec2_#resOutParam_1|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec2_#in~jInParam_1| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j] 358#L20-1 [57] L20-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 357#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] 359#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] 364#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 365#rec1EXIT >[61] rec1EXIT-->L20-2: AOR: Formula: (= |v_rec2_#t~ret4_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret4=|v_rec2_#t~ret4_4|} AuxVars[] AssignedVars[rec2_#t~ret4] LVA: Formula: (= |v_rec1_#in~iInParam_4| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 377#L20-2 [55] L20-2-->rec2FINAL: Formula: (= |v_rec2_#res_1| (+ |v_rec2_#t~ret4_3| (- 1))) InVars {rec2_#t~ret4=|v_rec2_#t~ret4_3|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_2|, rec2_#t~ret4=|v_rec2_#t~ret4_2|, rec2_#res=|v_rec2_#res_1|} AuxVars[] AssignedVars[rec2_#t~ret3, rec2_#t~ret4, rec2_#res] 366#rec2FINAL [41] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 367#rec2EXIT >[62] rec2EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec2_#resOutParam_1|) InVars {rec2_#res=|v_rec2_#resOutParam_1|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec2_#in~jInParam_1| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j] 370#L20-1 [57] L20-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 381#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] 362#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[] 361#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]< 360#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] 363#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] 388#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 385#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] 368#L14-1 [2020-06-22 05:31:13,278 INFO L796 eck$LassoCheckResult]: Loop: 368#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]< 373#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] 383#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[] 371#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]< 373#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] 383#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[] 371#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]< 373#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] 383#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] 384#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 380#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] 368#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]< 373#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] 383#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] 384#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 380#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] 369#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]< 373#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] 383#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] 384#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 380#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] 374#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] 375#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 386#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] 368#L14-1 [2020-06-22 05:31:13,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:13,279 INFO L82 PathProgramCache]: Analyzing trace with hash 111914908, now seen corresponding path program 1 times [2020-06-22 05:31:13,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:13,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:13,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:13,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:13,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 05:31:13,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:31:13,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:31:13,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:13,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:31:13,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:31:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 05:31:13,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 05:31:13,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 8 [2020-06-22 05:31:13,409 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 05:31:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash -502759724, now seen corresponding path program 1 times [2020-06-22 05:31:13,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:13,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:13,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:13,671 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:31:13,671 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:31:13,671 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:31:13,671 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:31:13,672 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:31:13,672 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:31:13,672 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:31:13,672 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:31:13,672 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:31:13,672 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:31:13,672 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:31:13,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:13,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:13,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:13,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:13,721 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:31:13,721 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:31:13,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:13,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:13,734 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:31:13,734 INFO L448 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:31:13,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:13,762 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:13,765 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:31:13,766 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:31:13,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:13,794 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:13,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:31:13,797 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-06-22 05:31:13,825 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:13,825 INFO L163 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-06-22 05:31:13,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:31:13,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:18,414 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:31:18,418 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:31:18,418 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:31:18,418 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:31:18,418 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:31:18,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:31:18,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:31:18,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:31:18,419 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:31:18,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:31:18,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:31:18,419 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:31:18,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:18,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:18,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:18,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:31:18,470 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:31:18,470 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:31:18,470 INFO L122 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-06-22 05:31:18,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:18,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:18,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:18,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:18,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:18,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:18,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:18,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:31:18,474 INFO L122 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-06-22 05:31:18,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:18,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:18,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:18,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:18,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:18,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:18,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:18,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:31:18,477 INFO L122 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-06-22 05:31:18,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:18,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:18,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:18,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:18,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:18,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:18,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:18,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:31:18,480 INFO L122 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-06-22 05:31:18,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:18,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:18,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:18,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:18,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:18,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:18,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:18,490 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:31:18,495 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:31:18,495 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:31:18,495 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:31:18,495 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:31:18,495 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:31:18,496 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#t~ret0) = 1*rec1_#t~ret0 Supporting invariants [] [2020-06-22 05:31:18,496 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:31:18,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:18,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:31:18,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:31:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:18,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2020-06-22 05:31:18,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:31:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-06-22 05:31:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:18,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:31:18,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:31:18,914 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-06-22 05:31:18,914 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 13 loop predicates [2020-06-22 05:31:18,915 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 52 transitions. cyclomatic complexity: 14 Second operand 11 states. [2020-06-22 05:31:27,796 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 52 transitions. cyclomatic complexity: 14. Second operand 11 states. Result 56057 states and 121948 transitions. Complement of second has 43358 states. [2020-06-22 05:31:27,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 37 states 2 stem states 32 non-accepting loop states 2 accepting loop states [2020-06-22 05:31:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 05:31:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 179 transitions. [2020-06-22 05:31:27,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 179 transitions. Stem has 28 letters. Loop has 24 letters. [2020-06-22 05:31:27,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:27,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 179 transitions. Stem has 52 letters. Loop has 24 letters. [2020-06-22 05:31:27,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:27,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 179 transitions. Stem has 28 letters. Loop has 48 letters. [2020-06-22 05:31:27,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:27,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56057 states and 121948 transitions. [2020-06-22 05:31:30,156 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 126 [2020-06-22 05:31:30,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56057 states to 691 states and 1177 transitions. [2020-06-22 05:31:30,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 634 [2020-06-22 05:31:30,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 657 [2020-06-22 05:31:30,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 691 states and 1177 transitions. [2020-06-22 05:31:30,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:31:30,181 INFO L706 BuchiCegarLoop]: Abstraction has 691 states and 1177 transitions. [2020-06-22 05:31:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states and 1177 transitions. [2020-06-22 05:31:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 230. [2020-06-22 05:31:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-06-22 05:31:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 338 transitions. [2020-06-22 05:31:30,225 INFO L729 BuchiCegarLoop]: Abstraction has 230 states and 338 transitions. [2020-06-22 05:31:30,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:31:30,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:31:30,226 INFO L87 Difference]: Start difference. First operand 230 states and 338 transitions. Second operand 8 states. [2020-06-22 05:31:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:31:30,298 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-06-22 05:31:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 05:31:30,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2020-06-22 05:31:30,303 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:31:30,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2020-06-22 05:31:30,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 05:31:30,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 05:31:30,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 05:31:30,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:31:30,304 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:31:30,304 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:31:30,304 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:31:30,304 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 05:31:30,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:31:30,304 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:31:30,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 05:31:30,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:31:30 BasicIcfg [2020-06-22 05:31:30,311 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:31:30,311 INFO L168 Benchmark]: Toolchain (without parser) took 19571.47 ms. Allocated memory was 649.6 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 565.2 MB in the beginning and 1.3 GB in the end (delta: -721.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 50.3 GB. [2020-06-22 05:31:30,313 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:31:30,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.58 ms. Allocated memory was 649.6 MB in the beginning and 671.1 MB in the end (delta: 21.5 MB). Free memory was 565.2 MB in the beginning and 637.9 MB in the end (delta: -72.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:30,315 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.32 ms. Allocated memory is still 671.1 MB. Free memory was 637.9 MB in the beginning and 636.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:30,315 INFO L168 Benchmark]: Boogie Preprocessor took 17.07 ms. Allocated memory is still 671.1 MB. Free memory was 636.8 MB in the beginning and 635.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:30,316 INFO L168 Benchmark]: RCFGBuilder took 230.50 ms. Allocated memory is still 671.1 MB. Free memory was 635.7 MB in the beginning and 619.4 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:30,316 INFO L168 Benchmark]: BlockEncodingV2 took 82.88 ms. Allocated memory is still 671.1 MB. Free memory was 619.4 MB in the beginning and 614.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:30,317 INFO L168 Benchmark]: TraceAbstraction took 182.27 ms. Allocated memory is still 671.1 MB. Free memory was 612.9 MB in the beginning and 601.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:30,317 INFO L168 Benchmark]: BuchiAutomizer took 18723.70 ms. Allocated memory was 671.1 MB in the beginning and 2.4 GB in the end (delta: 1.7 GB). Free memory was 601.0 MB in the beginning and 1.3 GB in the end (delta: -685.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 50.3 GB. [2020-06-22 05:31:30,322 INFO L337 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.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 294.58 ms. Allocated memory was 649.6 MB in the beginning and 671.1 MB in the end (delta: 21.5 MB). Free memory was 565.2 MB in the beginning and 637.9 MB in the end (delta: -72.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.32 ms. Allocated memory is still 671.1 MB. Free memory was 637.9 MB in the beginning and 636.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 17.07 ms. Allocated memory is still 671.1 MB. Free memory was 636.8 MB in the beginning and 635.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 230.50 ms. Allocated memory is still 671.1 MB. Free memory was 635.7 MB in the beginning and 619.4 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 82.88 ms. Allocated memory is still 671.1 MB. Free memory was 619.4 MB in the beginning and 614.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 182.27 ms. Allocated memory is still 671.1 MB. Free memory was 612.9 MB in the beginning and 601.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 18723.70 ms. Allocated memory was 671.1 MB in the beginning and 2.4 GB in the end (delta: 1.7 GB). Free memory was 601.0 MB in the beginning and 1.3 GB in the end (delta: -685.7 MB). Peak memory consumption was 1.0 GB. 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. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 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 5 terminating modules (2 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function \old(j) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 6 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@193e7493 and consists of 37 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.6s and 4 iterations. TraceHistogramMax:5. Analysis of lassos took 6.1s. Construction of modules took 0.6s. Büchi inclusion checks took 9.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 470 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 2.3s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 19/34 HoareTripleCheckerStatistics: 105 SDtfs, 137 SDslu, 321 SDs, 0 SdLazy, 680 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf92 smp100 dnf100 smp100 tf111 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 05:31:07.489 ----------------------------------------------- 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 -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:31:30.554 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check