18.45/8.33 YES 18.45/8.33 18.45/8.33 Ultimate: Cannot open display: 18.45/8.33 This is Ultimate 0.1.24-8dc7c08-m 18.45/8.33 [2019-03-29 01:53:45,009 INFO L170 SettingsManager]: Resetting all preferences to default values... 18.45/8.33 [2019-03-29 01:53:45,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 18.45/8.33 [2019-03-29 01:53:45,022 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 18.45/8.33 [2019-03-29 01:53:45,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 18.45/8.33 [2019-03-29 01:53:45,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 18.45/8.33 [2019-03-29 01:53:45,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 18.45/8.33 [2019-03-29 01:53:45,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 18.45/8.33 [2019-03-29 01:53:45,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 18.45/8.33 [2019-03-29 01:53:45,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 18.45/8.33 [2019-03-29 01:53:45,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 18.45/8.33 [2019-03-29 01:53:45,030 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 18.45/8.33 [2019-03-29 01:53:45,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 18.45/8.33 [2019-03-29 01:53:45,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 18.45/8.33 [2019-03-29 01:53:45,033 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 18.45/8.33 [2019-03-29 01:53:45,034 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 18.45/8.33 [2019-03-29 01:53:45,035 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 18.45/8.33 [2019-03-29 01:53:45,036 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 18.45/8.33 [2019-03-29 01:53:45,038 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 18.45/8.33 [2019-03-29 01:53:45,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 18.45/8.33 [2019-03-29 01:53:45,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 18.45/8.33 [2019-03-29 01:53:45,042 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 18.45/8.33 [2019-03-29 01:53:45,044 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 18.45/8.33 [2019-03-29 01:53:45,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 18.45/8.33 [2019-03-29 01:53:45,045 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 18.45/8.33 [2019-03-29 01:53:45,045 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 18.45/8.33 [2019-03-29 01:53:45,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 18.45/8.33 [2019-03-29 01:53:45,047 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 18.45/8.33 [2019-03-29 01:53:45,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 18.45/8.33 [2019-03-29 01:53:45,048 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 18.45/8.33 [2019-03-29 01:53:45,048 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 18.45/8.33 [2019-03-29 01:53:45,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 18.45/8.33 [2019-03-29 01:53:45,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 18.45/8.33 [2019-03-29 01:53:45,050 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 18.45/8.33 [2019-03-29 01:53:45,051 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 18.45/8.33 [2019-03-29 01:53:45,051 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 18.45/8.33 [2019-03-29 01:53:45,051 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 18.45/8.33 [2019-03-29 01:53:45,052 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 18.45/8.33 [2019-03-29 01:53:45,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 18.45/8.33 [2019-03-29 01:53:45,053 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 18.45/8.33 [2019-03-29 01:53:45,068 INFO L110 SettingsManager]: Loading preferences was successful 18.45/8.33 [2019-03-29 01:53:45,068 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 18.45/8.33 [2019-03-29 01:53:45,069 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 18.45/8.33 [2019-03-29 01:53:45,069 INFO L133 SettingsManager]: * Rewrite not-equals=true 18.45/8.33 [2019-03-29 01:53:45,069 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 18.45/8.33 [2019-03-29 01:53:45,070 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 18.45/8.33 [2019-03-29 01:53:45,070 INFO L133 SettingsManager]: * Use SBE=true 18.45/8.33 [2019-03-29 01:53:45,070 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 18.45/8.33 [2019-03-29 01:53:45,070 INFO L133 SettingsManager]: * Use old map elimination=false 18.45/8.33 [2019-03-29 01:53:45,070 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 18.45/8.33 [2019-03-29 01:53:45,071 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 18.45/8.33 [2019-03-29 01:53:45,071 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 18.45/8.33 [2019-03-29 01:53:45,071 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 18.45/8.33 [2019-03-29 01:53:45,071 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 18.45/8.33 [2019-03-29 01:53:45,071 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:45,071 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 18.45/8.33 [2019-03-29 01:53:45,072 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 18.45/8.33 [2019-03-29 01:53:45,072 INFO L133 SettingsManager]: * Check division by zero=IGNORE 18.45/8.33 [2019-03-29 01:53:45,072 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 18.45/8.33 [2019-03-29 01:53:45,072 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 18.45/8.33 [2019-03-29 01:53:45,072 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 18.45/8.33 [2019-03-29 01:53:45,072 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 18.45/8.33 [2019-03-29 01:53:45,073 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 18.45/8.33 [2019-03-29 01:53:45,073 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 18.45/8.33 [2019-03-29 01:53:45,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 18.45/8.33 [2019-03-29 01:53:45,073 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 18.45/8.33 [2019-03-29 01:53:45,073 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 18.45/8.33 [2019-03-29 01:53:45,074 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 18.45/8.33 [2019-03-29 01:53:45,074 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 18.45/8.33 [2019-03-29 01:53:45,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 18.45/8.33 [2019-03-29 01:53:45,113 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 18.45/8.33 [2019-03-29 01:53:45,117 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 18.45/8.33 [2019-03-29 01:53:45,118 INFO L271 PluginConnector]: Initializing CDTParser... 18.45/8.33 [2019-03-29 01:53:45,119 INFO L276 PluginConnector]: CDTParser initialized 18.45/8.33 [2019-03-29 01:53:45,119 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 18.45/8.33 [2019-03-29 01:53:45,209 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/5e2c9593d0f1485a83ed716474b7d6d1/FLAG44497ece5 18.45/8.33 [2019-03-29 01:53:45,563 INFO L307 CDTParser]: Found 1 translation units. 18.45/8.33 [2019-03-29 01:53:45,564 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 18.45/8.33 [2019-03-29 01:53:45,570 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/5e2c9593d0f1485a83ed716474b7d6d1/FLAG44497ece5 18.45/8.33 [2019-03-29 01:53:45,994 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/5e2c9593d0f1485a83ed716474b7d6d1 18.45/8.33 [2019-03-29 01:53:46,006 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 18.45/8.33 [2019-03-29 01:53:46,007 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 18.45/8.33 [2019-03-29 01:53:46,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 18.45/8.33 [2019-03-29 01:53:46,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 18.45/8.33 [2019-03-29 01:53:46,012 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 18.45/8.33 [2019-03-29 01:53:46,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:53:45" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce772d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46, skipping insertion in model container 18.45/8.33 [2019-03-29 01:53:46,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:53:45" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 18.45/8.33 [2019-03-29 01:53:46,041 INFO L176 MainTranslator]: Built tables and reachable declarations 18.45/8.33 [2019-03-29 01:53:46,198 INFO L206 PostProcessor]: Analyzing one entry point: main 18.45/8.33 [2019-03-29 01:53:46,203 INFO L191 MainTranslator]: Completed pre-run 18.45/8.33 [2019-03-29 01:53:46,220 INFO L206 PostProcessor]: Analyzing one entry point: main 18.45/8.33 [2019-03-29 01:53:46,235 INFO L195 MainTranslator]: Completed translation 18.45/8.33 [2019-03-29 01:53:46,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46 WrapperNode 18.45/8.33 [2019-03-29 01:53:46,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 18.45/8.33 [2019-03-29 01:53:46,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 18.45/8.33 [2019-03-29 01:53:46,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 18.45/8.33 [2019-03-29 01:53:46,237 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 18.45/8.33 [2019-03-29 01:53:46,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 18.45/8.33 [2019-03-29 01:53:46,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 18.45/8.33 [2019-03-29 01:53:46,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 18.45/8.33 [2019-03-29 01:53:46,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized 18.45/8.33 [2019-03-29 01:53:46,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 18.45/8.33 [2019-03-29 01:53:46,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 18.45/8.33 [2019-03-29 01:53:46,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... 18.45/8.33 [2019-03-29 01:53:46,357 INFO L276 PluginConnector]: RCFGBuilder initialized 18.45/8.33 [2019-03-29 01:53:46,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (1/1) ... 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 18.45/8.33 [2019-03-29 01:53:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 18.45/8.33 [2019-03-29 01:53:46,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 18.45/8.33 [2019-03-29 01:53:46,568 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 18.45/8.33 [2019-03-29 01:53:46,568 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 18.45/8.33 [2019-03-29 01:53:46,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:53:46 BoogieIcfgContainer 18.45/8.33 [2019-03-29 01:53:46,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 18.45/8.33 [2019-03-29 01:53:46,570 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 18.45/8.33 [2019-03-29 01:53:46,570 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 18.45/8.33 [2019-03-29 01:53:46,573 INFO L276 PluginConnector]: BlockEncodingV2 initialized 18.45/8.33 [2019-03-29 01:53:46,574 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:53:46" (1/1) ... 18.45/8.33 [2019-03-29 01:53:46,589 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 18.45/8.33 [2019-03-29 01:53:46,591 INFO L258 BlockEncoder]: Using Remove infeasible edges 18.45/8.33 [2019-03-29 01:53:46,592 INFO L263 BlockEncoder]: Using Maximize final states 18.45/8.33 [2019-03-29 01:53:46,593 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 18.45/8.33 [2019-03-29 01:53:46,593 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 18.45/8.33 [2019-03-29 01:53:46,595 INFO L296 BlockEncoder]: Using Remove sink states 18.45/8.33 [2019-03-29 01:53:46,596 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 18.45/8.33 [2019-03-29 01:53:46,596 INFO L179 BlockEncoder]: Using Rewrite not-equals 18.45/8.33 [2019-03-29 01:53:46,613 INFO L185 BlockEncoder]: Using Use SBE 18.45/8.33 [2019-03-29 01:53:46,631 INFO L200 BlockEncoder]: SBE split 3 edges 18.45/8.33 [2019-03-29 01:53:46,636 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 18.45/8.33 [2019-03-29 01:53:46,638 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.45/8.33 [2019-03-29 01:53:46,649 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 18.45/8.33 [2019-03-29 01:53:46,652 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states 18.45/8.33 [2019-03-29 01:53:46,653 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 18.45/8.33 [2019-03-29 01:53:46,653 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.45/8.33 [2019-03-29 01:53:46,659 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 18.45/8.33 [2019-03-29 01:53:46,659 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 18.45/8.33 [2019-03-29 01:53:46,659 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 18.45/8.33 [2019-03-29 01:53:46,660 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.45/8.33 [2019-03-29 01:53:46,660 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 18.45/8.33 [2019-03-29 01:53:46,660 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 18.45/8.33 [2019-03-29 01:53:46,660 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 7 edges 18.45/8.33 [2019-03-29 01:53:46,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:53:46 BasicIcfg 18.45/8.33 [2019-03-29 01:53:46,661 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 18.45/8.33 [2019-03-29 01:53:46,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 18.45/8.33 [2019-03-29 01:53:46,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... 18.45/8.33 [2019-03-29 01:53:46,666 INFO L276 PluginConnector]: TraceAbstraction initialized 18.45/8.33 [2019-03-29 01:53:46,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 01:53:45" (1/4) ... 18.45/8.33 [2019-03-29 01:53:46,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d6587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:53:46, skipping insertion in model container 18.45/8.33 [2019-03-29 01:53:46,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (2/4) ... 18.45/8.33 [2019-03-29 01:53:46,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d6587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:53:46, skipping insertion in model container 18.45/8.33 [2019-03-29 01:53:46,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:53:46" (3/4) ... 18.45/8.33 [2019-03-29 01:53:46,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d6587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:53:46, skipping insertion in model container 18.45/8.33 [2019-03-29 01:53:46,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:53:46" (4/4) ... 18.45/8.33 [2019-03-29 01:53:46,671 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 18.45/8.33 [2019-03-29 01:53:46,681 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 18.45/8.33 [2019-03-29 01:53:46,688 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 18.45/8.33 [2019-03-29 01:53:46,707 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 18.45/8.33 [2019-03-29 01:53:46,737 INFO L133 ementStrategyFactory]: Using default assertion order modulation 18.45/8.33 [2019-03-29 01:53:46,738 INFO L382 AbstractCegarLoop]: Interprodecural is true 18.45/8.33 [2019-03-29 01:53:46,738 INFO L383 AbstractCegarLoop]: Hoare is true 18.45/8.33 [2019-03-29 01:53:46,738 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 18.45/8.33 [2019-03-29 01:53:46,738 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 18.45/8.33 [2019-03-29 01:53:46,738 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 18.45/8.33 [2019-03-29 01:53:46,738 INFO L387 AbstractCegarLoop]: Difference is false 18.45/8.33 [2019-03-29 01:53:46,739 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 18.45/8.33 [2019-03-29 01:53:46,739 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 18.45/8.33 [2019-03-29 01:53:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. 18.45/8.33 [2019-03-29 01:53:46,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 18.45/8.33 [2019-03-29 01:53:46,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. 18.45/8.33 [2019-03-29 01:53:46,813 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 18.45/8.33 [2019-03-29 01:53:46,813 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 28) no Hoare annotation was computed. 18.45/8.33 [2019-03-29 01:53:46,813 INFO L451 ceAbstractionStarter]: At program point L24-2(lines 23 29) the Hoare annotation is: true 18.45/8.33 [2019-03-29 01:53:46,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:53:46 BasicIcfg 18.45/8.33 [2019-03-29 01:53:46,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 18.45/8.33 [2019-03-29 01:53:46,823 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 18.45/8.33 [2019-03-29 01:53:46,823 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 18.45/8.33 [2019-03-29 01:53:46,826 INFO L276 PluginConnector]: BuchiAutomizer initialized 18.45/8.33 [2019-03-29 01:53:46,827 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.45/8.33 [2019-03-29 01:53:46,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 01:53:45" (1/5) ... 18.45/8.33 [2019-03-29 01:53:46,828 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72dd1858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:53:46, skipping insertion in model container 18.45/8.33 [2019-03-29 01:53:46,828 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.45/8.33 [2019-03-29 01:53:46,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:46" (2/5) ... 18.45/8.33 [2019-03-29 01:53:46,828 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72dd1858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:53:46, skipping insertion in model container 18.45/8.33 [2019-03-29 01:53:46,829 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.45/8.33 [2019-03-29 01:53:46,829 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:53:46" (3/5) ... 18.45/8.33 [2019-03-29 01:53:46,829 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72dd1858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:53:46, skipping insertion in model container 18.45/8.33 [2019-03-29 01:53:46,829 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.45/8.33 [2019-03-29 01:53:46,829 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:53:46" (4/5) ... 18.45/8.33 [2019-03-29 01:53:46,830 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72dd1858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:53:46, skipping insertion in model container 18.45/8.33 [2019-03-29 01:53:46,830 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.45/8.33 [2019-03-29 01:53:46,830 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:53:46" (5/5) ... 18.45/8.33 [2019-03-29 01:53:46,831 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 18.45/8.33 [2019-03-29 01:53:46,858 INFO L133 ementStrategyFactory]: Using default assertion order modulation 18.45/8.33 [2019-03-29 01:53:46,859 INFO L374 BuchiCegarLoop]: Interprodecural is true 18.45/8.33 [2019-03-29 01:53:46,859 INFO L375 BuchiCegarLoop]: Hoare is true 18.45/8.33 [2019-03-29 01:53:46,859 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 18.45/8.33 [2019-03-29 01:53:46,859 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 18.45/8.33 [2019-03-29 01:53:46,859 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 18.45/8.33 [2019-03-29 01:53:46,859 INFO L379 BuchiCegarLoop]: Difference is false 18.45/8.33 [2019-03-29 01:53:46,860 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 18.45/8.33 [2019-03-29 01:53:46,860 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 18.45/8.33 [2019-03-29 01:53:46,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 18.45/8.33 [2019-03-29 01:53:46,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 18.45/8.33 [2019-03-29 01:53:46,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.45/8.33 [2019-03-29 01:53:46,882 INFO L119 BuchiIsEmpty]: Starting construction of run 18.45/8.33 [2019-03-29 01:53:46,889 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.45/8.33 [2019-03-29 01:53:46,890 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 18.45/8.33 [2019-03-29 01:53:46,890 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 18.45/8.33 [2019-03-29 01:53:46,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 18.45/8.33 [2019-03-29 01:53:46,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 18.45/8.33 [2019-03-29 01:53:46,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.45/8.33 [2019-03-29 01:53:46,891 INFO L119 BuchiIsEmpty]: Starting construction of run 18.45/8.33 [2019-03-29 01:53:46,891 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.45/8.33 [2019-03-29 01:53:46,891 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 18.45/8.33 [2019-03-29 01:53:46,897 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 4#L24-2true 18.45/8.33 [2019-03-29 01:53:46,897 INFO L796 eck$LassoCheckResult]: Loop: 4#L24-2true [48] L24-2-->L24: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 5#L24true [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 4#L24-2true 18.45/8.33 [2019-03-29 01:53:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:46,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:46,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:46,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:46,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:46,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:46,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:46,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2486, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:46,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:46,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:46,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:46,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:46,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash 83210, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:46,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:46,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:46,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:46,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:46,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.45/8.33 [2019-03-29 01:53:47,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.45/8.33 [2019-03-29 01:53:47,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.45/8.33 [2019-03-29 01:53:47,088 INFO L216 LassoAnalysis]: Preferences: 18.45/8.33 [2019-03-29 01:53:47,089 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.45/8.33 [2019-03-29 01:53:47,089 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.45/8.33 [2019-03-29 01:53:47,089 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.45/8.33 [2019-03-29 01:53:47,090 INFO L127 ssoRankerPreferences]: Use exernal solver: true 18.45/8.33 [2019-03-29 01:53:47,090 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:47,090 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.45/8.33 [2019-03-29 01:53:47,090 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.45/8.33 [2019-03-29 01:53:47,090 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 18.45/8.33 [2019-03-29 01:53:47,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.45/8.33 [2019-03-29 01:53:47,091 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.45/8.33 [2019-03-29 01:53:47,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:47,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:47,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:47,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:47,230 INFO L300 LassoAnalysis]: Preprocessing complete. 18.45/8.33 [2019-03-29 01:53:47,230 INFO L412 LassoAnalysis]: Checking for nontermination... 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:47,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.45/8.33 [2019-03-29 01:53:47,239 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.45/8.33 [2019-03-29 01:53:47,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.45/8.33 [2019-03-29 01:53:47,273 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: [] 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:47,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.45/8.33 [2019-03-29 01:53:47,280 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.45/8.33 [2019-03-29 01:53:47,308 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.45/8.33 [2019-03-29 01:53:47,308 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: [] 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:47,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.45/8.33 [2019-03-29 01:53:47,313 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:47,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 18.45/8.33 [2019-03-29 01:53:47,345 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.45/8.33 [2019-03-29 01:53:47,580 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 18.45/8.33 [2019-03-29 01:53:47,583 INFO L216 LassoAnalysis]: Preferences: 18.45/8.33 [2019-03-29 01:53:47,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.45/8.33 [2019-03-29 01:53:47,583 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.45/8.33 [2019-03-29 01:53:47,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.45/8.33 [2019-03-29 01:53:47,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.45/8.33 [2019-03-29 01:53:47,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:47,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.45/8.33 [2019-03-29 01:53:47,584 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.45/8.33 [2019-03-29 01:53:47,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 18.45/8.33 [2019-03-29 01:53:47,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.45/8.33 [2019-03-29 01:53:47,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.45/8.33 [2019-03-29 01:53:47,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:47,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:47,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:47,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:47,673 INFO L300 LassoAnalysis]: Preprocessing complete. 18.45/8.33 [2019-03-29 01:53:47,679 INFO L497 LassoAnalysis]: Using template 'affine'. 18.45/8.33 [2019-03-29 01:53:47,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.45/8.33 Termination analysis: LINEAR_WITH_GUESSES 18.45/8.33 Number of strict supporting invariants: 0 18.45/8.33 Number of non-strict supporting invariants: 1 18.45/8.33 Consider only non-deceasing supporting invariants: true 18.45/8.33 Simplify termination arguments: true 18.45/8.33 Simplify supporting invariants: trueOverapproximate stem: false 18.45/8.33 [2019-03-29 01:53:47,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.45/8.33 [2019-03-29 01:53:47,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.45/8.33 [2019-03-29 01:53:47,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.45/8.33 [2019-03-29 01:53:47,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.45/8.33 [2019-03-29 01:53:47,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.45/8.33 [2019-03-29 01:53:47,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.45/8.33 [2019-03-29 01:53:47,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.45/8.33 [2019-03-29 01:53:47,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.45/8.33 Termination analysis: LINEAR_WITH_GUESSES 18.45/8.33 Number of strict supporting invariants: 0 18.45/8.33 Number of non-strict supporting invariants: 1 18.45/8.33 Consider only non-deceasing supporting invariants: true 18.45/8.33 Simplify termination arguments: true 18.45/8.33 Simplify supporting invariants: trueOverapproximate stem: false 18.45/8.33 [2019-03-29 01:53:47,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.45/8.33 [2019-03-29 01:53:47,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.45/8.33 [2019-03-29 01:53:47,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.45/8.33 [2019-03-29 01:53:47,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.45/8.33 [2019-03-29 01:53:47,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.45/8.33 [2019-03-29 01:53:47,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.45/8.33 [2019-03-29 01:53:47,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.45/8.33 [2019-03-29 01:53:47,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.45/8.33 Termination analysis: LINEAR_WITH_GUESSES 18.45/8.33 Number of strict supporting invariants: 0 18.45/8.33 Number of non-strict supporting invariants: 1 18.45/8.33 Consider only non-deceasing supporting invariants: true 18.45/8.33 Simplify termination arguments: true 18.45/8.33 Simplify supporting invariants: trueOverapproximate stem: false 18.45/8.33 [2019-03-29 01:53:47,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.45/8.33 [2019-03-29 01:53:47,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.45/8.33 [2019-03-29 01:53:47,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.45/8.33 [2019-03-29 01:53:47,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.45/8.33 [2019-03-29 01:53:47,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.45/8.33 [2019-03-29 01:53:47,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.45/8.33 [2019-03-29 01:53:47,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.45/8.33 [2019-03-29 01:53:47,720 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.45/8.33 [2019-03-29 01:53:47,730 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 18.45/8.33 [2019-03-29 01:53:47,731 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 18.45/8.33 [2019-03-29 01:53:47,733 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.45/8.33 [2019-03-29 01:53:47,733 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 18.45/8.33 [2019-03-29 01:53:47,733 INFO L518 LassoAnalysis]: Proved termination. 18.45/8.33 [2019-03-29 01:53:47,734 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.45/8.33 Ranking function f(ULTIMATE.start_main_~id~0, ULTIMATE.start_main_~tmp~0) = 1*ULTIMATE.start_main_~id~0 - 1*ULTIMATE.start_main_~tmp~0 18.45/8.33 Supporting invariants [] 18.45/8.33 [2019-03-29 01:53:47,735 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 18.45/8.33 [2019-03-29 01:53:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:47,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 18.45/8.33 [2019-03-29 01:53:47,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.45/8.33 [2019-03-29 01:53:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:47,785 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 18.45/8.33 [2019-03-29 01:53:47,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.45/8.33 [2019-03-29 01:53:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.45/8.33 [2019-03-29 01:53:47,831 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 18.45/8.33 [2019-03-29 01:53:47,836 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 2 loop predicates 18.45/8.33 [2019-03-29 01:53:47,837 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. 18.45/8.33 [2019-03-29 01:53:47,903 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 13 states and 39 transitions. Complement of second has 6 states. 18.45/8.33 [2019-03-29 01:53:47,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 18.45/8.33 [2019-03-29 01:53:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 18.45/8.33 [2019-03-29 01:53:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. 18.45/8.33 [2019-03-29 01:53:47,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 2 letters. 18.45/8.33 [2019-03-29 01:53:47,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.45/8.33 [2019-03-29 01:53:47,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 3 letters. Loop has 2 letters. 18.45/8.33 [2019-03-29 01:53:47,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.45/8.33 [2019-03-29 01:53:47,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 4 letters. 18.45/8.33 [2019-03-29 01:53:47,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.45/8.33 [2019-03-29 01:53:47,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 39 transitions. 18.45/8.33 [2019-03-29 01:53:47,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 18.45/8.33 [2019-03-29 01:53:47,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 39 transitions. 18.45/8.33 [2019-03-29 01:53:47,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 18.45/8.33 [2019-03-29 01:53:47,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 18.45/8.33 [2019-03-29 01:53:47,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 39 transitions. 18.45/8.33 [2019-03-29 01:53:47,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.45/8.33 [2019-03-29 01:53:47,926 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 39 transitions. 18.45/8.33 [2019-03-29 01:53:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 39 transitions. 18.45/8.33 [2019-03-29 01:53:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. 18.45/8.33 [2019-03-29 01:53:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 18.45/8.33 [2019-03-29 01:53:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. 18.45/8.33 [2019-03-29 01:53:47,956 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 36 transitions. 18.45/8.33 [2019-03-29 01:53:47,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.45/8.33 [2019-03-29 01:53:47,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.45/8.33 [2019-03-29 01:53:47,960 INFO L87 Difference]: Start difference. First operand 11 states and 36 transitions. Second operand 3 states. 18.45/8.33 [2019-03-29 01:53:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.45/8.33 [2019-03-29 01:53:47,981 INFO L93 Difference]: Finished difference Result 10 states and 22 transitions. 18.45/8.33 [2019-03-29 01:53:47,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.45/8.33 [2019-03-29 01:53:47,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 22 transitions. 18.45/8.33 [2019-03-29 01:53:47,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 18.45/8.33 [2019-03-29 01:53:47,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 17 transitions. 18.45/8.33 [2019-03-29 01:53:47,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 18.45/8.33 [2019-03-29 01:53:47,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 18.45/8.33 [2019-03-29 01:53:47,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 17 transitions. 18.45/8.33 [2019-03-29 01:53:47,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.45/8.33 [2019-03-29 01:53:47,986 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 17 transitions. 18.45/8.33 [2019-03-29 01:53:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 17 transitions. 18.45/8.33 [2019-03-29 01:53:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 5. 18.45/8.33 [2019-03-29 01:53:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 18.45/8.33 [2019-03-29 01:53:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. 18.45/8.33 [2019-03-29 01:53:47,988 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 11 transitions. 18.45/8.33 [2019-03-29 01:53:47,988 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 11 transitions. 18.45/8.33 [2019-03-29 01:53:47,988 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 18.45/8.33 [2019-03-29 01:53:47,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 11 transitions. 18.45/8.33 [2019-03-29 01:53:47,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 18.45/8.33 [2019-03-29 01:53:47,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.45/8.33 [2019-03-29 01:53:47,989 INFO L119 BuchiIsEmpty]: Starting construction of run 18.45/8.33 [2019-03-29 01:53:47,989 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.45/8.33 [2019-03-29 01:53:47,989 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 18.45/8.33 [2019-03-29 01:53:47,989 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 75#L24-2 18.45/8.33 [2019-03-29 01:53:47,990 INFO L796 eck$LassoCheckResult]: Loop: 75#L24-2 [49] L24-2-->L24: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 76#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 75#L24-2 18.45/8.33 [2019-03-29 01:53:47,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:47,990 INFO L82 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 2 times 18.45/8.33 [2019-03-29 01:53:47,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:47,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:47,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:47,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:47,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:47,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:47,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2517, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:47,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:47,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:48,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash 83241, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:48,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:48,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:48,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,037 INFO L216 LassoAnalysis]: Preferences: 18.45/8.33 [2019-03-29 01:53:48,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.45/8.33 [2019-03-29 01:53:48,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.45/8.33 [2019-03-29 01:53:48,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.45/8.33 [2019-03-29 01:53:48,037 INFO L127 ssoRankerPreferences]: Use exernal solver: true 18.45/8.33 [2019-03-29 01:53:48,037 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:48,038 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.45/8.33 [2019-03-29 01:53:48,038 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.45/8.33 [2019-03-29 01:53:48,038 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 18.45/8.33 [2019-03-29 01:53:48,038 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.45/8.33 [2019-03-29 01:53:48,038 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.45/8.33 [2019-03-29 01:53:48,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:48,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:48,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:48,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:48,096 INFO L300 LassoAnalysis]: Preprocessing complete. 18.45/8.33 [2019-03-29 01:53:48,096 INFO L412 LassoAnalysis]: Checking for nontermination... 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:48,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.45/8.33 [2019-03-29 01:53:48,101 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.45/8.33 [2019-03-29 01:53:48,130 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.45/8.33 [2019-03-29 01:53:48,130 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: [] 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:48,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.45/8.33 [2019-03-29 01:53:48,136 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:48,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 18.45/8.33 [2019-03-29 01:53:48,170 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.45/8.33 [2019-03-29 01:53:48,403 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 18.45/8.33 [2019-03-29 01:53:48,406 INFO L216 LassoAnalysis]: Preferences: 18.45/8.33 [2019-03-29 01:53:48,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.45/8.33 [2019-03-29 01:53:48,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.45/8.33 [2019-03-29 01:53:48,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.45/8.33 [2019-03-29 01:53:48,407 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.45/8.33 [2019-03-29 01:53:48,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:48,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.45/8.33 [2019-03-29 01:53:48,407 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.45/8.33 [2019-03-29 01:53:48,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 18.45/8.33 [2019-03-29 01:53:48,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.45/8.33 [2019-03-29 01:53:48,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.45/8.33 [2019-03-29 01:53:48,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:48,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:48,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:48,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:48,480 INFO L300 LassoAnalysis]: Preprocessing complete. 18.45/8.33 [2019-03-29 01:53:48,481 INFO L497 LassoAnalysis]: Using template 'affine'. 18.45/8.33 [2019-03-29 01:53:48,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.45/8.33 Termination analysis: LINEAR_WITH_GUESSES 18.45/8.33 Number of strict supporting invariants: 0 18.45/8.33 Number of non-strict supporting invariants: 1 18.45/8.33 Consider only non-deceasing supporting invariants: true 18.45/8.33 Simplify termination arguments: true 18.45/8.33 Simplify supporting invariants: trueOverapproximate stem: false 18.45/8.33 [2019-03-29 01:53:48,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.45/8.33 [2019-03-29 01:53:48,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.45/8.33 [2019-03-29 01:53:48,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.45/8.33 [2019-03-29 01:53:48,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.45/8.33 [2019-03-29 01:53:48,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.45/8.33 [2019-03-29 01:53:48,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.45/8.33 [2019-03-29 01:53:48,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.45/8.33 [2019-03-29 01:53:48,489 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.45/8.33 [2019-03-29 01:53:48,497 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 18.45/8.33 [2019-03-29 01:53:48,497 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. 18.45/8.33 [2019-03-29 01:53:48,498 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.45/8.33 [2019-03-29 01:53:48,498 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 18.45/8.33 [2019-03-29 01:53:48,498 INFO L518 LassoAnalysis]: Proved termination. 18.45/8.33 [2019-03-29 01:53:48,498 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.45/8.33 Ranking function f(ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_~tmp~0) = 2*ULTIMATE.start_main_~maxId~0 - 2*ULTIMATE.start_main_~tmp~0 + 1 18.45/8.33 Supporting invariants [] 18.45/8.33 [2019-03-29 01:53:48,499 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 18.45/8.33 [2019-03-29 01:53:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:48,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 18.45/8.33 [2019-03-29 01:53:48,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.45/8.33 [2019-03-29 01:53:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:48,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 18.45/8.33 [2019-03-29 01:53:48,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.45/8.33 [2019-03-29 01:53:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.45/8.33 [2019-03-29 01:53:48,537 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 18.45/8.33 [2019-03-29 01:53:48,538 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 1 loop predicates 18.45/8.33 [2019-03-29 01:53:48,538 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 11 transitions. cyclomatic complexity: 7 Second operand 3 states. 18.45/8.33 [2019-03-29 01:53:48,559 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 11 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 9 states and 21 transitions. Complement of second has 4 states. 18.45/8.33 [2019-03-29 01:53:48,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 18.45/8.33 [2019-03-29 01:53:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 18.45/8.33 [2019-03-29 01:53:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. 18.45/8.33 [2019-03-29 01:53:48,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. 18.45/8.33 [2019-03-29 01:53:48,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.45/8.33 [2019-03-29 01:53:48,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. 18.45/8.33 [2019-03-29 01:53:48,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.45/8.33 [2019-03-29 01:53:48,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. 18.45/8.33 [2019-03-29 01:53:48,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.45/8.33 [2019-03-29 01:53:48,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 18.45/8.33 [2019-03-29 01:53:48,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 18.45/8.33 [2019-03-29 01:53:48,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 18.45/8.33 [2019-03-29 01:53:48,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.45/8.33 [2019-03-29 01:53:48,565 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. 18.45/8.33 [2019-03-29 01:53:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 18.45/8.33 [2019-03-29 01:53:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,568 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,568 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,568 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 18.45/8.33 [2019-03-29 01:53:48,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 18.45/8.33 [2019-03-29 01:53:48,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.45/8.33 [2019-03-29 01:53:48,569 INFO L119 BuchiIsEmpty]: Starting construction of run 18.45/8.33 [2019-03-29 01:53:48,569 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 18.45/8.33 [2019-03-29 01:53:48,569 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 18.45/8.33 [2019-03-29 01:53:48,570 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 117#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 122#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 123#L24-2 18.45/8.33 [2019-03-29 01:53:48,570 INFO L796 eck$LassoCheckResult]: Loop: 123#L24-2 [49] L24-2-->L24: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 119#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 123#L24-2 18.45/8.33 [2019-03-29 01:53:48,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:48,570 INFO L82 PathProgramCache]: Analyzing trace with hash 83309, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:48,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:48,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.45/8.33 [2019-03-29 01:53:48,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.45/8.33 [2019-03-29 01:53:48,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 18.45/8.33 [2019-03-29 01:53:48,586 INFO L799 eck$LassoCheckResult]: stem already infeasible 18.45/8.33 [2019-03-29 01:53:48,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:48,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2523, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:48,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:48,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:48,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.45/8.33 [2019-03-29 01:53:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.45/8.33 [2019-03-29 01:53:48,614 INFO L87 Difference]: Start difference. First operand 9 states and 21 transitions. cyclomatic complexity: 14 Second operand 3 states. 18.45/8.33 [2019-03-29 01:53:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.45/8.33 [2019-03-29 01:53:48,631 INFO L93 Difference]: Finished difference Result 11 states and 22 transitions. 18.45/8.33 [2019-03-29 01:53:48,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.45/8.33 [2019-03-29 01:53:48,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 22 transitions. 18.45/8.33 [2019-03-29 01:53:48,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 18.45/8.33 [2019-03-29 01:53:48,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 20 transitions. 18.45/8.33 [2019-03-29 01:53:48,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 18.45/8.33 [2019-03-29 01:53:48,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 18.45/8.33 [2019-03-29 01:53:48,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 20 transitions. 18.45/8.33 [2019-03-29 01:53:48,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.45/8.33 [2019-03-29 01:53:48,635 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 20 transitions. 18.45/8.33 [2019-03-29 01:53:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 20 transitions. 18.45/8.33 [2019-03-29 01:53:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. 18.45/8.33 [2019-03-29 01:53:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 18.45/8.33 [2019-03-29 01:53:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. 18.45/8.33 [2019-03-29 01:53:48,637 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. 18.45/8.33 [2019-03-29 01:53:48,637 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. 18.45/8.33 [2019-03-29 01:53:48,637 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 18.45/8.33 [2019-03-29 01:53:48,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 19 transitions. 18.45/8.33 [2019-03-29 01:53:48,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 18.45/8.33 [2019-03-29 01:53:48,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.45/8.33 [2019-03-29 01:53:48,639 INFO L119 BuchiIsEmpty]: Starting construction of run 18.45/8.33 [2019-03-29 01:53:48,639 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] 18.45/8.33 [2019-03-29 01:53:48,640 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 18.45/8.33 [2019-03-29 01:53:48,640 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 143#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 147#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 146#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 148#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 149#L24-2 18.45/8.33 [2019-03-29 01:53:48,640 INFO L796 eck$LassoCheckResult]: Loop: 149#L24-2 [49] L24-2-->L24: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 145#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 149#L24-2 18.45/8.33 [2019-03-29 01:53:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:48,641 INFO L82 PathProgramCache]: Analyzing trace with hash 80055807, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:48,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:48,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:48,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2523, now seen corresponding path program 2 times 18.45/8.33 [2019-03-29 01:53:48,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:48,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:48,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash -375779239, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:48,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:48,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 18.45/8.33 [2019-03-29 01:53:48,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 18.45/8.33 [2019-03-29 01:53:48,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 18.45/8.33 [2019-03-29 01:53:48,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:48,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core 18.45/8.33 [2019-03-29 01:53:48,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.45/8.33 [2019-03-29 01:53:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 18.45/8.33 [2019-03-29 01:53:48,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 18.45/8.33 [2019-03-29 01:53:48,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 18.45/8.33 [2019-03-29 01:53:48,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 18.45/8.33 [2019-03-29 01:53:48,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 18.45/8.33 [2019-03-29 01:53:48,767 INFO L87 Difference]: Start difference. First operand 9 states and 19 transitions. cyclomatic complexity: 12 Second operand 5 states. 18.45/8.33 [2019-03-29 01:53:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.45/8.33 [2019-03-29 01:53:48,803 INFO L93 Difference]: Finished difference Result 11 states and 23 transitions. 18.45/8.33 [2019-03-29 01:53:48,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 18.45/8.33 [2019-03-29 01:53:48,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 23 transitions. 18.45/8.33 [2019-03-29 01:53:48,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 18.45/8.33 [2019-03-29 01:53:48,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 23 transitions. 18.45/8.33 [2019-03-29 01:53:48,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 18.45/8.33 [2019-03-29 01:53:48,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 18.45/8.33 [2019-03-29 01:53:48,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 23 transitions. 18.45/8.33 [2019-03-29 01:53:48,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.45/8.33 [2019-03-29 01:53:48,808 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 23 transitions. 18.45/8.33 [2019-03-29 01:53:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 23 transitions. 18.45/8.33 [2019-03-29 01:53:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. 18.45/8.33 [2019-03-29 01:53:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 18.45/8.33 [2019-03-29 01:53:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,810 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,810 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,810 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 18.45/8.33 [2019-03-29 01:53:48,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:48,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 18.45/8.33 [2019-03-29 01:53:48,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.45/8.33 [2019-03-29 01:53:48,811 INFO L119 BuchiIsEmpty]: Starting construction of run 18.45/8.33 [2019-03-29 01:53:48,811 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] 18.45/8.33 [2019-03-29 01:53:48,811 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 18.45/8.33 [2019-03-29 01:53:48,812 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 193#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 197#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 196#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 198#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 199#L24-2 18.45/8.33 [2019-03-29 01:53:48,812 INFO L796 eck$LassoCheckResult]: Loop: 199#L24-2 [48] L24-2-->L24: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 200#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 199#L24-2 18.45/8.33 [2019-03-29 01:53:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:48,812 INFO L82 PathProgramCache]: Analyzing trace with hash 80055807, now seen corresponding path program 2 times 18.45/8.33 [2019-03-29 01:53:48,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:48,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:48,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2492, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:48,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:48,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:48,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:48,830 INFO L82 PathProgramCache]: Analyzing trace with hash -375779270, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:48,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:48,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 18.45/8.33 [2019-03-29 01:53:48,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 18.45/8.33 [2019-03-29 01:53:48,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 18.45/8.33 [2019-03-29 01:53:48,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:48,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core 18.45/8.33 [2019-03-29 01:53:48,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.45/8.33 [2019-03-29 01:53:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. 18.45/8.33 [2019-03-29 01:53:48,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 18.45/8.33 [2019-03-29 01:53:48,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 18.45/8.33 [2019-03-29 01:53:48,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 18.45/8.33 [2019-03-29 01:53:48,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 18.45/8.33 [2019-03-29 01:53:48,956 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. cyclomatic complexity: 13 Second operand 6 states. 18.45/8.33 [2019-03-29 01:53:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.45/8.33 [2019-03-29 01:53:49,022 INFO L93 Difference]: Finished difference Result 11 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:49,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 18.45/8.33 [2019-03-29 01:53:49,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:49,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 18.45/8.33 [2019-03-29 01:53:49,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:49,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 18.45/8.33 [2019-03-29 01:53:49,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 18.45/8.33 [2019-03-29 01:53:49,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:49,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.45/8.33 [2019-03-29 01:53:49,026 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 18.45/8.33 [2019-03-29 01:53:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 18.45/8.33 [2019-03-29 01:53:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:49,028 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:49,028 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:49,028 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 18.45/8.33 [2019-03-29 01:53:49,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 21 transitions. 18.45/8.33 [2019-03-29 01:53:49,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 18.45/8.33 [2019-03-29 01:53:49,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.45/8.33 [2019-03-29 01:53:49,029 INFO L119 BuchiIsEmpty]: Starting construction of run 18.45/8.33 [2019-03-29 01:53:49,029 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] 18.45/8.33 [2019-03-29 01:53:49,030 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] 18.45/8.33 [2019-03-29 01:53:49,030 INFO L794 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 249#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 253#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 252#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 254#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 250#L24-2 18.45/8.33 [2019-03-29 01:53:49,030 INFO L796 eck$LassoCheckResult]: Loop: 250#L24-2 [48] L24-2-->L24: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 251#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 255#L24-2 [49] L24-2-->L24: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 258#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 257#L24-2 [49] L24-2-->L24: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 256#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 250#L24-2 18.45/8.33 [2019-03-29 01:53:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash 80055807, now seen corresponding path program 3 times 18.45/8.33 [2019-03-29 01:53:49,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:49,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:49,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1997597212, now seen corresponding path program 1 times 18.45/8.33 [2019-03-29 01:53:49,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:49,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 18.45/8.33 [2019-03-29 01:53:49,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.45/8.33 [2019-03-29 01:53:49,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 18.45/8.33 [2019-03-29 01:53:49,066 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.45/8.33 [2019-03-29 01:53:49,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 18.45/8.33 [2019-03-29 01:53:49,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 18.45/8.33 [2019-03-29 01:53:49,067 INFO L87 Difference]: Start difference. First operand 11 states and 21 transitions. cyclomatic complexity: 12 Second operand 4 states. 18.45/8.33 [2019-03-29 01:53:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.45/8.33 [2019-03-29 01:53:49,099 INFO L93 Difference]: Finished difference Result 8 states and 14 transitions. 18.45/8.33 [2019-03-29 01:53:49,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 18.45/8.33 [2019-03-29 01:53:49,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 14 transitions. 18.45/8.33 [2019-03-29 01:53:49,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 18.45/8.33 [2019-03-29 01:53:49,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 14 transitions. 18.45/8.33 [2019-03-29 01:53:49,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 18.45/8.33 [2019-03-29 01:53:49,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 18.45/8.33 [2019-03-29 01:53:49,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 14 transitions. 18.45/8.33 [2019-03-29 01:53:49,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.45/8.33 [2019-03-29 01:53:49,102 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 14 transitions. 18.45/8.33 [2019-03-29 01:53:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 14 transitions. 18.45/8.33 [2019-03-29 01:53:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. 18.45/8.33 [2019-03-29 01:53:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 18.45/8.33 [2019-03-29 01:53:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. 18.45/8.33 [2019-03-29 01:53:49,104 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 12 transitions. 18.45/8.33 [2019-03-29 01:53:49,105 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 12 transitions. 18.45/8.33 [2019-03-29 01:53:49,105 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 18.45/8.33 [2019-03-29 01:53:49,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 12 transitions. 18.45/8.33 [2019-03-29 01:53:49,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 18.45/8.33 [2019-03-29 01:53:49,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.45/8.33 [2019-03-29 01:53:49,106 INFO L119 BuchiIsEmpty]: Starting construction of run 18.45/8.33 [2019-03-29 01:53:49,106 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] 18.45/8.33 [2019-03-29 01:53:49,106 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 18.45/8.33 [2019-03-29 01:53:49,106 INFO L794 eck$LassoCheckResult]: Stem: 274#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 275#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 279#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 278#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 280#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 276#L24-2 18.45/8.33 [2019-03-29 01:53:49,107 INFO L796 eck$LassoCheckResult]: Loop: 276#L24-2 [48] L24-2-->L24: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 277#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 276#L24-2 18.45/8.33 [2019-03-29 01:53:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:49,107 INFO L82 PathProgramCache]: Analyzing trace with hash 80055807, now seen corresponding path program 4 times 18.45/8.33 [2019-03-29 01:53:49,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:49,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:49,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:49,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:49,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2486, now seen corresponding path program 2 times 18.45/8.33 [2019-03-29 01:53:49,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:49,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash -375779276, now seen corresponding path program 2 times 18.45/8.33 [2019-03-29 01:53:49,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.45/8.33 [2019-03-29 01:53:49,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.45/8.33 [2019-03-29 01:53:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.45/8.33 [2019-03-29 01:53:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.45/8.33 [2019-03-29 01:53:49,154 INFO L216 LassoAnalysis]: Preferences: 18.45/8.33 [2019-03-29 01:53:49,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.45/8.33 [2019-03-29 01:53:49,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.45/8.33 [2019-03-29 01:53:49,154 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.45/8.33 [2019-03-29 01:53:49,155 INFO L127 ssoRankerPreferences]: Use exernal solver: true 18.45/8.33 [2019-03-29 01:53:49,155 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:49,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.45/8.33 [2019-03-29 01:53:49,155 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.45/8.33 [2019-03-29 01:53:49,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 18.45/8.33 [2019-03-29 01:53:49,155 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.45/8.33 [2019-03-29 01:53:49,155 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.45/8.33 [2019-03-29 01:53:49,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:49,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:49,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:49,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:49,272 INFO L300 LassoAnalysis]: Preprocessing complete. 18.45/8.33 [2019-03-29 01:53:49,273 INFO L412 LassoAnalysis]: Checking for nontermination... 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:49,284 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.45/8.33 [2019-03-29 01:53:49,285 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.45/8.33 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.45/8.33 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.45/8.33 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:49,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 18.45/8.33 [2019-03-29 01:53:49,318 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.45/8.33 [2019-03-29 01:53:49,555 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 18.45/8.33 [2019-03-29 01:53:49,558 INFO L216 LassoAnalysis]: Preferences: 18.45/8.33 [2019-03-29 01:53:49,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.45/8.33 [2019-03-29 01:53:49,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.45/8.33 [2019-03-29 01:53:49,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.45/8.33 [2019-03-29 01:53:49,558 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.45/8.33 [2019-03-29 01:53:49,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.45/8.33 [2019-03-29 01:53:49,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.45/8.33 [2019-03-29 01:53:49,558 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.45/8.33 [2019-03-29 01:53:49,559 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 18.45/8.33 [2019-03-29 01:53:49,559 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.45/8.33 [2019-03-29 01:53:49,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.45/8.33 [2019-03-29 01:53:49,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:49,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:49,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:49,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.45/8.33 [2019-03-29 01:53:49,615 INFO L300 LassoAnalysis]: Preprocessing complete. 18.45/8.33 [2019-03-29 01:53:49,616 INFO L497 LassoAnalysis]: Using template 'affine'. 18.45/8.33 [2019-03-29 01:53:49,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.45/8.33 Termination analysis: LINEAR_WITH_GUESSES 18.45/8.33 Number of strict supporting invariants: 0 18.45/8.33 Number of non-strict supporting invariants: 1 18.45/8.33 Consider only non-deceasing supporting invariants: true 18.45/8.33 Simplify termination arguments: true 18.45/8.33 Simplify supporting invariants: trueOverapproximate stem: false 18.45/8.33 [2019-03-29 01:53:49,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.45/8.33 [2019-03-29 01:53:49,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.45/8.33 [2019-03-29 01:53:49,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.45/8.33 [2019-03-29 01:53:49,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.45/8.33 [2019-03-29 01:53:49,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.45/8.33 [2019-03-29 01:53:49,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.45/8.33 [2019-03-29 01:53:49,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.45/8.33 [2019-03-29 01:53:49,622 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.45/8.33 [2019-03-29 01:53:49,625 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 18.45/8.33 [2019-03-29 01:53:49,625 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 18.45/8.33 [2019-03-29 01:53:49,625 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.45/8.33 [2019-03-29 01:53:49,626 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 18.45/8.33 [2019-03-29 01:53:49,626 INFO L518 LassoAnalysis]: Proved termination. 18.45/8.33 [2019-03-29 01:53:49,626 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.45/8.33 Ranking function f(ULTIMATE.start_main_~id~0, ULTIMATE.start_main_~tmp~0) = 1*ULTIMATE.start_main_~id~0 - 1*ULTIMATE.start_main_~tmp~0 18.45/8.33 Supporting invariants [] 18.45/8.33 [2019-03-29 01:53:49,626 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 18.45/8.33 [2019-03-29 01:53:49,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.45/8.33 [2019-03-29 01:53:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:49,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core 18.45/8.33 [2019-03-29 01:53:49,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.45/8.33 [2019-03-29 01:53:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.45/8.33 [2019-03-29 01:53:49,653 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 18.45/8.33 [2019-03-29 01:53:49,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.45/8.33 [2019-03-29 01:53:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.45/8.33 [2019-03-29 01:53:49,698 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 18.45/8.33 [2019-03-29 01:53:49,698 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 2 loop predicates 18.45/8.33 [2019-03-29 01:53:49,699 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 12 transitions. cyclomatic complexity: 7 Second operand 3 states. 18.45/8.33 [2019-03-29 01:53:49,718 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 12 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 9 states and 18 transitions. Complement of second has 4 states. 18.45/8.33 [2019-03-29 01:53:49,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 18.45/8.33 [2019-03-29 01:53:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 18.45/8.33 [2019-03-29 01:53:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. 18.45/8.33 [2019-03-29 01:53:49,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. 18.45/8.33 [2019-03-29 01:53:49,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.45/8.33 [2019-03-29 01:53:49,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. 18.45/8.33 [2019-03-29 01:53:49,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.45/8.33 [2019-03-29 01:53:49,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. 18.45/8.33 [2019-03-29 01:53:49,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.45/8.33 [2019-03-29 01:53:49,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 18 transitions. 18.45/8.33 [2019-03-29 01:53:49,723 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 18.45/8.33 [2019-03-29 01:53:49,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. 18.45/8.33 [2019-03-29 01:53:49,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 18.45/8.33 [2019-03-29 01:53:49,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 18.45/8.33 [2019-03-29 01:53:49,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 18.45/8.33 [2019-03-29 01:53:49,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.45/8.33 [2019-03-29 01:53:49,724 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.45/8.33 [2019-03-29 01:53:49,724 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.45/8.33 [2019-03-29 01:53:49,724 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.45/8.33 [2019-03-29 01:53:49,724 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 18.45/8.33 [2019-03-29 01:53:49,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 18.45/8.33 [2019-03-29 01:53:49,724 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 18.45/8.33 [2019-03-29 01:53:49,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 18.45/8.33 [2019-03-29 01:53:49,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:53:49 BasicIcfg 18.45/8.33 [2019-03-29 01:53:49,731 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 18.45/8.33 [2019-03-29 01:53:49,731 INFO L168 Benchmark]: Toolchain (without parser) took 3725.14 ms. Allocated memory was 649.6 MB in the beginning and 754.5 MB in the end (delta: 104.9 MB). Free memory was 563.6 MB in the beginning and 674.6 MB in the end (delta: -111.0 MB). There was no memory consumed. Max. memory is 50.3 GB. 18.45/8.33 [2019-03-29 01:53:49,733 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 18.45/8.33 [2019-03-29 01:53:49,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.89 ms. Allocated memory is still 649.6 MB. Free memory was 563.6 MB in the beginning and 553.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 18.45/8.33 [2019-03-29 01:53:49,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.40 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 553.8 MB in the beginning and 651.5 MB in the end (delta: -97.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 18.45/8.33 [2019-03-29 01:53:49,735 INFO L168 Benchmark]: Boogie Preprocessor took 21.27 ms. Allocated memory is still 684.7 MB. Free memory was 651.5 MB in the beginning and 648.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 18.45/8.33 [2019-03-29 01:53:49,735 INFO L168 Benchmark]: RCFGBuilder took 212.90 ms. Allocated memory is still 684.7 MB. Free memory was 648.6 MB in the beginning and 635.2 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. 18.45/8.33 [2019-03-29 01:53:49,736 INFO L168 Benchmark]: BlockEncodingV2 took 91.12 ms. Allocated memory is still 684.7 MB. Free memory was 635.2 MB in the beginning and 628.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 18.45/8.33 [2019-03-29 01:53:49,736 INFO L168 Benchmark]: TraceAbstraction took 159.95 ms. Allocated memory is still 684.7 MB. Free memory was 627.4 MB in the beginning and 618.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 18.45/8.33 [2019-03-29 01:53:49,737 INFO L168 Benchmark]: BuchiAutomizer took 2908.17 ms. Allocated memory was 684.7 MB in the beginning and 754.5 MB in the end (delta: 69.7 MB). Free memory was 618.6 MB in the beginning and 674.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 50.3 GB. 18.45/8.33 [2019-03-29 01:53:49,741 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 18.45/8.33 --- Results --- 18.45/8.33 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 18.45/8.33 - StatisticsResult: Initial Icfg 18.45/8.33 8 locations, 11 edges 18.45/8.33 - StatisticsResult: Encoded RCFG 18.45/8.33 3 locations, 7 edges 18.45/8.33 * Results from de.uni_freiburg.informatik.ultimate.core: 18.45/8.33 - StatisticsResult: Toolchain Benchmarks 18.45/8.33 Benchmark results are: 18.45/8.33 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 18.45/8.33 * CACSL2BoogieTranslator took 227.89 ms. Allocated memory is still 649.6 MB. Free memory was 563.6 MB in the beginning and 553.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 18.45/8.33 * Boogie Procedure Inliner took 98.40 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 553.8 MB in the beginning and 651.5 MB in the end (delta: -97.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 18.45/8.33 * Boogie Preprocessor took 21.27 ms. Allocated memory is still 684.7 MB. Free memory was 651.5 MB in the beginning and 648.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 18.45/8.33 * RCFGBuilder took 212.90 ms. Allocated memory is still 684.7 MB. Free memory was 648.6 MB in the beginning and 635.2 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. 18.45/8.33 * BlockEncodingV2 took 91.12 ms. Allocated memory is still 684.7 MB. Free memory was 635.2 MB in the beginning and 628.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 18.45/8.33 * TraceAbstraction took 159.95 ms. Allocated memory is still 684.7 MB. Free memory was 627.4 MB in the beginning and 618.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 18.45/8.33 * BuchiAutomizer took 2908.17 ms. Allocated memory was 684.7 MB in the beginning and 754.5 MB in the end (delta: 69.7 MB). Free memory was 618.6 MB in the beginning and 674.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 50.3 GB. 18.45/8.33 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 18.45/8.33 - AllSpecificationsHoldResult: All specifications hold 18.45/8.33 We were not able to verify any specifiation because the program does not contain any specification. 18.45/8.33 - InvariantResult [Line: 23]: Loop Invariant 18.45/8.33 Derived loop invariant: 1 18.45/8.33 - StatisticsResult: Ultimate Automizer benchmark data 18.45/8.34 CFG has 1 procedures, 3 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=3occurred 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 18.45/8.34 - StatisticsResult: Constructed decomposition of program 18.45/8.34 Your program was decomposed into 8 terminating modules (5 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function id + -1 * tmp and consists of 4 locations. One nondeterministic module has affine ranking function 2 * maxId + -2 * tmp + 1 and consists of 3 locations. One nondeterministic module has affine ranking function id + -1 * tmp and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. 18.45/8.34 - StatisticsResult: Timing statistics 18.45/8.34 BüchiAutomizer plugin needed 2.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 50 SDslu, 0 SDs, 0 SdLazy, 126 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc2 concLT1 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax175 hnf100 lsp46 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s 18.45/8.34 - TerminationAnalysisResult: Termination proven 18.45/8.34 Buchi Automizer proved that your program is terminating 18.45/8.34 RESULT: Ultimate proved your program to be correct! 18.45/8.34 !SESSION 2019-03-29 01:53:42.603 ----------------------------------------------- 18.45/8.34 eclipse.buildId=unknown 18.45/8.34 java.version=1.8.0_181 18.45/8.34 java.vendor=Oracle Corporation 18.45/8.34 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 18.45/8.34 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 18.45/8.34 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 18.45/8.34 18.45/8.34 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 01:53:49.973 18.45/8.34 !MESSAGE The workspace will exit with unsaved changes in this session. 18.45/8.34 Received shutdown request... 18.45/8.34 Ultimate: 18.45/8.34 GTK+ Version Check 18.45/8.34 EOF