./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.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_false-unreach-call.1.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 21f67d0148e6a362a7411b86d83b7f3dc8bc3a6e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:12,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:08:12,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:08:12,050 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:08:12,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:08:12,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:08:12,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:08:12,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:08:12,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:08:12,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:08:12,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:08:12,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:08:12,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:08:12,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:08:12,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:08:12,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:08:12,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:08:12,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:08:12,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:08:12,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:08:12,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:08:12,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:08:12,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:08:12,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:08:12,076 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:08:12,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:08:12,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:08:12,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:08:12,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:08:12,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:08:12,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:08:12,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:08:12,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:08:12,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:08:12,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:08:12,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:08:12,085 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:12,101 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:08:12,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:08:12,103 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:08:12,103 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:08:12,103 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:08:12,103 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:08:12,104 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:08:12,104 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:08:12,104 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:08:12,104 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:08:12,104 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:08:12,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:08:12,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:08:12,105 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:08:12,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:08:12,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:08:12,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:08:12,106 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:08:12,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:08:12,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:08:12,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:08:12,108 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:08:12,108 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:08:12,108 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:08:12,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:08:12,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:08:12,109 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:08:12,110 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:08:12,110 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:08:12,110 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:08:12,110 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:08:12,111 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:08:12,111 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 -> 21f67d0148e6a362a7411b86d83b7f3dc8bc3a6e [2018-11-29 00:08:12,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:08:12,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:08:12,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:08:12,182 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:08:12,183 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:08:12,183 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-29 00:08:12,240 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38adc001/69ac9da373e04486b6c07dbd4953eef8/FLAG644f715d2 [2018-11-29 00:08:12,760 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:08:12,761 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-29 00:08:12,771 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38adc001/69ac9da373e04486b6c07dbd4953eef8/FLAG644f715d2 [2018-11-29 00:08:13,059 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38adc001/69ac9da373e04486b6c07dbd4953eef8 [2018-11-29 00:08:13,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:08:13,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:08:13,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:08:13,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:08:13,071 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:08:13,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:08:13" (1/1) ... [2018-11-29 00:08:13,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33e92b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:13, skipping insertion in model container [2018-11-29 00:08:13,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:08:13" (1/1) ... [2018-11-29 00:08:13,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:08:13,128 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:08:13,445 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:08:13,466 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:08:13,547 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:08:13,570 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:08:13,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:13 WrapperNode [2018-11-29 00:08:13,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:08:13,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:08:13,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:08:13,572 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:08:13,582 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:13" (1/1) ... [2018-11-29 00:08:13,590 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:13" (1/1) ... [2018-11-29 00:08:13,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:08:13,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:08:13,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:08:13,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:08:13,712 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:13" (1/1) ... [2018-11-29 00:08:13,712 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:13" (1/1) ... [2018-11-29 00:08:13,715 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:13" (1/1) ... [2018-11-29 00:08:13,715 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:13" (1/1) ... [2018-11-29 00:08:13,727 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:13" (1/1) ... [2018-11-29 00:08:13,738 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:13" (1/1) ... [2018-11-29 00:08:13,745 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:13" (1/1) ... [2018-11-29 00:08:13,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:08:13,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:08:13,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:08:13,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:08:13,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:13" (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:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:08:13,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:08:14,560 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:08:14,560 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-29 00:08:14,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:08:14 BoogieIcfgContainer [2018-11-29 00:08:14,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:08:14,562 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:08:14,562 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:08:14,565 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:08:14,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:08:14,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:08:13" (1/3) ... [2018-11-29 00:08:14,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c6e9272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:08:14, skipping insertion in model container [2018-11-29 00:08:14,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:08:14,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:13" (2/3) ... [2018-11-29 00:08:14,568 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c6e9272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:08:14, skipping insertion in model container [2018-11-29 00:08:14,568 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:08:14,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:08:14" (3/3) ... [2018-11-29 00:08:14,570 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-29 00:08:14,627 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:08:14,628 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:08:14,628 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:08:14,628 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:08:14,629 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:08:14,629 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:08:14,629 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:08:14,629 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:08:14,629 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:08:14,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2018-11-29 00:08:14,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-29 00:08:14,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:14,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:14,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:08:14,687 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:14,687 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:08:14,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2018-11-29 00:08:14,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-29 00:08:14,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:14,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:14,693 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:08:14,694 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:14,701 INFO L794 eck$LassoCheckResult]: Stem: 22#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]; 7#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; 32#L177true assume !(0 == ~r1~0);init_~tmp~0 := 0; 30#L177-1true init_#res := init_~tmp~0; 20#L242true 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; 58#L302-2true [2018-11-29 00:08:14,702 INFO L796 eck$LassoCheckResult]: Loop: 58#L302-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 26#L99true 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; 19#L103true assume !(node1_~m1~0 != ~nomsg~0); 18#L103-1true ~mode1~0 := 0; 23#L99-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 8#L127true assume !(0 != ~mode2~0 % 256); 42#L140true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 40#L140-2true ~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; 49#L127-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 60#L152true assume !(0 != ~mode3~0 % 256); 16#L165true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 27#L165-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 56#L152-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; 29#L250true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 44#L250-1true check_#res := check_~tmp~1; 15#L270true 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; 25#L326true assume !(0 == assert_~arg % 256); 4#L321true main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 58#L302-2true [2018-11-29 00:08:14,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash 28785120, now seen corresponding path program 1 times [2018-11-29 00:08:14,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:14,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:14,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:14,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:14,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:14,960 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:14,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:14,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:08:14,969 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:08:14,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash 982225852, now seen corresponding path program 1 times [2018-11-29 00:08:14,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:14,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:14,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:14,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:14,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:15,214 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:15,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:15,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:08:15,217 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:08:15,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:08:15,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:08:15,234 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 4 states. [2018-11-29 00:08:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:15,346 INFO L93 Difference]: Finished difference Result 61 states and 96 transitions. [2018-11-29 00:08:15,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:08:15,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 96 transitions. [2018-11-29 00:08:15,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-29 00:08:15,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 54 states and 74 transitions. [2018-11-29 00:08:15,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-29 00:08:15,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-29 00:08:15,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 74 transitions. [2018-11-29 00:08:15,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:15,364 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2018-11-29 00:08:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 74 transitions. [2018-11-29 00:08:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-29 00:08:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-29 00:08:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2018-11-29 00:08:15,401 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2018-11-29 00:08:15,401 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2018-11-29 00:08:15,401 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:08:15,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 74 transitions. [2018-11-29 00:08:15,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-29 00:08:15,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:15,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:15,405 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:15,405 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,406 INFO L794 eck$LassoCheckResult]: Stem: 167#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]; 146#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; 147#L177 assume 0 == ~r1~0; 178#L178 assume ~id1~0 >= 0; 139#L179 assume 0 == ~st1~0; 140#L180 assume ~send1~0 == ~id1~0; 166#L181 assume 0 == ~mode1~0 % 256; 151#L182 assume ~id2~0 >= 0; 152#L183 assume 0 == ~st2~0; 168#L184 assume ~send2~0 == ~id2~0; 186#L185 assume 0 == ~mode2~0 % 256; 135#L186 assume ~id3~0 >= 0; 136#L187 assume 0 == ~st3~0; 160#L188 assume ~send3~0 == ~id3~0; 180#L189 assume 0 == ~mode3~0 % 256; 141#L190 assume ~id1~0 != ~id2~0; 142#L191 assume ~id1~0 != ~id3~0; 183#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 175#L177-1 init_#res := init_~tmp~0; 165#L242 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; 138#L302-2 [2018-11-29 00:08:15,406 INFO L796 eck$LassoCheckResult]: Loop: 138#L302-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 169#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; 163#L103 assume !(node1_~m1~0 != ~nomsg~0); 161#L103-1 ~mode1~0 := 0; 162#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 148#L127 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 149#L130 assume !(node2_~m2~0 != ~nomsg~0); 154#L130-1 ~mode2~0 := 0; 185#L127-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 188#L152 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 176#L155 assume !(node3_~m3~0 != ~nomsg~0); 172#L155-1 ~mode3~0 := 0; 171#L152-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; 173#L250 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 144#L250-1 check_#res := check_~tmp~1; 156#L270 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; 157#L326 assume !(0 == assert_~arg % 256); 137#L321 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 138#L302-2 [2018-11-29 00:08:15,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:15,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 1 times [2018-11-29 00:08:15,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:15,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:15,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash -573552688, now seen corresponding path program 1 times [2018-11-29 00:08:15,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:15,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:15,610 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:15,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:15,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:08:15,612 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:08:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:08:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:08:15,613 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-29 00:08:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:15,826 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2018-11-29 00:08:15,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:08:15,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 76 transitions. [2018-11-29 00:08:15,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-29 00:08:15,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 54 states and 71 transitions. [2018-11-29 00:08:15,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-29 00:08:15,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-29 00:08:15,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 71 transitions. [2018-11-29 00:08:15,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:15,834 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2018-11-29 00:08:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 71 transitions. [2018-11-29 00:08:15,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-29 00:08:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-29 00:08:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2018-11-29 00:08:15,840 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2018-11-29 00:08:15,840 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2018-11-29 00:08:15,840 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:08:15,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 71 transitions. [2018-11-29 00:08:15,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-29 00:08:15,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:15,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:15,843 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:15,843 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:15,844 INFO L794 eck$LassoCheckResult]: Stem: 290#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]; 266#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; 267#L177 assume 0 == ~r1~0; 301#L178 assume ~id1~0 >= 0; 262#L179 assume 0 == ~st1~0; 263#L180 assume ~send1~0 == ~id1~0; 289#L181 assume 0 == ~mode1~0 % 256; 274#L182 assume ~id2~0 >= 0; 275#L183 assume 0 == ~st2~0; 291#L184 assume ~send2~0 == ~id2~0; 309#L185 assume 0 == ~mode2~0 % 256; 258#L186 assume ~id3~0 >= 0; 259#L187 assume 0 == ~st3~0; 283#L188 assume ~send3~0 == ~id3~0; 303#L189 assume 0 == ~mode3~0 % 256; 264#L190 assume ~id1~0 != ~id2~0; 265#L191 assume ~id1~0 != ~id3~0; 306#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 298#L177-1 init_#res := init_~tmp~0; 288#L242 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; 261#L302-2 [2018-11-29 00:08:15,844 INFO L796 eck$LassoCheckResult]: Loop: 261#L302-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 292#L99 assume !(0 != ~mode1~0 % 256); 293#L115 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 302#L115-2 ~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; 285#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 268#L127 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 269#L130 assume !(node2_~m2~0 != ~nomsg~0); 277#L130-1 ~mode2~0 := 0; 308#L127-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 311#L152 assume !(0 != ~mode3~0 % 256); 281#L165 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 282#L165-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 294#L152-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; 296#L250 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 297#L251 assume ~r1~0 >= 3; 271#L255 assume ~r1~0 < 3;check_~tmp~1 := 1; 272#L250-1 check_#res := check_~tmp~1; 279#L270 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; 280#L326 assume !(0 == assert_~arg % 256); 260#L321 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 261#L302-2 [2018-11-29 00:08:15,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 2 times [2018-11-29 00:08:15,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:15,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:15,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:15,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:15,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:15,921 INFO L82 PathProgramCache]: Analyzing trace with hash 604465100, now seen corresponding path program 1 times [2018-11-29 00:08:15,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:15,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:15,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:08:15,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:16,001 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,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:16,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:08:16,001 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:08:16,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:08:16,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:08:16,003 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-11-29 00:08:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:16,057 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2018-11-29 00:08:16,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:08:16,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 111 transitions. [2018-11-29 00:08:16,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-29 00:08:16,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 111 transitions. [2018-11-29 00:08:16,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-11-29 00:08:16,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-11-29 00:08:16,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 111 transitions. [2018-11-29 00:08:16,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:16,063 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. [2018-11-29 00:08:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 111 transitions. [2018-11-29 00:08:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-29 00:08:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-29 00:08:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2018-11-29 00:08:16,073 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. [2018-11-29 00:08:16,074 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. [2018-11-29 00:08:16,074 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:08:16,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 111 transitions. [2018-11-29 00:08:16,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-29 00:08:16,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:16,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:16,077 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,077 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:16,078 INFO L794 eck$LassoCheckResult]: Stem: 432#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]; 408#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; 409#L177 assume 0 == ~r1~0; 443#L178 assume ~id1~0 >= 0; 404#L179 assume 0 == ~st1~0; 405#L180 assume ~send1~0 == ~id1~0; 431#L181 assume 0 == ~mode1~0 % 256; 415#L182 assume ~id2~0 >= 0; 416#L183 assume 0 == ~st2~0; 433#L184 assume ~send2~0 == ~id2~0; 452#L185 assume 0 == ~mode2~0 % 256; 400#L186 assume ~id3~0 >= 0; 401#L187 assume 0 == ~st3~0; 425#L188 assume ~send3~0 == ~id3~0; 445#L189 assume 0 == ~mode3~0 % 256; 406#L190 assume ~id1~0 != ~id2~0; 407#L191 assume ~id1~0 != ~id3~0; 449#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 440#L177-1 init_#res := init_~tmp~0; 430#L242 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; 403#L302-2 [2018-11-29 00:08:16,078 INFO L796 eck$LassoCheckResult]: Loop: 403#L302-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 435#L99 assume !(0 != ~mode1~0 % 256); 436#L115 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 444#L115-2 ~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; 427#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 410#L127 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 411#L130 assume !(node2_~m2~0 != ~nomsg~0); 418#L130-1 ~mode2~0 := 0; 451#L127-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 456#L152 assume !(0 != ~mode3~0 % 256); 423#L165 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 424#L165-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 434#L152-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; 438#L250 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 439#L251 assume !(~r1~0 >= 3); 447#L254 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 448#L255 assume ~r1~0 < 3;check_~tmp~1 := 1; 453#L250-1 check_#res := check_~tmp~1; 421#L270 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; 422#L326 assume !(0 == assert_~arg % 256); 402#L321 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 403#L302-2 [2018-11-29 00:08:16,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:16,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 3 times [2018-11-29 00:08:16,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:16,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:16,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:16,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:16,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1089846558, now seen corresponding path program 1 times [2018-11-29 00:08:16,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:16,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:16,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:08:16,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:16,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:16,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1894601702, now seen corresponding path program 1 times [2018-11-29 00:08:16,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:16,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:16,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:16,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:16,258 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,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:16,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:08:17,178 WARN L180 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2018-11-29 00:08:18,693 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2018-11-29 00:08:18,705 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:08:18,706 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:08:18,706 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:08:18,706 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:08:18,706 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:08:18,706 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:08:18,707 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:08:18,707 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:08:18,707 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-29 00:08:18,707 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:08:18,707 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:08:18,754 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:18,798 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:18,808 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:18,820 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:18,825 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:18,829 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:18,839 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:18,846 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:18,848 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:18,855 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:18,858 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:18,860 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,079 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-11-29 00:08:19,079 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,086 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,089 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,091 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,095 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,102 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,105 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,109 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,404 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-29 00:08:19,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-29 00:08:24,312 WARN L180 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 143 DAG size of output: 95 [2018-11-29 00:08:24,381 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:08:24,383 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:24,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:08:24,393 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:24,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:08:24,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:08:24,578 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:08:24,580 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:08:24,581 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:08:24,581 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:08:24,581 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:08:24,581 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:08:24,581 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:08:24,581 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:08:24,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:08:24,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-29 00:08:24,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:08:24,582 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:08:24,593 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:24,609 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:24,616 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:24,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:24,626 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:24,628 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:24,631 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:24,635 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:24,638 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:24,646 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:24,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:24,661 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:24,664 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:24,674 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:24,677 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:24,678 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:24,682 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:24,684 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:24,840 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-11-29 00:08:24,840 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:24,843 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:25,148 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-29 00:08:25,156 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-29 00:08:29,734 WARN L180 SmtUtils]: Spent 4.36 s on a formula simplification. DAG size of input: 143 DAG size of output: 95 [2018-11-29 00:08:29,752 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:08:29,757 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:08:29,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:08:29,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:29,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:29,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:29,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:29,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:29,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:29,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:29,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:29,771 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:29,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:29,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:29,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:29,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:29,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:29,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:29,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:29,779 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:08:29,783 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:08:29,783 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:08:29,786 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:08:29,786 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:08:29,786 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:08:29,787 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:29,789 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:08:29,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:29,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:08:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:29,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:08:29,981 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:29,985 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:29,985 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 111 transitions. cyclomatic complexity: 30 Second operand 3 states. [2018-11-29 00:08:30,056 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:30,058 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:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:08:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-29 00:08:30,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 20 letters. Loop has 21 letters. [2018-11-29 00:08:30,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:08:30,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 41 letters. Loop has 21 letters. [2018-11-29 00:08:30,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:08:30,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 20 letters. Loop has 42 letters. [2018-11-29 00:08:30,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:08:30,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 202 transitions. [2018-11-29 00:08:30,067 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:08:30,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 0 states and 0 transitions. [2018-11-29 00:08:30,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:08:30,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:08:30,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:08:30,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:30,068 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:30,068 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:30,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:08:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:08:30,070 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-29 00:08:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:30,070 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:08:30,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:08:30,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:08:30,071 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:08:30,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:08:30,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:08:30,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:08:30,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:08:30,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:30,071 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:30,071 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:30,072 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:30,074 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:08:30,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:08:30,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:08:30,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:08:30,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:08:30 BoogieIcfgContainer [2018-11-29 00:08:30,080 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:08:30,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:08:30,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:08:30,081 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:08:30,082 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:14" (3/4) ... [2018-11-29 00:08:30,086 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:08:30,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:08:30,087 INFO L168 Benchmark]: Toolchain (without parser) took 17023.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.1 MB). Free memory was 951.3 MB in the beginning and 906.5 MB in the end (delta: 44.9 MB). Peak memory consumption was 404.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:30,088 INFO L168 Benchmark]: CDTParser took 0.14 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:30,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.77 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:30,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:30,090 INFO L168 Benchmark]: Boogie Preprocessor took 47.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:30,091 INFO L168 Benchmark]: RCFGBuilder took 807.13 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:30,092 INFO L168 Benchmark]: BuchiAutomizer took 15518.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 906.5 MB in the end (delta: 179.6 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:30,093 INFO L168 Benchmark]: Witness Printer took 5.14 ms. Allocated memory is still 1.4 GB. Free memory is still 906.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:08:30,100 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.14 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 504.77 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.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 807.13 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15518.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 906.5 MB in the end (delta: 179.6 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.14 ms. Allocated memory is still 1.4 GB. Free memory is still 906.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 14.6s. Construction of modules took 0.1s. 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.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital478 mio100 ax107 hnf101 lsp26 ukn64 mio100 lsp100 div175 bol100 ite100 ukn100 eq164 hnf66 smp100 dnf4932 smp23 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 4 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...