./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.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.3_false-unreach-call.2.ufo.BOUNDED-6.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 8a7b4ef7a8affb897157388e19dfe5e9a45c805e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:27,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:09:27,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:09:27,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:09:27,033 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:09:27,034 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:09:27,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:09:27,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:09:27,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:09:27,041 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:09:27,042 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:09:27,042 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:09:27,045 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:09:27,046 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:09:27,049 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:09:27,050 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:09:27,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:09:27,055 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:09:27,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:09:27,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:09:27,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:09:27,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:09:27,078 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:09:27,078 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:09:27,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:09:27,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:09:27,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:09:27,085 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:09:27,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:09:27,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:09:27,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:09:27,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:09:27,088 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:09:27,088 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:09:27,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:09:27,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:09:27,095 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:27,118 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:09:27,118 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:09:27,119 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:09:27,119 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:09:27,120 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:09:27,120 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:09:27,120 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:09:27,120 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:09:27,120 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:09:27,121 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:09:27,122 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:09:27,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:09:27,122 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:09:27,122 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:09:27,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:09:27,123 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:09:27,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:09:27,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:09:27,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:09:27,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:09:27,123 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:09:27,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:09:27,125 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:09:27,125 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:09:27,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:09:27,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:09:27,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:09:27,126 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:09:27,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:09:27,127 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:09:27,127 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:09:27,128 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:09:27,128 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 -> 8a7b4ef7a8affb897157388e19dfe5e9a45c805e [2019-01-02 00:09:27,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:09:27,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:09:27,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:09:27,190 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:09:27,190 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:09:27,191 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:09:27,247 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9d3b35f/99ea89254eb041bea5133ef6faf388e8/FLAGe14aaadcd [2019-01-02 00:09:27,771 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:09:27,772 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:09:27,784 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9d3b35f/99ea89254eb041bea5133ef6faf388e8/FLAGe14aaadcd [2019-01-02 00:09:28,037 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9d3b35f/99ea89254eb041bea5133ef6faf388e8 [2019-01-02 00:09:28,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:09:28,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:09:28,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:09:28,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:09:28,050 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:09:28,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:09:28" (1/1) ... [2019-01-02 00:09:28,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52419074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:28, skipping insertion in model container [2019-01-02 00:09:28,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:09:28" (1/1) ... [2019-01-02 00:09:28,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:09:28,128 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:09:28,451 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:09:28,463 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:09:28,588 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:09:28,609 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:09:28,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:28 WrapperNode [2019-01-02 00:09:28,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:09:28,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:09:28,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:09:28,611 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:09:28,697 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:28" (1/1) ... [2019-01-02 00:09:28,710 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:28" (1/1) ... [2019-01-02 00:09:28,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:09:28,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:09:28,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:09:28,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:09:28,768 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:28" (1/1) ... [2019-01-02 00:09:28,768 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:28" (1/1) ... [2019-01-02 00:09:28,772 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:28" (1/1) ... [2019-01-02 00:09:28,773 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:28" (1/1) ... [2019-01-02 00:09:28,783 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:28" (1/1) ... [2019-01-02 00:09:28,794 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:28" (1/1) ... [2019-01-02 00:09:28,798 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:28" (1/1) ... [2019-01-02 00:09:28,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:09:28,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:09:28,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:09:28,804 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:09:28,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:28" (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:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:09:28,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:09:30,175 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:09:30,175 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-02 00:09:30,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:30 BoogieIcfgContainer [2019-01-02 00:09:30,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:09:30,177 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:09:30,177 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:09:30,181 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:09:30,182 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:30,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:09:28" (1/3) ... [2019-01-02 00:09:30,183 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@533d3daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:09:30, skipping insertion in model container [2019-01-02 00:09:30,183 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:30,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:28" (2/3) ... [2019-01-02 00:09:30,184 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@533d3daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:09:30, skipping insertion in model container [2019-01-02 00:09:30,184 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:30,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:30" (3/3) ... [2019-01-02 00:09:30,186 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:09:30,247 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:09:30,248 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:09:30,248 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:09:30,248 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:09:30,249 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:09:30,249 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:09:30,249 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:09:30,249 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:09:30,250 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:09:30,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2019-01-02 00:09:30,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-02 00:09:30,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:30,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:30,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:30,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:30,328 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:09:30,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2019-01-02 00:09:30,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-02 00:09:30,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:30,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:30,344 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:30,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:30,353 INFO L794 eck$LassoCheckResult]: Stem: 101#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;~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;~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;~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;~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]; 10#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 49#L301true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 33#L304-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 88#L314true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 62#L317-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 121#L327true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 99#L330-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 11#L340true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 8#L343-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 58#L353true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 35#L356-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 92#L366true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 86#L369-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 140#L379true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 142#L379-1true init_#res := init_~tmp___5~0; 133#L500true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 96#L611-2true [2019-01-02 00:09:30,355 INFO L796 eck$LassoCheckResult]: Loop: 96#L611-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 70#L124true assume !(0 != ~mode1~0 % 256); 64#L152true assume !(~r1~0 < 2); 63#L152-1true ~mode1~0 := 1; 67#L124-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 3#L175true assume !(0 != ~mode2~0 % 256); 136#L203true assume !(~r2~0 < 2); 135#L203-1true ~mode2~0 := 1; 16#L175-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 85#L226true assume !(0 != ~mode3~0 % 256); 43#L254true assume !(~r3~0 < 2); 42#L254-1true ~mode3~0 := 1; 76#L226-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 15#L508true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 18#L508-1true check_#res := check_~tmp~1; 95#L556true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 112#L641true assume !(0 == assert_~arg % 256); 83#L636true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 96#L611-2true [2019-01-02 00:09:30,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:30,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2018293946, now seen corresponding path program 1 times [2019-01-02 00:09:30,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:30,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:30,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:30,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:30,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:30,730 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:30,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:30,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:30,740 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:09:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:30,740 INFO L82 PathProgramCache]: Analyzing trace with hash -752238638, now seen corresponding path program 1 times [2019-01-02 00:09:30,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:30,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:30,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:30,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:30,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:30,907 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:30,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:30,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:09:30,910 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:30,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:09:30,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:09:30,930 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 4 states. [2019-01-02 00:09:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:31,117 INFO L93 Difference]: Finished difference Result 142 states and 243 transitions. [2019-01-02 00:09:31,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:09:31,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 243 transitions. [2019-01-02 00:09:31,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-02 00:09:31,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 135 states and 207 transitions. [2019-01-02 00:09:31,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2019-01-02 00:09:31,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-01-02 00:09:31,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 207 transitions. [2019-01-02 00:09:31,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:31,138 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 207 transitions. [2019-01-02 00:09:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 207 transitions. [2019-01-02 00:09:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-02 00:09:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-02 00:09:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 207 transitions. [2019-01-02 00:09:31,183 INFO L728 BuchiCegarLoop]: Abstraction has 135 states and 207 transitions. [2019-01-02 00:09:31,183 INFO L608 BuchiCegarLoop]: Abstraction has 135 states and 207 transitions. [2019-01-02 00:09:31,183 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:09:31,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 207 transitions. [2019-01-02 00:09:31,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-02 00:09:31,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:31,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:31,189 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] [2019-01-02 00:09:31,189 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:31,190 INFO L794 eck$LassoCheckResult]: Stem: 420#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;~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;~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;~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;~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]; 314#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 315#L301 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 356#L304-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 358#L314 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 318#L317-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 396#L327 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 393#L330-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 316#L340 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 306#L343-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 307#L353 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 361#L356-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 362#L366 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 349#L369-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 414#L379 assume ~id1~0 != ~id2~0; 411#L380 assume ~id1~0 != ~id3~0; 345#L381 assume ~id2~0 != ~id3~0; 346#L382 assume ~id1~0 >= 0; 404#L383 assume ~id2~0 >= 0; 337#L384 assume ~id3~0 >= 0; 338#L385 assume 0 == ~r1~0; 391#L386 assume 0 == ~r2~0; 302#L387 assume 0 == ~r3~0; 303#L388 assume 0 != init_~r122~0 % 256; 384#L389 assume 0 != init_~r132~0 % 256; 385#L390 assume 0 != init_~r212~0 % 256; 407#L391 assume 0 != init_~r232~0 % 256; 343#L392 assume 0 != init_~r312~0 % 256; 344#L393 assume 0 != init_~r322~0 % 256; 403#L394 assume ~max1~0 == ~id1~0; 335#L395 assume ~max2~0 == ~id2~0; 336#L396 assume ~max3~0 == ~id3~0; 390#L397 assume 0 == ~st1~0; 300#L398 assume 0 == ~st2~0; 301#L399 assume 0 == ~st3~0; 382#L400 assume 0 == ~nl1~0; 383#L401 assume 0 == ~nl2~0; 406#L402 assume 0 == ~nl3~0; 341#L403 assume 0 == ~mode1~0 % 256; 342#L404 assume 0 == ~mode2~0 % 256; 402#L405 assume 0 == ~mode3~0 % 256; 333#L406 assume 0 != ~newmax1~0 % 256; 334#L407 assume 0 != ~newmax2~0 % 256; 386#L408 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 387#L379-1 init_#res := init_~tmp___5~0; 431#L500 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 410#L611-2 [2019-01-02 00:09:31,190 INFO L796 eck$LassoCheckResult]: Loop: 410#L611-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 400#L124 assume !(0 != ~mode1~0 % 256); 398#L152 assume !(~r1~0 < 2); 326#L152-1 ~mode1~0 := 1; 397#L124-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 297#L175 assume !(0 != ~mode2~0 % 256); 298#L203 assume !(~r2~0 < 2); 371#L203-1 ~mode2~0 := 1; 322#L175-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 323#L226 assume !(0 != ~mode3~0 % 256); 374#L254 assume !(~r3~0 < 2); 372#L254-1 ~mode3~0 := 1; 373#L226-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 320#L508 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 310#L508-1 check_#res := check_~tmp~1; 324#L556 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 418#L641 assume !(0 == assert_~arg % 256); 409#L636 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 410#L611-2 [2019-01-02 00:09:31,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:31,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1207151116, now seen corresponding path program 1 times [2019-01-02 00:09:31,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:31,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash -752238638, now seen corresponding path program 2 times [2019-01-02 00:09:31,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:31,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:31,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:31,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:31,699 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:31,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:31,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:09:31,700 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:31,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:09:31,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:09:31,701 INFO L87 Difference]: Start difference. First operand 135 states and 207 transitions. cyclomatic complexity: 73 Second operand 5 states. [2019-01-02 00:09:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:31,914 INFO L93 Difference]: Finished difference Result 138 states and 209 transitions. [2019-01-02 00:09:31,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:09:31,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 209 transitions. [2019-01-02 00:09:31,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-02 00:09:31,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 135 states and 199 transitions. [2019-01-02 00:09:31,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2019-01-02 00:09:31,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-01-02 00:09:31,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 199 transitions. [2019-01-02 00:09:31,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:31,924 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 199 transitions. [2019-01-02 00:09:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 199 transitions. [2019-01-02 00:09:31,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-02 00:09:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-02 00:09:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2019-01-02 00:09:31,937 INFO L728 BuchiCegarLoop]: Abstraction has 135 states and 199 transitions. [2019-01-02 00:09:31,937 INFO L608 BuchiCegarLoop]: Abstraction has 135 states and 199 transitions. [2019-01-02 00:09:31,937 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:09:31,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 199 transitions. [2019-01-02 00:09:31,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-02 00:09:31,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:31,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:31,943 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] [2019-01-02 00:09:31,943 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] [2019-01-02 00:09:31,944 INFO L794 eck$LassoCheckResult]: Stem: 705#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;~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;~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;~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;~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]; 598#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 599#L301 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 641#L304-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 643#L314 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 602#L317-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 681#L327 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 678#L330-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 600#L340 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 591#L343-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 592#L353 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 646#L356-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 651#L366 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 634#L369-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 699#L379 assume ~id1~0 != ~id2~0; 696#L380 assume ~id1~0 != ~id3~0; 630#L381 assume ~id2~0 != ~id3~0; 631#L382 assume ~id1~0 >= 0; 689#L383 assume ~id2~0 >= 0; 622#L384 assume ~id3~0 >= 0; 623#L385 assume 0 == ~r1~0; 676#L386 assume 0 == ~r2~0; 587#L387 assume 0 == ~r3~0; 588#L388 assume 0 != init_~r122~0 % 256; 669#L389 assume 0 != init_~r132~0 % 256; 670#L390 assume 0 != init_~r212~0 % 256; 693#L391 assume 0 != init_~r232~0 % 256; 628#L392 assume 0 != init_~r312~0 % 256; 629#L393 assume 0 != init_~r322~0 % 256; 688#L394 assume ~max1~0 == ~id1~0; 620#L395 assume ~max2~0 == ~id2~0; 621#L396 assume ~max3~0 == ~id3~0; 675#L397 assume 0 == ~st1~0; 585#L398 assume 0 == ~st2~0; 586#L399 assume 0 == ~st3~0; 667#L400 assume 0 == ~nl1~0; 668#L401 assume 0 == ~nl2~0; 691#L402 assume 0 == ~nl3~0; 626#L403 assume 0 == ~mode1~0 % 256; 627#L404 assume 0 == ~mode2~0 % 256; 687#L405 assume 0 == ~mode3~0 % 256; 618#L406 assume 0 != ~newmax1~0 % 256; 619#L407 assume 0 != ~newmax2~0 % 256; 671#L408 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 672#L379-1 init_#res := init_~tmp___5~0; 716#L500 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 695#L611-2 [2019-01-02 00:09:31,945 INFO L796 eck$LassoCheckResult]: Loop: 695#L611-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 685#L124 assume !(0 != ~mode1~0 % 256); 683#L152 assume !(~r1~0 < 2); 611#L152-1 ~mode1~0 := 1; 682#L124-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 582#L175 assume !(0 != ~mode2~0 % 256); 583#L203 assume !(~r2~0 < 2); 656#L203-1 ~mode2~0 := 1; 607#L175-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 608#L226 assume !(0 != ~mode3~0 % 256); 659#L254 assume !(~r3~0 < 2); 657#L254-1 ~mode3~0 := 1; 658#L226-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 605#L508 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 606#L509 assume ~st1~0 + ~nl1~0 <= 1; 663#L510 assume ~st2~0 + ~nl2~0 <= 1; 593#L511 assume ~st3~0 + ~nl3~0 <= 1; 594#L512 assume ~r1~0 >= 2; 615#L516 assume ~r1~0 < 2; 616#L521 assume ~r1~0 >= 2; 661#L526 assume ~r1~0 < 2;check_~tmp~1 := 1; 604#L508-1 check_#res := check_~tmp~1; 609#L556 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 703#L641 assume !(0 == assert_~arg % 256); 694#L636 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 695#L611-2 [2019-01-02 00:09:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1207151116, now seen corresponding path program 2 times [2019-01-02 00:09:31,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:31,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:31,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:31,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:31,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:32,059 INFO L82 PathProgramCache]: Analyzing trace with hash 803863027, now seen corresponding path program 1 times [2019-01-02 00:09:32,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:32,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:32,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:32,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:32,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:32,119 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:32,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:32,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:32,120 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:09:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:09:32,121 INFO L87 Difference]: Start difference. First operand 135 states and 199 transitions. cyclomatic complexity: 65 Second operand 3 states. [2019-01-02 00:09:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:32,241 INFO L93 Difference]: Finished difference Result 192 states and 285 transitions. [2019-01-02 00:09:32,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:09:32,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 285 transitions. [2019-01-02 00:09:32,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 134 [2019-01-02 00:09:32,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 285 transitions. [2019-01-02 00:09:32,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2019-01-02 00:09:32,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2019-01-02 00:09:32,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 285 transitions. [2019-01-02 00:09:32,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:32,250 INFO L705 BuchiCegarLoop]: Abstraction has 192 states and 285 transitions. [2019-01-02 00:09:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 285 transitions. [2019-01-02 00:09:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-01-02 00:09:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-02 00:09:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 285 transitions. [2019-01-02 00:09:32,262 INFO L728 BuchiCegarLoop]: Abstraction has 192 states and 285 transitions. [2019-01-02 00:09:32,262 INFO L608 BuchiCegarLoop]: Abstraction has 192 states and 285 transitions. [2019-01-02 00:09:32,262 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:09:32,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 285 transitions. [2019-01-02 00:09:32,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 134 [2019-01-02 00:09:32,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:32,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:32,266 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] [2019-01-02 00:09:32,267 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] [2019-01-02 00:09:32,267 INFO L794 eck$LassoCheckResult]: Stem: 1041#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;~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;~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;~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;~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]; 931#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 932#L301 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 973#L304-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 975#L314 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 935#L317-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1014#L327 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 1010#L330-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 933#L340 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 924#L343-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 925#L353 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 978#L356-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 983#L366 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 966#L369-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1034#L379 assume ~id1~0 != ~id2~0; 1031#L380 assume ~id1~0 != ~id3~0; 962#L381 assume ~id2~0 != ~id3~0; 963#L382 assume ~id1~0 >= 0; 1023#L383 assume ~id2~0 >= 0; 954#L384 assume ~id3~0 >= 0; 955#L385 assume 0 == ~r1~0; 1008#L386 assume 0 == ~r2~0; 920#L387 assume 0 == ~r3~0; 921#L388 assume 0 != init_~r122~0 % 256; 1001#L389 assume 0 != init_~r132~0 % 256; 1002#L390 assume 0 != init_~r212~0 % 256; 1028#L391 assume 0 != init_~r232~0 % 256; 960#L392 assume 0 != init_~r312~0 % 256; 961#L393 assume 0 != init_~r322~0 % 256; 1022#L394 assume ~max1~0 == ~id1~0; 952#L395 assume ~max2~0 == ~id2~0; 953#L396 assume ~max3~0 == ~id3~0; 1007#L397 assume 0 == ~st1~0; 918#L398 assume 0 == ~st2~0; 919#L399 assume 0 == ~st3~0; 999#L400 assume 0 == ~nl1~0; 1000#L401 assume 0 == ~nl2~0; 1026#L402 assume 0 == ~nl3~0; 958#L403 assume 0 == ~mode1~0 % 256; 959#L404 assume 0 == ~mode2~0 % 256; 1021#L405 assume 0 == ~mode3~0 % 256; 950#L406 assume 0 != ~newmax1~0 % 256; 951#L407 assume 0 != ~newmax2~0 % 256; 1003#L408 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 1004#L379-1 init_#res := init_~tmp___5~0; 1055#L500 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 1030#L611-2 [2019-01-02 00:09:32,267 INFO L796 eck$LassoCheckResult]: Loop: 1030#L611-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1039#L124 assume !(0 != ~mode1~0 % 256); 1056#L152 assume ~r1~0 < 2; 946#L153 assume !(0 != ~ep12~0 % 256); 942#L153-1 assume !(0 != ~ep13~0 % 256); 943#L152-1 ~mode1~0 := 1; 1013#L124-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 915#L175 assume !(0 != ~mode2~0 % 256); 916#L203 assume !(~r2~0 < 2); 988#L203-1 ~mode2~0 := 1; 940#L175-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 941#L226 assume !(0 != ~mode3~0 % 256); 991#L254 assume !(~r3~0 < 2); 989#L254-1 ~mode3~0 := 1; 990#L226-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1025#L508 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1060#L509 assume ~st1~0 + ~nl1~0 <= 1; 1059#L510 assume ~st2~0 + ~nl2~0 <= 1; 1058#L511 assume ~st3~0 + ~nl3~0 <= 1; 1057#L512 assume !(~r1~0 >= 2); 1017#L515 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1018#L516 assume ~r1~0 < 2; 1103#L521 assume !(~r1~0 >= 2); 1052#L525 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1053#L526 assume ~r1~0 < 2;check_~tmp~1 := 1; 1106#L508-1 check_#res := check_~tmp~1; 1105#L556 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1104#L641 assume !(0 == assert_~arg % 256); 1029#L636 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 1030#L611-2 [2019-01-02 00:09:32,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:32,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1207151116, now seen corresponding path program 3 times [2019-01-02 00:09:32,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:32,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:32,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:32,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:32,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:32,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1551151390, now seen corresponding path program 1 times [2019-01-02 00:09:32,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:32,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:32,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:32,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:32,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:32,426 INFO L82 PathProgramCache]: Analyzing trace with hash 247768819, now seen corresponding path program 1 times [2019-01-02 00:09:32,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:32,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:32,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:32,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:32,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:32,575 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:32,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:32,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:33,068 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2019-01-02 00:09:33,316 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-01-02 00:09:33,330 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:33,332 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:33,332 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:33,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:33,332 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:09:33,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:33,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:33,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:33,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2019-01-02 00:09:33,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:33,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:33,359 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:33,367 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:33,392 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:33,399 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:33,424 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:33,427 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:33,435 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:33,440 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:33,445 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:33,448 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:33,453 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:33,456 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:33,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:33,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:33,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:33,470 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:33,488 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:33,497 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:33,503 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:33,532 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:33,536 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:33,541 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:33,546 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:33,549 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:33,555 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:33,558 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:33,563 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:33,565 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:33,665 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:34,413 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:34,414 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:34,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:34,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:09:34,450 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:09:34,450 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-256} Honda state: {~ep12~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-01-02 00:09:34,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:34,485 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:34,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:09:34,515 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:09:34,682 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:09:34,684 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:34,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:34,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:34,684 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:34,685 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:09:34,685 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:34,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:34,685 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:34,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2019-01-02 00:09:34,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:34,685 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:34,690 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:34,700 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:34,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:34,737 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:34,753 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:34,756 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:34,759 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:34,766 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:34,769 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:34,772 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:34,776 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:34,778 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:34,814 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:34,844 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:34,870 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:34,892 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:34,897 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:34,912 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:34,918 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:34,948 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:34,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:34,954 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:34,964 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:34,968 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:34,969 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:34,971 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:34,974 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:34,982 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:35,108 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-02 00:09:35,108 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:35,800 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-02 00:09:36,069 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:36,076 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:09:36,078 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:36,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,087 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:36,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,096 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:36,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:36,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:36,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,108 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:36,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,118 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:36,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,131 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:36,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:36,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:36,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,147 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:36,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,154 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:36,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,160 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:36,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,166 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:36,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,172 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:36,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,177 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:36,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,184 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:36,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,190 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:36,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,195 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:36,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:36,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:36,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,205 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:36,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:36,212 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:36,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:36,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:36,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:36,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:36,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:36,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:36,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:36,219 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:09:36,222 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:09:36,222 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:09:36,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:09:36,224 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:09:36,225 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:09:36,225 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2019-01-02 00:09:36,226 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:09:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:36,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:36,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:36,499 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:36,506 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:36,507 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 192 states and 285 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-01-02 00:09:36,619 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 192 states and 285 transitions. cyclomatic complexity: 94. Second operand 3 states. Result 325 states and 494 transitions. Complement of second has 4 states. [2019-01-02 00:09:36,621 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:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:09:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2019-01-02 00:09:36,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 46 letters. Loop has 29 letters. [2019-01-02 00:09:36,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:36,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 75 letters. Loop has 29 letters. [2019-01-02 00:09:36,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:36,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 46 letters. Loop has 58 letters. [2019-01-02 00:09:36,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:36,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 494 transitions. [2019-01-02 00:09:36,641 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:36,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 0 states and 0 transitions. [2019-01-02 00:09:36,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:09:36,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:09:36,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:09:36,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:36,642 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:36,642 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:09:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:09:36,642 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-02 00:09:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:36,642 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:09:36,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:09:36,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:09:36,646 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:36,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:09:36,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:09:36,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:09:36,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:09:36,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:36,648 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:36,648 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:36,648 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:36,648 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:09:36,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:09:36,649 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:36,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:09:36,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:09:36 BoogieIcfgContainer [2019-01-02 00:09:36,659 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:09:36,659 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:09:36,659 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:09:36,659 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:09:36,660 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:30" (3/4) ... [2019-01-02 00:09:36,663 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:09:36,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:09:36,664 INFO L168 Benchmark]: Toolchain (without parser) took 8622.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.4 MB). Free memory was 947.3 MB in the beginning and 975.4 MB in the end (delta: -28.1 MB). Peak memory consumption was 174.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:36,665 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:36,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.42 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:36,666 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:36,668 INFO L168 Benchmark]: Boogie Preprocessor took 50.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:36,669 INFO L168 Benchmark]: RCFGBuilder took 1372.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:36,671 INFO L168 Benchmark]: BuchiAutomizer took 6481.84 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.7 MB). Free memory was 1.0 GB in the beginning and 975.4 MB in the end (delta: 68.1 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:36,671 INFO L168 Benchmark]: Witness Printer took 4.11 ms. Allocated memory is still 1.2 GB. Free memory is still 975.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:36,678 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 566.42 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 140.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1372.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6481.84 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.7 MB). Free memory was 1.0 GB in the beginning and 975.4 MB in the end (delta: 68.1 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.11 ms. Allocated memory is still 1.2 GB. Free memory is still 975.4 MB. There was no memory consumed. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 5.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 192 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 840 SDtfs, 393 SDslu, 1353 SDs, 0 SdLazy, 40 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital148 mio100 ax124 hnf104 lsp19 ukn100 mio100 lsp100 div128 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...