./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b4ad2a38f880b5d983e3386205155672555530b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:09:44,361 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:09:44,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:09:44,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:09:44,383 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:09:44,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:09:44,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:09:44,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:09:44,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:09:44,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:09:44,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:09:44,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:09:44,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:09:44,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:09:44,396 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:09:44,396 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:09:44,397 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:09:44,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:09:44,402 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:09:44,406 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:09:44,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:09:44,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:09:44,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:09:44,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:09:44,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:09:44,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:09:44,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:09:44,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:09:44,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:09:44,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:09:44,430 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:09:44,431 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:09:44,431 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:09:44,432 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:09:44,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:09:44,433 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:09:44,433 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:09:44,450 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:09:44,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:09:44,451 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:09:44,451 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:09:44,451 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:09:44,452 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:09:44,452 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:09:44,452 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:09:44,452 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:09:44,452 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:09:44,452 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:09:44,453 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:09:44,453 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:09:44,453 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:09:44,453 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:09:44,453 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:09:44,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:09:44,454 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:09:44,454 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:09:44,454 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:09:44,454 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:09:44,454 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:09:44,454 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:09:44,455 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:09:44,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:09:44,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:09:44,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:09:44,455 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:09:44,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:09:44,456 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:09:44,456 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:09:44,457 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:09:44,458 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b4ad2a38f880b5d983e3386205155672555530b [2019-01-02 00:09:44,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:09:44,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:09:44,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:09:44,513 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:09:44,513 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:09:44,514 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c [2019-01-02 00:09:44,583 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b328b15/128e449ebbc7488886161331e3d604e1/FLAG4f433f739 [2019-01-02 00:09:45,141 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:09:45,143 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c [2019-01-02 00:09:45,165 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b328b15/128e449ebbc7488886161331e3d604e1/FLAG4f433f739 [2019-01-02 00:09:45,424 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b328b15/128e449ebbc7488886161331e3d604e1 [2019-01-02 00:09:45,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:09:45,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:09:45,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:09:45,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:09:45,435 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:09:45,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:09:45" (1/1) ... [2019-01-02 00:09:45,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d0e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:45, skipping insertion in model container [2019-01-02 00:09:45,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:09:45" (1/1) ... [2019-01-02 00:09:45,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:09:45,508 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:09:45,865 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:09:45,879 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:09:46,011 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:09:46,122 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:09:46,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46 WrapperNode [2019-01-02 00:09:46,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:09:46,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:09:46,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:09:46,124 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:09:46,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (1/1) ... [2019-01-02 00:09:46,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (1/1) ... [2019-01-02 00:09:46,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:09:46,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:09:46,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:09:46,227 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:09:46,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (1/1) ... [2019-01-02 00:09:46,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (1/1) ... [2019-01-02 00:09:46,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (1/1) ... [2019-01-02 00:09:46,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (1/1) ... [2019-01-02 00:09:46,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (1/1) ... [2019-01-02 00:09:46,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (1/1) ... [2019-01-02 00:09:46,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (1/1) ... [2019-01-02 00:09:46,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:09:46,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:09:46,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:09:46,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:09:46,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:09:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:09:48,946 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:09:48,947 INFO L280 CfgBuilder]: Removed 19 assue(true) statements. [2019-01-02 00:09:48,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:48 BoogieIcfgContainer [2019-01-02 00:09:48,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:09:48,948 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:09:48,948 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:09:48,952 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:09:48,953 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:48,953 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:09:45" (1/3) ... [2019-01-02 00:09:48,955 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@158c1899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:09:48, skipping insertion in model container [2019-01-02 00:09:48,955 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:48,955 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:46" (2/3) ... [2019-01-02 00:09:48,955 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@158c1899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:09:48, skipping insertion in model container [2019-01-02 00:09:48,956 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:48,956 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:48" (3/3) ... [2019-01-02 00:09:48,958 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c [2019-01-02 00:09:49,025 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:09:49,026 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:09:49,026 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:09:49,026 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:09:49,027 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:09:49,027 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:09:49,027 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:09:49,027 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:09:49,027 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:09:49,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states. [2019-01-02 00:09:49,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2019-01-02 00:09:49,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:49,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:49,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:49,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:49,120 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:09:49,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states. [2019-01-02 00:09:49,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2019-01-02 00:09:49,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:49,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:49,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:49,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:49,147 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 12#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 126#L484true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 139#L495true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 20#L505true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 18#L516true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 247#L526true assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 246#L537true init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 308#L547true assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 307#L558true init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 212#L568true assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 211#L579true init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 105#L589true assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 104#L600true init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 7#L610true assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 5#L621true init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 66#L631true assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 65#L642true init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 294#L652true assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 292#L663true init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 191#L673true assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 189#L684true init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 84#L694true assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 83#L705true init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 146#L715true assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 145#L726true init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 45#L736true assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 44#L747true init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 274#L757true assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 273#L768true init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 178#L778true assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 177#L789true init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 237#L799true assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 236#L810true init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 118#L820true assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 134#L831true init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 14#L841true assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 13#L852true init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 71#L862true assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 69#L873true init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 298#L883true assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 297#L894true init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 195#L904true assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 194#L915true init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 92#L925true assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 91#L936true init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 159#L946true assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 157#L957true init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 58#L967true assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 56#L978true init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 285#L988true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 287#L988-1true init_#res := init_~tmp___23~0; 87#L1173true main_#t~ret56 := init_#res;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 47#L1314-2true [2019-01-02 00:09:49,149 INFO L796 eck$LassoCheckResult]: Loop: 47#L1314-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 312#L156true assume !(0 != ~mode1~0 % 256); 155#L192true assume !(~r1~0 < 2); 150#L192-1true ~mode1~0 := 1; 306#L156-2true havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 109#L220true assume !(0 != ~mode2~0 % 256); 277#L256true assume !(~r2~0 < 3); 276#L256-1true ~mode2~0 := 1; 102#L220-2true havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 67#L284true assume !(0 != ~mode3~0 % 256); 235#L320true assume !(~r3~0 < 3); 238#L320-1true ~mode3~0 := 1; 62#L284-2true havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 202#L348true assume !(0 != ~mode4~0 % 256); 28#L384true assume !(~r4~0 < 3); 32#L384-1true ~mode4~0 := 1; 209#L348-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 256#L1181true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 258#L1181-1true check_#res := check_~tmp~1; 121#L1233true main_#t~ret57 := check_#res;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 264#L1357true assume !(0 == assert_~arg % 256); 76#L1352true main_#t~post58 := main_~i2~0;main_~i2~0 := 1 + main_#t~post58;havoc main_#t~post58; 47#L1314-2true [2019-01-02 00:09:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash 15555676, now seen corresponding path program 1 times [2019-01-02 00:09:49,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:49,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:49,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:49,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:49,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:49,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:49,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:49,694 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:09:49,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:49,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1346770731, now seen corresponding path program 1 times [2019-01-02 00:09:49,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:49,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:49,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:49,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:49,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:49,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:49,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:09:49,918 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:09:49,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:09:49,941 INFO L87 Difference]: Start difference. First operand 321 states. Second operand 5 states. [2019-01-02 00:09:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:50,376 INFO L93 Difference]: Finished difference Result 325 states and 579 transitions. [2019-01-02 00:09:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:09:50,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 579 transitions. [2019-01-02 00:09:50,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2019-01-02 00:09:50,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 316 states and 562 transitions. [2019-01-02 00:09:50,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2019-01-02 00:09:50,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2019-01-02 00:09:50,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 562 transitions. [2019-01-02 00:09:50,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:50,412 INFO L705 BuchiCegarLoop]: Abstraction has 316 states and 562 transitions. [2019-01-02 00:09:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 562 transitions. [2019-01-02 00:09:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2019-01-02 00:09:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-02 00:09:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 562 transitions. [2019-01-02 00:09:50,491 INFO L728 BuchiCegarLoop]: Abstraction has 316 states and 562 transitions. [2019-01-02 00:09:50,492 INFO L608 BuchiCegarLoop]: Abstraction has 316 states and 562 transitions. [2019-01-02 00:09:50,492 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:09:50,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 562 transitions. [2019-01-02 00:09:50,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2019-01-02 00:09:50,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:50,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:50,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:50,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:50,505 INFO L794 eck$LassoCheckResult]: Stem: 870#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 684#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 685#L484 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 710#L495 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 704#L505 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 700#L516 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 701#L526 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 739#L537 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 967#L547 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 952#L558 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 950#L568 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 850#L579 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 848#L589 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 676#L600 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 673#L610 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 671#L621 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 672#L631 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 667#L642 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 787#L652 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 786#L663 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 940#L673 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 820#L684 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 818#L694 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 696#L705 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 816#L715 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 757#L726 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 753#L736 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 751#L747 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 752#L757 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 750#L768 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 924#L778 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 811#L789 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 923#L799 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 868#L810 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 866#L820 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 692#L831 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 688#L841 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 686#L852 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 687#L862 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 728#L873 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 796#L883 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 946#L894 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 943#L904 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 831#L915 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 828#L925 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 714#L936 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 827#L946 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 780#L957 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 777#L967 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 772#L978 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 773#L988 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 682#L988-1 init_#res := init_~tmp___23~0; 821#L1173 main_#t~ret56 := init_#res;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 758#L1314-2 [2019-01-02 00:09:50,505 INFO L796 eck$LassoCheckResult]: Loop: 758#L1314-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 759#L156 assume !(0 != ~mode1~0 % 256); 901#L192 assume !(~r1~0 < 2); 836#L192-1 ~mode1~0 := 1; 899#L156-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 852#L220 assume !(0 != ~mode2~0 % 256); 853#L256 assume !(~r2~0 < 3); 776#L256-1 ~mode2~0 := 1; 846#L220-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 788#L284 assume !(0 != ~mode3~0 % 256); 790#L320 assume !(~r3~0 < 3); 917#L320-1 ~mode3~0 := 1; 782#L284-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 783#L348 assume !(0 != ~mode4~0 % 256); 722#L384 assume !(~r4~0 < 3); 723#L384-1 ~mode4~0 := 1; 729#L348-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 949#L1181 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 732#L1182 assume ~st1~0 + ~nl1~0 <= 1; 733#L1183 assume ~st2~0 + ~nl2~0 <= 1; 822#L1184 assume ~st3~0 + ~nl3~0 <= 1; 823#L1185 assume ~st4~0 + ~nl4~0 <= 1; 939#L1186 assume ~r1~0 >= 3; 874#L1190 assume ~r1~0 < 3; 817#L1195 assume ~r1~0 >= 3; 694#L1200 assume ~r1~0 < 3;check_~tmp~1 := 1; 731#L1181-1 check_#res := check_~tmp~1; 871#L1233 main_#t~ret57 := check_#res;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 872#L1357 assume !(0 == assert_~arg % 256); 805#L1352 main_#t~post58 := main_~i2~0;main_~i2~0 := 1 + main_#t~post58;havoc main_#t~post58; 758#L1314-2 [2019-01-02 00:09:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash 15555676, now seen corresponding path program 2 times [2019-01-02 00:09:50,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:50,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:50,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:50,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:50,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:50,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:50,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:50,744 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:09:50,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:50,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1017631012, now seen corresponding path program 1 times [2019-01-02 00:09:50,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:50,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:50,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:50,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:50,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:50,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:50,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:50,835 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:50,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:09:50,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:09:50,836 INFO L87 Difference]: Start difference. First operand 316 states and 562 transitions. cyclomatic complexity: 247 Second operand 3 states. [2019-01-02 00:09:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:51,030 INFO L93 Difference]: Finished difference Result 413 states and 717 transitions. [2019-01-02 00:09:51,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:09:51,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 413 states and 717 transitions. [2019-01-02 00:09:51,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2019-01-02 00:09:51,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 413 states to 413 states and 717 transitions. [2019-01-02 00:09:51,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 413 [2019-01-02 00:09:51,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 413 [2019-01-02 00:09:51,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 717 transitions. [2019-01-02 00:09:51,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:51,057 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 717 transitions. [2019-01-02 00:09:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 717 transitions. [2019-01-02 00:09:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2019-01-02 00:09:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-01-02 00:09:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 717 transitions. [2019-01-02 00:09:51,100 INFO L728 BuchiCegarLoop]: Abstraction has 413 states and 717 transitions. [2019-01-02 00:09:51,100 INFO L608 BuchiCegarLoop]: Abstraction has 413 states and 717 transitions. [2019-01-02 00:09:51,100 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:09:51,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 413 states and 717 transitions. [2019-01-02 00:09:51,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2019-01-02 00:09:51,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:51,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:51,107 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:51,108 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:51,108 INFO L794 eck$LassoCheckResult]: Stem: 1609#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 1423#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1424#L484 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1447#L495 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1441#L505 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1437#L516 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1438#L526 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 1476#L537 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 1711#L547 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 1696#L558 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 1693#L568 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 1589#L579 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1587#L589 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 1413#L600 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1410#L610 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 1405#L621 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 1406#L631 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 1404#L642 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 1524#L652 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 1523#L663 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 1681#L673 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 1558#L684 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 1554#L694 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 1431#L705 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 1553#L715 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 1494#L726 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 1490#L736 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 1488#L747 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 1489#L757 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 1486#L768 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 1665#L778 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 1548#L789 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 1664#L799 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 1607#L810 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 1605#L820 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 1429#L831 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 1425#L841 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 1421#L852 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 1422#L862 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 1465#L873 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 1531#L883 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 1686#L894 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 1682#L904 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 1569#L915 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 1567#L925 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 1451#L936 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 1566#L946 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 1517#L957 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 1511#L967 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 1507#L978 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 1508#L988 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1419#L988-1 init_#res := init_~tmp___23~0; 1559#L1173 main_#t~ret56 := init_#res;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1560#L1314-2 [2019-01-02 00:09:51,109 INFO L796 eck$LassoCheckResult]: Loop: 1560#L1314-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1725#L156 assume !(0 != ~mode1~0 % 256); 1724#L192 assume !(~r1~0 < 2); 1575#L192-1 ~mode1~0 := 1; 1800#L156-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 1798#L220 assume !(0 != ~mode2~0 % 256); 1799#L256 assume !(~r2~0 < 3); 1719#L256-1 ~mode2~0 := 1; 1585#L220-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 1526#L284 assume !(0 != ~mode3~0 % 256); 1528#L320 assume !(~r3~0 < 3); 1659#L320-1 ~mode3~0 := 1; 1520#L284-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 1521#L348 assume !(0 != ~mode4~0 % 256); 1459#L384 assume !(~r4~0 < 3); 1460#L384-1 ~mode4~0 := 1; 1466#L348-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1736#L1181 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1735#L1182 assume ~st1~0 + ~nl1~0 <= 1; 1734#L1183 assume ~st2~0 + ~nl2~0 <= 1; 1733#L1184 assume ~st3~0 + ~nl3~0 <= 1; 1732#L1185 assume ~st4~0 + ~nl4~0 <= 1; 1730#L1186 assume !(~r1~0 >= 3); 1612#L1189 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 1613#L1190 assume ~r1~0 < 3; 1731#L1195 assume !(~r1~0 >= 3); 1433#L1199 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 1434#L1200 assume ~r1~0 < 3;check_~tmp~1 := 1; 1729#L1181-1 check_#res := check_~tmp~1; 1728#L1233 main_#t~ret57 := check_#res;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1727#L1357 assume !(0 == assert_~arg % 256); 1726#L1352 main_#t~post58 := main_~i2~0;main_~i2~0 := 1 + main_#t~post58;havoc main_#t~post58; 1560#L1314-2 [2019-01-02 00:09:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash 15555676, now seen corresponding path program 3 times [2019-01-02 00:09:51,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:51,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:51,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:51,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:51,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:51,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:51,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:51,227 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:09:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:51,229 INFO L82 PathProgramCache]: Analyzing trace with hash -282127580, now seen corresponding path program 1 times [2019-01-02 00:09:51,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:51,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:51,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:51,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:52,331 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 152 DAG size of output: 146 [2019-01-02 00:09:52,619 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2019-01-02 00:09:52,631 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:52,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:52,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:52,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:52,632 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:09:52,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:52,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:52,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:52,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:09:52,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:52,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:52,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:52,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:53,519 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-02 00:09:53,980 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-02 00:09:54,024 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:54,025 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:54,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:54,033 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:54,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:09:54,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:09:54,199 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:09:54,201 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:54,201 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:54,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:54,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:54,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:09:54,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:54,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:54,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:54,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:09:54,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:54,202 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:54,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:54,785 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-02 00:09:55,447 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-02 00:09:55,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:55,592 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:09:55,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:55,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:55,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:55,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:55,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:55,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:55,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:55,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:55,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:55,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:55,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:55,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:55,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:55,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:55,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:55,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:55,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:55,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:55,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:55,766 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:09:55,770 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:09:55,771 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:09:55,774 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:09:55,774 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:09:55,774 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:09:55,776 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2019-01-02 00:09:55,778 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:09:55,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:55,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:55,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:56,052 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:09:56,053 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 413 states and 717 transitions. cyclomatic complexity: 305 Second operand 3 states. [2019-01-02 00:09:56,198 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 413 states and 717 transitions. cyclomatic complexity: 305. Second operand 3 states. Result 631 states and 1074 transitions. Complement of second has 4 states. [2019-01-02 00:09:56,199 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 [2019-01-02 00:09:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:09:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2019-01-02 00:09:56,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 562 transitions. Stem has 53 letters. Loop has 32 letters. [2019-01-02 00:09:56,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:56,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 562 transitions. Stem has 85 letters. Loop has 32 letters. [2019-01-02 00:09:56,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:56,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 562 transitions. Stem has 53 letters. Loop has 64 letters. [2019-01-02 00:09:56,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:56,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 631 states and 1074 transitions. [2019-01-02 00:09:56,217 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:56,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 631 states to 0 states and 0 transitions. [2019-01-02 00:09:56,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:09:56,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:09:56,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:09:56,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:56,218 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:56,218 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:56,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:09:56,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:09:56,218 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-02 00:09:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:56,221 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:09:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:09:56,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:09:56,222 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:56,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:09:56,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:09:56,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:09:56,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:09:56,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:56,224 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:56,225 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:56,225 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:56,225 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:09:56,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:09:56,225 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:56,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:09:56,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:09:56 BoogieIcfgContainer [2019-01-02 00:09:56,235 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:09:56,235 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:09:56,235 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:09:56,235 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:09:56,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:48" (3/4) ... [2019-01-02 00:09:56,239 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:09:56,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:09:56,241 INFO L168 Benchmark]: Toolchain (without parser) took 10812.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -268.0 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:56,242 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:56,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:56,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:56,246 INFO L168 Benchmark]: Boogie Preprocessor took 64.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:56,247 INFO L168 Benchmark]: RCFGBuilder took 2656.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.9 MB). Peak memory consumption was 111.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:56,248 INFO L168 Benchmark]: BuchiAutomizer took 7286.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -208.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:56,249 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:56,256 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 692.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2656.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.9 MB). Peak memory consumption was 111.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7286.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -208.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.7s. Construction of modules took 0.4s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 413 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1837 SDtfs, 722 SDslu, 2449 SDs, 0 SdLazy, 36 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital199 mio100 ax124 hnf104 lsp28 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...