YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 01:24:08,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 01:24:08,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 01:24:08,737 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 01:24:08,737 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 01:24:08,738 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 01:24:08,739 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 01:24:08,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 01:24:08,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 01:24:08,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 01:24:08,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 01:24:08,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 01:24:08,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 01:24:08,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 01:24:08,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 01:24:08,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 01:24:08,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 01:24:08,750 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 01:24:08,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 01:24:08,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 01:24:08,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 01:24:08,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 01:24:08,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 01:24:08,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 01:24:08,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 01:24:08,758 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 01:24:08,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 01:24:08,759 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 01:24:08,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 01:24:08,760 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 01:24:08,761 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 01:24:08,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 01:24:08,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 01:24:08,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 01:24:08,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 01:24:08,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 01:24:08,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 01:24:08,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 01:24:08,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 01:24:08,765 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 01:24:08,780 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 01:24:08,780 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 01:24:08,781 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 01:24:08,781 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 01:24:08,781 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 01:24:08,782 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 01:24:08,782 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 01:24:08,782 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 01:24:08,782 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 01:24:08,782 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 01:24:08,783 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 01:24:08,783 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 01:24:08,783 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 01:24:08,783 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 01:24:08,783 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:08,783 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 01:24:08,784 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 01:24:08,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 01:24:08,784 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 01:24:08,784 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 01:24:08,784 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 01:24:08,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 01:24:08,785 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 01:24:08,785 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 01:24:08,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 01:24:08,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 01:24:08,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 01:24:08,786 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 01:24:08,786 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 01:24:08,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 01:24:08,824 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 01:24:08,828 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 01:24:08,829 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 01:24:08,830 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 01:24:08,830 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 01:24:08,893 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/6b8cab89d41540a4a4342d9b4f040a94/FLAG60029ae6e [2020-06-22 01:24:09,225 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 01:24:09,226 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 01:24:09,250 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/6b8cab89d41540a4a4342d9b4f040a94/FLAG60029ae6e [2020-06-22 01:24:09,628 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/6b8cab89d41540a4a4342d9b4f040a94 [2020-06-22 01:24:09,640 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 01:24:09,641 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 01:24:09,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 01:24:09,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 01:24:09,646 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 01:24:09,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:09,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2108a92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09, skipping insertion in model container [2020-06-22 01:24:09,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:09,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 01:24:09,676 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 01:24:09,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 01:24:09,840 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 01:24:09,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 01:24:09,942 INFO L195 MainTranslator]: Completed translation [2020-06-22 01:24:09,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09 WrapperNode [2020-06-22 01:24:09,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 01:24:09,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 01:24:09,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 01:24:09,944 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 01:24:09,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:09,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:09,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 01:24:09,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 01:24:09,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 01:24:09,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 01:24:09,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:09,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:09,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:09,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:09,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:09,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:10,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (1/1) ... [2020-06-22 01:24:10,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 01:24:10,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 01:24:10,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 01:24:10,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 01:24:10,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 01:24:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 01:24:10,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 01:24:10,220 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 01:24:10,220 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 01:24:10,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:24:10 BoogieIcfgContainer [2020-06-22 01:24:10,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 01:24:10,222 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 01:24:10,222 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 01:24:10,224 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 01:24:10,225 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:24:10" (1/1) ... [2020-06-22 01:24:10,239 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges [2020-06-22 01:24:10,241 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 01:24:10,241 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 01:24:10,242 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 01:24:10,242 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 01:24:10,244 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 01:24:10,245 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 01:24:10,245 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 01:24:10,261 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 01:24:10,276 INFO L200 BlockEncoder]: SBE split 2 edges [2020-06-22 01:24:10,281 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 01:24:10,283 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 01:24:10,293 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 01:24:10,295 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 01:24:10,296 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 01:24:10,296 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 01:24:10,297 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 01:24:10,297 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 01:24:10,297 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 7 edges [2020-06-22 01:24:10,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:24:10 BasicIcfg [2020-06-22 01:24:10,298 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 01:24:10,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 01:24:10,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 01:24:10,302 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 01:24:10,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 01:24:09" (1/4) ... [2020-06-22 01:24:10,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e37a095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:24:10, skipping insertion in model container [2020-06-22 01:24:10,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (2/4) ... [2020-06-22 01:24:10,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e37a095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:24:10, skipping insertion in model container [2020-06-22 01:24:10,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:24:10" (3/4) ... [2020-06-22 01:24:10,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e37a095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:24:10, skipping insertion in model container [2020-06-22 01:24:10,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:24:10" (4/4) ... [2020-06-22 01:24:10,306 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 01:24:10,315 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 01:24:10,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 01:24:10,342 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 01:24:10,370 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 01:24:10,371 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 01:24:10,371 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 01:24:10,371 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 01:24:10,371 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 01:24:10,371 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 01:24:10,371 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 01:24:10,372 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 01:24:10,372 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 01:24:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-06-22 01:24:10,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 01:24:10,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-06-22 01:24:10,444 INFO L451 ceAbstractionStarter]: At program point L18-1(lines 12 22) the Hoare annotation is: true [2020-06-22 01:24:10,444 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 17) no Hoare annotation was computed. [2020-06-22 01:24:10,444 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 01:24:10,444 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 12 22) no Hoare annotation was computed. [2020-06-22 01:24:10,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:24:10 BasicIcfg [2020-06-22 01:24:10,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 01:24:10,453 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 01:24:10,453 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 01:24:10,457 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 01:24:10,457 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:24:10,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 01:24:09" (1/5) ... [2020-06-22 01:24:10,458 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e0f3e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 01:24:10, skipping insertion in model container [2020-06-22 01:24:10,458 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:24:10,459 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:24:09" (2/5) ... [2020-06-22 01:24:10,459 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e0f3e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 01:24:10, skipping insertion in model container [2020-06-22 01:24:10,459 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:24:10,459 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:24:10" (3/5) ... [2020-06-22 01:24:10,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e0f3e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:24:10, skipping insertion in model container [2020-06-22 01:24:10,460 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:24:10,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:24:10" (4/5) ... [2020-06-22 01:24:10,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e0f3e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:24:10, skipping insertion in model container [2020-06-22 01:24:10,460 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:24:10,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:24:10" (5/5) ... [2020-06-22 01:24:10,462 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 01:24:10,489 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 01:24:10,490 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 01:24:10,490 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 01:24:10,490 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 01:24:10,490 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 01:24:10,491 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 01:24:10,491 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 01:24:10,491 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 01:24:10,491 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 01:24:10,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 01:24:10,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 01:24:10,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:24:10,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:24:10,522 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 01:24:10,522 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 01:24:10,522 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 01:24:10,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 01:24:10,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 01:24:10,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:24:10,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:24:10,523 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 01:24:10,524 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 01:24:10,529 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [31] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_1 1) (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~MAX~0_1 1000) (= v_ULTIMATE.start_main_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 4#L18-1true [2020-06-22 01:24:10,529 INFO L796 eck$LassoCheckResult]: Loop: 4#L18-1true [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 6#L14true [39] L14-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_11 (+ v_ULTIMATE.start_main_~b~0_12 1)) (= v_ULTIMATE.start_main_~a~0_9 1) (< v_ULTIMATE.start_main_~MAX~0_10 v_ULTIMATE.start_main_~a~0_10)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_10, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 5#L14-2true [35] L14-2-->L18-1: Formula: (and (< v_ULTIMATE.start_main_~MAX~0_6 v_ULTIMATE.start_main_~b~0_7) (= v_ULTIMATE.start_main_~b~0_6 1) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 4#L18-1true [2020-06-22 01:24:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:10,535 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2020-06-22 01:24:10,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:10,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:10,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:10,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:10,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:10,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:10,611 INFO L82 PathProgramCache]: Analyzing trace with hash 77163, now seen corresponding path program 1 times [2020-06-22 01:24:10,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:10,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:10,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:10,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:10,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:10,617 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:10,617 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:10,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:10,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:10,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1894414, now seen corresponding path program 1 times [2020-06-22 01:24:10,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:10,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:10,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:10,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:10,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:10,696 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:10,696 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:10,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:10,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:10,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:10,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:10,783 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 01:24:10,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:24:10,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 01:24:10,930 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:24:10,932 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:24:10,932 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:24:10,932 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:24:10,932 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:24:10,932 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:10,932 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:24:10,933 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:24:10,933 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 01:24:10,933 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:24:10,933 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:24:10,949 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 01:24:10,959 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 01:24:10,962 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 01:24:11,128 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:24:11,129 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:11,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:24:11,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:24:11,167 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:24:11,168 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:11,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:24:11,176 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:24:11,204 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:24:11,204 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:11,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:24:11,209 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/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 01:24:11,242 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:24:11,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:24:11,255 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:24:11,284 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:24:11,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:24:11,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:24:11,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:24:11,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:24:11,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:24:11,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:24:11,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:24:11,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 01:24:11,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:24:11,285 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:24:11,288 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 01:24:11,292 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 01:24:11,295 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 01:24:11,445 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:24:11,451 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:24:11,453 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 01:24:11,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:24:11,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:24:11,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:24:11,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:24:11,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 01:24:11,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 01:24:11,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:24:11,471 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 01:24:11,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:24:11,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:24:11,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:24:11,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:24:11,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 01:24:11,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 01:24:11,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:24:11,483 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 01:24:11,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:24:11,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:24:11,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:24:11,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:24:11,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:24:11,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:24:11,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:24:11,499 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:24:11,510 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 01:24:11,510 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 01:24:11,512 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:24:11,513 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:24:11,513 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:24:11,513 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~MAX~0) = -2*ULTIMATE.start_main_~c~0 + 2*ULTIMATE.start_main_~MAX~0 + 1 Supporting invariants [] [2020-06-22 01:24:11,515 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:24:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:11,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 01:24:11,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:11,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:11,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:11,577 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 01:24:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:11,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:11,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:11,668 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 01:24:11,674 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 01:24:11,675 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. [2020-06-22 01:24:12,280 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 10 states and 22 transitions. Complement of second has 5 states. [2020-06-22 01:24:12,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2020-06-22 01:24:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 01:24:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-06-22 01:24:12,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 01:24:12,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:12,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 01:24:12,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:12,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 01:24:12,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:12,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 22 transitions. [2020-06-22 01:24:12,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 01:24:12,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 22 transitions. [2020-06-22 01:24:12,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-22 01:24:12,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 01:24:12,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 22 transitions. [2020-06-22 01:24:12,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:24:12,304 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 22 transitions. [2020-06-22 01:24:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 22 transitions. [2020-06-22 01:24:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-06-22 01:24:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 01:24:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2020-06-22 01:24:12,336 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 20 transitions. [2020-06-22 01:24:12,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 01:24:12,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 01:24:12,339 INFO L87 Difference]: Start difference. First operand 9 states and 20 transitions. Second operand 4 states. [2020-06-22 01:24:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:24:12,372 INFO L93 Difference]: Finished difference Result 16 states and 33 transitions. [2020-06-22 01:24:12,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 01:24:12,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 33 transitions. [2020-06-22 01:24:12,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 01:24:12,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 33 transitions. [2020-06-22 01:24:12,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 01:24:12,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 01:24:12,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 33 transitions. [2020-06-22 01:24:12,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:24:12,378 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 33 transitions. [2020-06-22 01:24:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 33 transitions. [2020-06-22 01:24:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2020-06-22 01:24:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 01:24:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2020-06-22 01:24:12,381 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 22 transitions. [2020-06-22 01:24:12,381 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 22 transitions. [2020-06-22 01:24:12,381 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 01:24:12,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 22 transitions. [2020-06-22 01:24:12,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 01:24:12,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:24:12,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:24:12,382 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 01:24:12,382 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 01:24:12,383 INFO L794 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_1 1) (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~MAX~0_1 1000) (= v_ULTIMATE.start_main_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 100#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 108#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 105#L14-2 [2020-06-22 01:24:12,383 INFO L796 eck$LassoCheckResult]: Loop: 105#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 101#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 102#L14 [39] L14-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_11 (+ v_ULTIMATE.start_main_~b~0_12 1)) (= v_ULTIMATE.start_main_~a~0_9 1) (< v_ULTIMATE.start_main_~MAX~0_10 v_ULTIMATE.start_main_~a~0_10)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_10, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 105#L14-2 [2020-06-22 01:24:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:12,383 INFO L82 PathProgramCache]: Analyzing trace with hash 61082, now seen corresponding path program 1 times [2020-06-22 01:24:12,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:12,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:12,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:12,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:12,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:12,388 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:12,388 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:12,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:12,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:12,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:12,436 INFO L82 PathProgramCache]: Analyzing trace with hash 73602, now seen corresponding path program 1 times [2020-06-22 01:24:12,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:12,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:12,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:12,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:12,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:12,440 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:12,440 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:12,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:12,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:12,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1819737673, now seen corresponding path program 1 times [2020-06-22 01:24:12,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:12,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:12,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:12,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:12,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:12,499 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:12,499 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:12,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:12,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:12,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 01:24:12,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:24:12,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-06-22 01:24:12,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-06-22 01:24:12,639 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:24:12,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:24:12,639 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:24:12,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:24:12,639 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:24:12,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:12,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:24:12,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:24:12,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 01:24:12,640 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:24:12,640 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:24:12,642 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 01:24: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 01:24:12,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:24:12,767 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:24:12,767 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/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 01:24:12,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:24:12,771 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:24:12,799 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:24:12,799 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:12,806 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:24:12,806 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:24:12,834 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:24:12,835 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:12,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:24:12,841 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:12,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:24:12,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:24:12,881 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:24:12,905 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:24:12,906 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:24:12,906 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:24:12,906 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:24:12,906 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:24:12,906 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:24:12,906 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:24:12,906 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:24:12,906 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 01:24:12,906 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:24:12,907 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:24:12,908 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 01:24:12,912 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 01:24:12,915 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 01:24:13,035 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:24:13,036 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:24:13,036 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 01:24:13,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:24:13,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:24:13,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:24:13,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:24:13,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 01:24:13,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 01:24:13,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:24:13,044 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 01:24:13,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:24:13,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:24:13,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:24:13,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:24:13,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 01:24:13,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 01:24:13,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:24:13,053 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 01:24:13,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:24:13,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:24:13,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:24:13,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:24:13,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:24:13,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:24:13,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:24:13,063 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:24:13,070 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 01:24:13,070 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 01:24:13,070 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:24:13,071 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:24:13,071 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:24:13,071 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_~b~0) = 2*ULTIMATE.start_main_~MAX~0 - 2*ULTIMATE.start_main_~b~0 + 1 Supporting invariants [] [2020-06-22 01:24:13,071 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:24:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:13,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 01:24:13,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:13,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:13,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:13,108 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 01:24:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:13,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:13,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:13,171 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 01:24:13,172 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 01:24:13,172 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 22 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-06-22 01:24:23,726 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 22 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 48 states and 89 transitions. Complement of second has 12 states. [2020-06-22 01:24:23,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 01:24:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 01:24:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-06-22 01:24:23,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 01:24:23,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:23,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 01:24:23,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:23,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 01:24:23,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:23,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 89 transitions. [2020-06-22 01:24:23,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 01:24:23,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 23 states and 42 transitions. [2020-06-22 01:24:23,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 01:24:23,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 01:24:23,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 42 transitions. [2020-06-22 01:24:23,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:24:23,735 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 42 transitions. [2020-06-22 01:24:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 42 transitions. [2020-06-22 01:24:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 01:24:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 01:24:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2020-06-22 01:24:23,738 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 42 transitions. [2020-06-22 01:24:23,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 01:24:23,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 01:24:23,739 INFO L87 Difference]: Start difference. First operand 23 states and 42 transitions. Second operand 5 states. [2020-06-22 01:24:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:24:23,775 INFO L93 Difference]: Finished difference Result 43 states and 78 transitions. [2020-06-22 01:24:23,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 01:24:23,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 78 transitions. [2020-06-22 01:24:23,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 01:24:23,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 78 transitions. [2020-06-22 01:24:23,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 01:24:23,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 01:24:23,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 78 transitions. [2020-06-22 01:24:23,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:24:23,781 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 78 transitions. [2020-06-22 01:24:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 78 transitions. [2020-06-22 01:24:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2020-06-22 01:24:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 01:24:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. [2020-06-22 01:24:23,785 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 58 transitions. [2020-06-22 01:24:23,785 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 58 transitions. [2020-06-22 01:24:23,785 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 01:24:23,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 58 transitions. [2020-06-22 01:24:23,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 01:24:23,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:24:23,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:24:23,787 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 01:24:23,787 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 01:24:23,788 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_1 1) (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~MAX~0_1 1000) (= v_ULTIMATE.start_main_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 298#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 316#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 315#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 299#L18-1 [2020-06-22 01:24:23,788 INFO L796 eck$LassoCheckResult]: Loop: 299#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 300#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 303#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 299#L18-1 [2020-06-22 01:24:23,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:23,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1893586, now seen corresponding path program 1 times [2020-06-22 01:24:23,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:23,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:23,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:23,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:23,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:23,792 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:23,792 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:23,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:23,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:23,837 INFO L82 PathProgramCache]: Analyzing trace with hash 77296, now seen corresponding path program 1 times [2020-06-22 01:24:23,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:23,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:23,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:23,841 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:23,841 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:23,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:23,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:23,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:23,888 INFO L82 PathProgramCache]: Analyzing trace with hash 577293183, now seen corresponding path program 1 times [2020-06-22 01:24:23,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:23,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:23,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:23,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:23,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:23,892 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:23,892 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:23,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:23,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:24,007 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:24:24,007 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:24:24,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:24:24,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:24:24,007 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:24:24,007 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:24,008 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:24:24,008 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:24:24,008 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 01:24:24,008 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:24:24,008 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:24:24,009 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 01:24:24,012 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 01:24:24,049 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 01:24:24,140 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:24:24,140 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:24,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:24:24,146 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:24:24,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:24:24,173 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:24,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:24:24,179 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:24,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:24:24,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:24:24,218 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:24:24,244 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:24:24,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:24:24,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:24:24,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:24:24,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:24:24,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:24:24,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:24:24,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:24:24,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 01:24:24,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:24:24,245 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:24:24,247 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 01:24:24,568 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-06-22 01:24:24,568 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 01:24:24,571 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 01:24:25,381 WARN L188 SmtUtils]: Spent 804.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-06-22 01:24:25,827 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-06-22 01:24:25,835 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:24:25,835 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:24:25,836 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 01:24:25,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:24:25,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:24:25,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:24:25,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:24:25,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:24:25,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:24:25,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:24:25,844 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:24:25,850 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 01:24:25,850 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 01:24:25,851 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:24:25,851 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:24:25,851 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:24:25,851 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_~a~0) = 1*ULTIMATE.start_main_~MAX~0 - 1*ULTIMATE.start_main_~a~0 Supporting invariants [] [2020-06-22 01:24:25,851 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:24:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:25,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 01:24:25,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:25,878 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:25,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:25,899 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 01:24:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:25,909 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:25,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:25,911 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 01:24:25,911 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 01:24:25,911 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 32 states and 58 transitions. cyclomatic complexity: 30 Second operand 4 states. [2020-06-22 01:24:26,358 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 32 states and 58 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 80 states and 143 transitions. Complement of second has 14 states. [2020-06-22 01:24:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 01:24:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 01:24:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-06-22 01:24:26,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 01:24:26,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:26,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 01:24:26,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:26,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 01:24:26,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:26,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 143 transitions. [2020-06-22 01:24:26,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 01:24:26,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 33 states and 59 transitions. [2020-06-22 01:24:26,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 01:24:26,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 01:24:26,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 59 transitions. [2020-06-22 01:24:26,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:24:26,368 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 59 transitions. [2020-06-22 01:24:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 59 transitions. [2020-06-22 01:24:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2020-06-22 01:24:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 01:24:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2020-06-22 01:24:26,370 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 37 transitions. [2020-06-22 01:24:26,370 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 37 transitions. [2020-06-22 01:24:26,370 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 01:24:26,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 37 transitions. [2020-06-22 01:24:26,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 01:24:26,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:24:26,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:24:26,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1] [2020-06-22 01:24:26,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 01:24:26,373 INFO L794 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_1 1) (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~MAX~0_1 1000) (= v_ULTIMATE.start_main_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 474#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 475#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 490#L14-2 [35] L14-2-->L18-1: Formula: (and (< v_ULTIMATE.start_main_~MAX~0_6 v_ULTIMATE.start_main_~b~0_7) (= v_ULTIMATE.start_main_~b~0_6 1) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 489#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 487#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 485#L14-2 [35] L14-2-->L18-1: Formula: (and (< v_ULTIMATE.start_main_~MAX~0_6 v_ULTIMATE.start_main_~b~0_7) (= v_ULTIMATE.start_main_~b~0_6 1) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 483#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 482#L14 [2020-06-22 01:24:26,373 INFO L796 eck$LassoCheckResult]: Loop: 482#L14 [39] L14-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_11 (+ v_ULTIMATE.start_main_~b~0_12 1)) (= v_ULTIMATE.start_main_~a~0_9 1) (< v_ULTIMATE.start_main_~MAX~0_10 v_ULTIMATE.start_main_~a~0_10)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_10, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 478#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 479#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 482#L14 [2020-06-22 01:24:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash 707877777, now seen corresponding path program 1 times [2020-06-22 01:24:26,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:26,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:26,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:26,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:26,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:26,377 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:26,377 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:26,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:26,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:26,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 01:24:26,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 01:24:26,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:24:26,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:24:26,438 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 01:24:26,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash 68682, now seen corresponding path program 2 times [2020-06-22 01:24:26,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:26,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:26,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:26,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:26,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:26,442 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:26,442 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:26,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:26,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 01:24:26,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-06-22 01:24:26,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-06-22 01:24:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:26,522 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:24:26,522 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:24:26,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:24:26,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:24:26,523 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:24:26,523 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:26,523 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:24:26,523 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:24:26,523 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 01:24:26,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:24:26,523 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:24:26,525 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 01:24:26,542 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 01:24:26,545 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 01:24:26,600 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:24:26,600 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:26,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:24:26,604 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:26,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:24:26,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:24:26,640 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:24:26,664 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:24:26,664 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:24:26,664 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:24:26,664 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:24:26,664 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:24:26,664 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:24:26,664 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:24:26,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:24:26,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 01:24:26,665 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:24:26,665 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:24:26,666 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 01:24:26,683 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 01:24:26,685 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 01:24:26,739 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:24:26,739 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:24:26,739 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 01:24:26,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:24:26,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:24:26,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:24:26,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:24:26,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:24:26,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:24:26,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:24:26,748 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:24:26,756 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 01:24:26,756 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 01:24:26,757 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:24:26,757 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:24:26,757 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:24:26,757 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0, ULTIMATE.start_main_~MAX~0) = -1*ULTIMATE.start_main_~b~0 + 1*ULTIMATE.start_main_~MAX~0 Supporting invariants [] [2020-06-22 01:24:26,758 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:24:26,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:26,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 01:24:26,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:26,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:26,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:26,799 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 01:24:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:26,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:26,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:26,811 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 01:24:26,811 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 01:24:26,812 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 37 transitions. cyclomatic complexity: 19 Second operand 4 states. [2020-06-22 01:24:26,890 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 37 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 191 states and 342 transitions. Complement of second has 39 states. [2020-06-22 01:24:26,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 01:24:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 01:24:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-06-22 01:24:26,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 8 letters. Loop has 3 letters. [2020-06-22 01:24:26,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:26,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2020-06-22 01:24:26,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:26,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 8 letters. Loop has 6 letters. [2020-06-22 01:24:26,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:26,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 342 transitions. [2020-06-22 01:24:26,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 01:24:26,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 60 states and 105 transitions. [2020-06-22 01:24:26,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-22 01:24:26,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 01:24:26,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 105 transitions. [2020-06-22 01:24:26,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:24:26,900 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 105 transitions. [2020-06-22 01:24:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 105 transitions. [2020-06-22 01:24:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 27. [2020-06-22 01:24:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 01:24:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 48 transitions. [2020-06-22 01:24:26,904 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 48 transitions. [2020-06-22 01:24:26,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 01:24:26,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:24:26,905 INFO L87 Difference]: Start difference. First operand 27 states and 48 transitions. Second operand 3 states. [2020-06-22 01:24:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:24:26,920 INFO L93 Difference]: Finished difference Result 31 states and 53 transitions. [2020-06-22 01:24:26,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 01:24:26,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 53 transitions. [2020-06-22 01:24:26,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 01:24:26,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 52 transitions. [2020-06-22 01:24:26,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-22 01:24:26,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 01:24:26,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 52 transitions. [2020-06-22 01:24:26,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:24:26,924 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 52 transitions. [2020-06-22 01:24:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 52 transitions. [2020-06-22 01:24:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2020-06-22 01:24:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 01:24:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 41 transitions. [2020-06-22 01:24:26,929 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 41 transitions. [2020-06-22 01:24:26,929 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 41 transitions. [2020-06-22 01:24:26,929 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 01:24:26,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 41 transitions. [2020-06-22 01:24:26,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 01:24:26,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:24:26,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:24:26,931 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1] [2020-06-22 01:24:26,931 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 01:24:26,931 INFO L794 eck$LassoCheckResult]: Stem: 864#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_1 1) (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~MAX~0_1 1000) (= v_ULTIMATE.start_main_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 865#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 866#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 886#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 867#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 868#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 871#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 872#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 878#L14 [39] L14-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_11 (+ v_ULTIMATE.start_main_~b~0_12 1)) (= v_ULTIMATE.start_main_~a~0_9 1) (< v_ULTIMATE.start_main_~MAX~0_10 v_ULTIMATE.start_main_~a~0_10)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_10, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 879#L14-2 [35] L14-2-->L18-1: Formula: (and (< v_ULTIMATE.start_main_~MAX~0_6 v_ULTIMATE.start_main_~b~0_7) (= v_ULTIMATE.start_main_~b~0_6 1) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 874#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 873#L14 [2020-06-22 01:24:26,932 INFO L796 eck$LassoCheckResult]: Loop: 873#L14 [39] L14-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_11 (+ v_ULTIMATE.start_main_~b~0_12 1)) (= v_ULTIMATE.start_main_~a~0_9 1) (< v_ULTIMATE.start_main_~MAX~0_10 v_ULTIMATE.start_main_~a~0_10)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_10, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 869#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 870#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 873#L14 [2020-06-22 01:24:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1388764830, now seen corresponding path program 1 times [2020-06-22 01:24:26,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:26,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:26,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:24:26,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:26,935 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:26,935 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:26,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:26,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:26,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 01:24:26,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:24:27,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-06-22 01:24:27,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-06-22 01:24:27,013 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 01:24:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash 68682, now seen corresponding path program 3 times [2020-06-22 01:24:27,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:24:27,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:24:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:27,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:24:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:24:27,017 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 01:24:27,017 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 01:24:27,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 01:24:27,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 01:24:27,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-06-22 01:24:27,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-06-22 01:24:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:24:27,096 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:24:27,097 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:24:27,097 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:24:27,097 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:24:27,097 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:24:27,097 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:27,097 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:24:27,097 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:24:27,097 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 01:24:27,097 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:24:27,097 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:24:27,099 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 01:24:27,120 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 01:24:27,122 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 01:24:27,174 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:24:27,174 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:27,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:24:27,180 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:24:27,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:24:27,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:24:27,217 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:24:27,240 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:24:27,241 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:24:27,241 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:24:27,241 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:24:27,241 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:24:27,241 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:24:27,241 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:24:27,241 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:24:27,241 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 01:24:27,241 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:24:27,242 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:24:27,243 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 01:24:27,261 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 01:24:27,264 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 01:24:27,320 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:24:27,321 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:24:27,321 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 01:24:27,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:24:27,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:24:27,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:24:27,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:24:27,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:24:27,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:24:27,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:24:27,329 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:24:27,335 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 01:24:27,335 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 01:24:27,336 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:24:27,336 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:24:27,336 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:24:27,336 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_~b~0) = 1*ULTIMATE.start_main_~MAX~0 - 1*ULTIMATE.start_main_~b~0 Supporting invariants [] [2020-06-22 01:24:27,337 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:24:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:24:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:27,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 01:24:27,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:27,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:27,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:27,387 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 01:24:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:24:27,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:24:27,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:24:27,399 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 01:24:27,399 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 01:24:27,399 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 41 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-06-22 01:24:27,474 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 41 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 151 states and 261 transitions. Complement of second has 39 states. [2020-06-22 01:24:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 01:24:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 01:24:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-06-22 01:24:27,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2020-06-22 01:24:27,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:27,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2020-06-22 01:24:27,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:27,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2020-06-22 01:24:27,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:24:27,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 261 transitions. [2020-06-22 01:24:27,480 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 01:24:27,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 0 states and 0 transitions. [2020-06-22 01:24:27,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 01:24:27,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 01:24:27,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 01:24:27,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 01:24:27,481 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:24:27,481 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:24:27,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 01:24:27,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-06-22 01:24:27,482 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2020-06-22 01:24:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:24:27,482 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-06-22 01:24:27,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-06-22 01:24:27,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-06-22 01:24:27,483 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 01:24:27,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 01:24:27,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 01:24:27,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 01:24:27,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 01:24:27,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 01:24:27,484 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:24:27,484 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:24:27,484 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:24:27,484 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 01:24:27,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 01:24:27,484 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 01:24:27,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 01:24:27,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:24:27 BasicIcfg [2020-06-22 01:24:27,491 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 01:24:27,491 INFO L168 Benchmark]: Toolchain (without parser) took 17850.64 ms. Allocated memory was 649.6 MB in the beginning and 750.3 MB in the end (delta: 100.7 MB). Free memory was 563.2 MB in the beginning and 426.5 MB in the end (delta: 136.7 MB). Peak memory consumption was 237.3 MB. Max. memory is 50.3 GB. [2020-06-22 01:24:27,492 INFO L168 Benchmark]: CDTParser took 0.16 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 01:24:27,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.91 ms. Allocated memory was 649.6 MB in the beginning and 687.3 MB in the end (delta: 37.7 MB). Free memory was 563.2 MB in the beginning and 655.0 MB in the end (delta: -91.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. [2020-06-22 01:24:27,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.45 ms. Allocated memory is still 687.3 MB. Free memory was 655.0 MB in the beginning and 652.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 01:24:27,493 INFO L168 Benchmark]: Boogie Preprocessor took 20.09 ms. Allocated memory is still 687.3 MB. Free memory was 652.3 MB in the beginning and 649.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 01:24:27,494 INFO L168 Benchmark]: RCFGBuilder took 219.83 ms. Allocated memory is still 687.3 MB. Free memory was 649.2 MB in the beginning and 636.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. [2020-06-22 01:24:27,494 INFO L168 Benchmark]: BlockEncodingV2 took 75.75 ms. Allocated memory is still 687.3 MB. Free memory was 636.1 MB in the beginning and 630.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 01:24:27,495 INFO L168 Benchmark]: TraceAbstraction took 153.88 ms. Allocated memory is still 687.3 MB. Free memory was 630.7 MB in the beginning and 621.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-06-22 01:24:27,495 INFO L168 Benchmark]: BuchiAutomizer took 17037.57 ms. Allocated memory was 687.3 MB in the beginning and 750.3 MB in the end (delta: 62.9 MB). Free memory was 621.3 MB in the beginning and 426.5 MB in the end (delta: 194.8 MB). Peak memory consumption was 257.7 MB. Max. memory is 50.3 GB. [2020-06-22 01:24:27,499 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 8 locations, 11 edges - StatisticsResult: Encoded RCFG 4 locations, 7 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 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 300.91 ms. Allocated memory was 649.6 MB in the beginning and 687.3 MB in the end (delta: 37.7 MB). Free memory was 563.2 MB in the beginning and 655.0 MB in the end (delta: -91.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.45 ms. Allocated memory is still 687.3 MB. Free memory was 655.0 MB in the beginning and 652.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.09 ms. Allocated memory is still 687.3 MB. Free memory was 652.3 MB in the beginning and 649.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 219.83 ms. Allocated memory is still 687.3 MB. Free memory was 649.2 MB in the beginning and 636.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 75.75 ms. Allocated memory is still 687.3 MB. Free memory was 636.1 MB in the beginning and 630.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 153.88 ms. Allocated memory is still 687.3 MB. Free memory was 630.7 MB in the beginning and 621.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 17037.57 ms. Allocated memory was 687.3 MB in the beginning and 750.3 MB in the end (delta: 62.9 MB). Free memory was 621.3 MB in the beginning and 426.5 MB in the end (delta: 194.8 MB). Peak memory consumption was 257.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s 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=4occurred 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (4 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function -2 * c + 2 * MAX + 1 and consists of 4 locations. One nondeterministic module has affine ranking function 2 * MAX + -2 * b + 1 and consists of 4 locations. One nondeterministic module has affine ranking function MAX + -1 * a and consists of 5 locations. One nondeterministic module has affine ranking function -1 * b + MAX and consists of 7 locations. One nondeterministic module has affine ranking function MAX + -1 * b and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.0s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 4.5s. Construction of modules took 11.6s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 2. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 85 SDslu, 0 SDs, 0 SdLazy, 200 SolverSat, 34 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 11.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital35 mio100 ax134 hnf100 lsp74 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq127 hnf95 smp100 dnf100 smp100 tf104 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 01:24:06.435 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 01:24:27.732 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check