./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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_lcr.3_true-unreach-call.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 a90b25a4abf3a535ee7c4ba6368944b8e32b5ef5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:08:13,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:08:13,129 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:08:13,147 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:08:13,147 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:08:13,148 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:08:13,150 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:08:13,153 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:08:13,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:08:13,162 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:08:13,162 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:08:13,163 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:08:13,163 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:08:13,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:08:13,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:08:13,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:08:13,176 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:08:13,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:08:13,186 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:08:13,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:08:13,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:08:13,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:08:13,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:08:13,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:08:13,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:08:13,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:08:13,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:08:13,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:08:13,197 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:08:13,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:08:13,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:08:13,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:08:13,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:08:13,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:08:13,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:08:13,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:08:13,207 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:08:13,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:08:13,235 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:08:13,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:08:13,238 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:08:13,238 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:08:13,238 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:08:13,239 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:08:13,239 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:08:13,239 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:08:13,239 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:08:13,239 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:08:13,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:08:13,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:08:13,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:08:13,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:08:13,240 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:08:13,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:08:13,240 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:08:13,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:08:13,241 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:08:13,242 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:08:13,242 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:08:13,242 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:08:13,242 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:08:13,242 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:08:13,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:08:13,243 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:08:13,243 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:08:13,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:08:13,244 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:08:13,244 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:08:13,245 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:08:13,245 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 -> a90b25a4abf3a535ee7c4ba6368944b8e32b5ef5 [2018-11-29 00:08:13,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:08:13,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:08:13,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:08:13,310 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:08:13,311 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:08:13,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-29 00:08:13,377 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d96596998/6997a8f66cfc4be0931f024e7e6c148f/FLAG08dbc87ea [2018-11-29 00:08:13,936 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:08:13,937 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-29 00:08:13,947 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d96596998/6997a8f66cfc4be0931f024e7e6c148f/FLAG08dbc87ea [2018-11-29 00:08:14,191 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d96596998/6997a8f66cfc4be0931f024e7e6c148f [2018-11-29 00:08:14,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:08:14,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:08:14,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:08:14,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:08:14,204 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:08:14,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbc0696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14, skipping insertion in model container [2018-11-29 00:08:14,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:08:14,262 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:08:14,608 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:08:14,622 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:08:14,669 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:08:14,688 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:08:14,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14 WrapperNode [2018-11-29 00:08:14,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:08:14,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:08:14,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:08:14,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:08:14,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:08:14,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:08:14,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:08:14,821 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:08:14,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (1/1) ... [2018-11-29 00:08:14,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:08:14,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:08:14,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:08:14,867 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:08:14,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (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 [2018-11-29 00:08:14,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:08:14,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:08:15,694 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:08:15,694 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-29 00:08:15,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:08:15 BoogieIcfgContainer [2018-11-29 00:08:15,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:08:15,696 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:08:15,696 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:08:15,699 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:08:15,700 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:08:15,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:08:14" (1/3) ... [2018-11-29 00:08:15,701 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25adf70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:08:15, skipping insertion in model container [2018-11-29 00:08:15,702 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:08:15,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:14" (2/3) ... [2018-11-29 00:08:15,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25adf70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:08:15, skipping insertion in model container [2018-11-29 00:08:15,702 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:08:15,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:08:15" (3/3) ... [2018-11-29 00:08:15,704 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-29 00:08:15,765 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:08:15,766 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:08:15,766 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:08:15,766 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:08:15,767 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:08:15,767 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:08:15,767 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:08:15,767 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:08:15,767 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:08:15,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2018-11-29 00:08:15,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-29 00:08:15,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:15,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:15,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:08:15,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:08:15,823 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:08:15,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2018-11-29 00:08:15,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-29 00:08:15,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:15,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:15,830 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:08:15,830 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:08:15,839 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~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]; 13#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 3#L175true assume !(0 == ~r1~0);init_~tmp~0 := 0; 21#L175-1true init_#res := init_~tmp~0; 53#L240true main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 33#L300-2true [2018-11-29 00:08:15,840 INFO L796 eck$LassoCheckResult]: Loop: 33#L300-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 40#L99true assume !(0 != ~mode1~0 % 256); 6#L113true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 4#L113-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 37#L99-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 29#L125true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 35#L128true assume !(node2_~m2~0 != ~nomsg~0); 32#L128-1true ~mode2~0 := 0; 25#L125-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 36#L150true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 22#L153true assume !(node3_~m3~0 != ~nomsg~0); 18#L153-1true ~mode3~0 := 0; 12#L150-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 19#L248true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 17#L248-1true check_#res := check_~tmp~1; 50#L268true main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 52#L324true assume !(0 == assert_~arg % 256); 46#L319true main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 33#L300-2true [2018-11-29 00:08:15,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:15,846 INFO L82 PathProgramCache]: Analyzing trace with hash 28785120, now seen corresponding path program 1 times [2018-11-29 00:08:15,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:15,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:15,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:15,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:08:16,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:16,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:08:16,122 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:08:16,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2127129926, now seen corresponding path program 1 times [2018-11-29 00:08:16,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:16,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:08:16,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:16,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:08:16,341 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:08:16,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:08:16,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:08:16,363 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 4 states. [2018-11-29 00:08:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:16,491 INFO L93 Difference]: Finished difference Result 61 states and 96 transitions. [2018-11-29 00:08:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:08:16,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 96 transitions. [2018-11-29 00:08:16,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-29 00:08:16,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 54 states and 74 transitions. [2018-11-29 00:08:16,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-29 00:08:16,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-29 00:08:16,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 74 transitions. [2018-11-29 00:08:16,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:16,509 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2018-11-29 00:08:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 74 transitions. [2018-11-29 00:08:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-29 00:08:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-29 00:08:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2018-11-29 00:08:16,547 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2018-11-29 00:08:16,547 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2018-11-29 00:08:16,547 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:08:16,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 74 transitions. [2018-11-29 00:08:16,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-29 00:08:16,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:16,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:16,551 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] [2018-11-29 00:08:16,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:08:16,552 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~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]; 153#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 135#L175 assume 0 == ~r1~0; 136#L176 assume ~id1~0 >= 0; 163#L177 assume 0 == ~st1~0; 182#L178 assume ~send1~0 == ~id1~0; 147#L179 assume 0 == ~mode1~0 % 256; 148#L180 assume ~id2~0 >= 0; 173#L181 assume 0 == ~st2~0; 156#L182 assume ~send2~0 == ~id2~0; 157#L183 assume 0 == ~mode2~0 % 256; 180#L184 assume ~id3~0 >= 0; 187#L185 assume 0 == ~st3~0; 139#L186 assume ~send3~0 == ~id3~0; 140#L187 assume 0 == ~mode3~0 % 256; 164#L188 assume ~id1~0 != ~id2~0; 183#L189 assume ~id1~0 != ~id3~0; 149#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 150#L175-1 init_#res := init_~tmp~0; 160#L240 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 175#L300-2 [2018-11-29 00:08:16,552 INFO L796 eck$LassoCheckResult]: Loop: 175#L300-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 176#L99 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 168#L103 assume !(node1_~m1~0 != ~nomsg~0); 167#L103-1 ~mode1~0 := 0; 138#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 171#L125 assume !(0 != ~mode2~0 % 256); 154#L138 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 155#L138-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 165#L125-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 166#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 161#L153 assume !(node3_~m3~0 != ~nomsg~0); 146#L153-1 ~mode3~0 := 0; 151#L150-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 152#L248 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 143#L248-1 check_#res := check_~tmp~1; 158#L268 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 186#L324 assume !(0 == assert_~arg % 256); 185#L319 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 175#L300-2 [2018-11-29 00:08:16,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 1 times [2018-11-29 00:08:16,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:16,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:16,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:16,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:16,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash -235759546, now seen corresponding path program 1 times [2018-11-29 00:08:16,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:16,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:16,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:16,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:08:16,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:16,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:08:16,775 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:08:16,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:08:16,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:08:16,776 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-29 00:08:16,949 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-29 00:08:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:16,964 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2018-11-29 00:08:16,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:08:16,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 76 transitions. [2018-11-29 00:08:16,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-29 00:08:16,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 54 states and 71 transitions. [2018-11-29 00:08:16,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-29 00:08:16,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-29 00:08:16,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 71 transitions. [2018-11-29 00:08:16,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:16,974 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2018-11-29 00:08:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 71 transitions. [2018-11-29 00:08:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-29 00:08:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-29 00:08:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2018-11-29 00:08:16,984 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2018-11-29 00:08:16,984 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2018-11-29 00:08:16,984 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:08:16,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 71 transitions. [2018-11-29 00:08:16,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-29 00:08:16,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:16,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:16,989 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] [2018-11-29 00:08:16,989 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] [2018-11-29 00:08:16,990 INFO L794 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~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]; 275#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 258#L175 assume 0 == ~r1~0; 259#L176 assume ~id1~0 >= 0; 286#L177 assume 0 == ~st1~0; 305#L178 assume ~send1~0 == ~id1~0; 269#L179 assume 0 == ~mode1~0 % 256; 270#L180 assume ~id2~0 >= 0; 296#L181 assume 0 == ~st2~0; 278#L182 assume ~send2~0 == ~id2~0; 279#L183 assume 0 == ~mode2~0 % 256; 303#L184 assume ~id3~0 >= 0; 310#L185 assume 0 == ~st3~0; 262#L186 assume ~send3~0 == ~id3~0; 263#L187 assume 0 == ~mode3~0 % 256; 287#L188 assume ~id1~0 != ~id2~0; 306#L189 assume ~id1~0 != ~id3~0; 271#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 272#L175-1 init_#res := init_~tmp~0; 283#L240 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 298#L300-2 [2018-11-29 00:08:16,990 INFO L796 eck$LassoCheckResult]: Loop: 298#L300-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 299#L99 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 291#L103 assume !(node1_~m1~0 != ~nomsg~0); 290#L103-1 ~mode1~0 := 0; 261#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 293#L125 assume !(0 != ~mode2~0 % 256); 276#L138 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 277#L138-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 288#L125-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 289#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 284#L153 assume !(node3_~m3~0 != ~nomsg~0); 268#L153-1 ~mode3~0 := 0; 273#L150-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 274#L248 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 282#L249 assume ~r1~0 >= 3; 266#L253 assume ~r1~0 < 3;check_~tmp~1 := 1; 280#L248-1 check_#res := check_~tmp~1; 281#L268 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 309#L324 assume !(0 == assert_~arg % 256); 308#L319 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 298#L300-2 [2018-11-29 00:08:16,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 2 times [2018-11-29 00:08:16,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:16,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:16,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:16,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:17,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:17,036 INFO L82 PathProgramCache]: Analyzing trace with hash -347480874, now seen corresponding path program 1 times [2018-11-29 00:08:17,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:17,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:17,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:17,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:08:17,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:08:17,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:17,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:08:17,096 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:08:17,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:08:17,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:08:17,096 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-11-29 00:08:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:17,207 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2018-11-29 00:08:17,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:08:17,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 111 transitions. [2018-11-29 00:08:17,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-29 00:08:17,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 111 transitions. [2018-11-29 00:08:17,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-11-29 00:08:17,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-11-29 00:08:17,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 111 transitions. [2018-11-29 00:08:17,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:17,219 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. [2018-11-29 00:08:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 111 transitions. [2018-11-29 00:08:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-29 00:08:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-29 00:08:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2018-11-29 00:08:17,230 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. [2018-11-29 00:08:17,230 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. [2018-11-29 00:08:17,231 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:08:17,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 111 transitions. [2018-11-29 00:08:17,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-29 00:08:17,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:17,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:17,235 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] [2018-11-29 00:08:17,235 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] [2018-11-29 00:08:17,235 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~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]; 417#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 400#L175 assume 0 == ~r1~0; 401#L176 assume ~id1~0 >= 0; 428#L177 assume 0 == ~st1~0; 451#L178 assume ~send1~0 == ~id1~0; 411#L179 assume 0 == ~mode1~0 % 256; 412#L180 assume ~id2~0 >= 0; 440#L181 assume 0 == ~st2~0; 420#L182 assume ~send2~0 == ~id2~0; 421#L183 assume 0 == ~mode2~0 % 256; 448#L184 assume ~id3~0 >= 0; 456#L185 assume 0 == ~st3~0; 404#L186 assume ~send3~0 == ~id3~0; 405#L187 assume 0 == ~mode3~0 % 256; 431#L188 assume ~id1~0 != ~id2~0; 452#L189 assume ~id1~0 != ~id3~0; 413#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 414#L175-1 init_#res := init_~tmp~0; 425#L240 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 457#L300-2 [2018-11-29 00:08:17,235 INFO L796 eck$LassoCheckResult]: Loop: 457#L300-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 477#L99 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 434#L103 assume !(node1_~m1~0 != ~nomsg~0); 432#L103-1 ~mode1~0 := 0; 433#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 474#L125 assume !(0 != ~mode2~0 % 256); 470#L138 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 469#L138-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 467#L125-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 446#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 426#L153 assume !(node3_~m3~0 != ~nomsg~0); 410#L153-1 ~mode3~0 := 0; 415#L150-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 416#L248 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 424#L249 assume !(~r1~0 >= 3); 407#L252 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 408#L253 assume ~r1~0 < 3;check_~tmp~1 := 1; 481#L248-1 check_#res := check_~tmp~1; 480#L268 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 479#L324 assume !(0 == assert_~arg % 256); 478#L319 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 457#L300-2 [2018-11-29 00:08:17,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 3 times [2018-11-29 00:08:17,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:17,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:17,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:17,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:17,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:17,316 INFO L82 PathProgramCache]: Analyzing trace with hash -535400680, now seen corresponding path program 1 times [2018-11-29 00:08:17,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:17,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:17,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:17,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:08:17,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:17,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:17,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1845919716, now seen corresponding path program 1 times [2018-11-29 00:08:17,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:17,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:17,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:08:17,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:17,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:08:18,203 WARN L180 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2018-11-29 00:08:19,802 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-11-29 00:08:19,817 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:08:19,818 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:08:19,818 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:08:19,819 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:08:19,819 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:08:19,819 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:08:19,819 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:08:19,819 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:08:19,819 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-29 00:08:19,819 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:08:19,820 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:08:19,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:19,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:19,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:19,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:19,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:19,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,133 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-29 00:08:20,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:20,448 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-29 00:08:21,430 WARN L180 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-11-29 00:08:21,571 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:08:21,573 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 [2018-11-29 00:08:21,581 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:08:21,582 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:08:21,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:08:21,612 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:08:21,718 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:08:21,721 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:08:21,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:08:21,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:08:21,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:08:21,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:08:21,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:08:21,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:08:21,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:08:21,722 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-29 00:08:21,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:08:21,722 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:08:21,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:21,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:21,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:21,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:21,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:21,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,336 WARN L180 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-29 00:08:22,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,598 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-29 00:08:22,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:08:22,970 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-29 00:08:23,090 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-29 00:08:24,224 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-11-29 00:08:24,362 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:08:24,368 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:08:24,369 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 [2018-11-29 00:08:24,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:24,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:24,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:24,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:24,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:24,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:24,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:24,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:24,378 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 [2018-11-29 00:08:24,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:24,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:24,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:24,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:24,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:24,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:24,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:24,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:24,386 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 [2018-11-29 00:08:24,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:24,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:24,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:24,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:24,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:24,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:24,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:24,392 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:08:24,400 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:08:24,400 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:08:24,402 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:08:24,402 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:08:24,402 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:08:24,404 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-11-29 00:08:24,406 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:08:24,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:24,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:08:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:24,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:08:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:08:24,582 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 [2018-11-29 00:08:24,583 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 111 transitions. cyclomatic complexity: 30 Second operand 3 states. [2018-11-29 00:08:24,642 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 111 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 143 states and 202 transitions. Complement of second has 4 states. [2018-11-29 00:08:24,646 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 [2018-11-29 00:08:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:08:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-29 00:08:24,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 20 letters. Loop has 21 letters. [2018-11-29 00:08:24,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:08:24,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 41 letters. Loop has 21 letters. [2018-11-29 00:08:24,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:08:24,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 20 letters. Loop has 42 letters. [2018-11-29 00:08:24,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:08:24,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 202 transitions. [2018-11-29 00:08:24,658 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:08:24,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 0 states and 0 transitions. [2018-11-29 00:08:24,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:08:24,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:08:24,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:08:24,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:24,659 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:24,659 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:24,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:08:24,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:08:24,661 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-29 00:08:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:24,662 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:08:24,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:08:24,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:08:24,662 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:08:24,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:08:24,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:08:24,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:08:24,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:08:24,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:24,665 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:24,665 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:24,665 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:24,665 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:08:24,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:08:24,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:08:24,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:08:24,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:08:24 BoogieIcfgContainer [2018-11-29 00:08:24,673 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:08:24,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:08:24,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:08:24,674 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:08:24,674 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:08:15" (3/4) ... [2018-11-29 00:08:24,679 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:08:24,679 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:08:24,680 INFO L168 Benchmark]: Toolchain (without parser) took 10483.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.9 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 133.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:24,682 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:08:24,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:24,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:24,685 INFO L168 Benchmark]: Boogie Preprocessor took 45.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:24,687 INFO L168 Benchmark]: RCFGBuilder took 828.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:24,688 INFO L168 Benchmark]: BuchiAutomizer took 8977.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.3 MB). Peak memory consumption was 137.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:24,689 INFO L168 Benchmark]: Witness Printer took 5.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:08:24,695 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 490.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 828.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8977.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.3 MB). Peak memory consumption was 137.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 8.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 8.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. 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 82 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 338 SDtfs, 161 SDslu, 488 SDs, 0 SdLazy, 32 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital474 mio100 ax107 hnf101 lsp16 ukn72 mio100 lsp100 div152 bol100 ite100 ukn100 eq177 hnf71 smp100 dnf670 smp48 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...