./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.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-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.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 c13792dac8774c9ebb29902c2dbd93ae05dc00b8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:10,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:08:10,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:08:10,813 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:08:10,814 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:08:10,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:08:10,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:08:10,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:08:10,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:08:10,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:08:10,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:08:10,829 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:08:10,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:08:10,831 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:08:10,834 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:08:10,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:08:10,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:08:10,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:08:10,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:08:10,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:08:10,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:08:10,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:08:10,859 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:08:10,860 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:08:10,861 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:08:10,861 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:08:10,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:08:10,868 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:08:10,870 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:08:10,873 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:08:10,873 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:08:10,875 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:08:10,876 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:08:10,876 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:08:10,877 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:08:10,878 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:08:10,878 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:10,900 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:08:10,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:08:10,901 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:08:10,901 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:08:10,901 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:08:10,902 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:08:10,902 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:08:10,902 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:08:10,902 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:08:10,902 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:08:10,904 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:08:10,904 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:08:10,904 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:08:10,904 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:08:10,904 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:08:10,904 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:08:10,905 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:08:10,905 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:08:10,905 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:08:10,905 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:08:10,905 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:08:10,907 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:08:10,907 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:08:10,907 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:08:10,907 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:08:10,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:08:10,908 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:08:10,908 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:08:10,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:08:10,909 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:08:10,909 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:08:10,910 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:08:10,911 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 -> c13792dac8774c9ebb29902c2dbd93ae05dc00b8 [2018-11-29 00:08:10,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:08:10,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:08:10,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:08:10,978 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:08:10,979 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:08:10,981 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2018-11-29 00:08:11,040 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1429fa434/2ae29634c51646c2910b40ac50b4a0be/FLAG0fcadc316 [2018-11-29 00:08:11,515 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:08:11,516 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2018-11-29 00:08:11,527 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1429fa434/2ae29634c51646c2910b40ac50b4a0be/FLAG0fcadc316 [2018-11-29 00:08:11,840 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1429fa434/2ae29634c51646c2910b40ac50b4a0be [2018-11-29 00:08:11,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:08:11,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:08:11,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:08:11,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:08:11,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:08:11,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:08:11" (1/1) ... [2018-11-29 00:08:11,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403756c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:11, skipping insertion in model container [2018-11-29 00:08:11,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:08:11" (1/1) ... [2018-11-29 00:08:11,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:08:11,911 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:08:12,295 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:08:12,307 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:08:12,380 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:08:12,402 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:08:12,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:12 WrapperNode [2018-11-29 00:08:12,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:08:12,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:08:12,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:08:12,405 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:08:12,485 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:12" (1/1) ... [2018-11-29 00:08:12,502 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:12" (1/1) ... [2018-11-29 00:08:12,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:08:12,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:08:12,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:08:12,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:08:12,563 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:12" (1/1) ... [2018-11-29 00:08:12,563 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:12" (1/1) ... [2018-11-29 00:08:12,569 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:12" (1/1) ... [2018-11-29 00:08:12,571 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:12" (1/1) ... [2018-11-29 00:08:12,589 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:12" (1/1) ... [2018-11-29 00:08:12,609 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:12" (1/1) ... [2018-11-29 00:08:12,613 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:12" (1/1) ... [2018-11-29 00:08:12,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:08:12,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:08:12,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:08:12,619 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:08:12,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:12" (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:12,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:08:12,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:08:13,936 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:08:13,937 INFO L280 CfgBuilder]: Removed 21 assue(true) statements. [2018-11-29 00:08:13,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:08:13 BoogieIcfgContainer [2018-11-29 00:08:13,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:08:13,938 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:08:13,938 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:08:13,941 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:08:13,942 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:08:13,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:08:11" (1/3) ... [2018-11-29 00:08:13,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a66cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:08:13, skipping insertion in model container [2018-11-29 00:08:13,943 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:08:13,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:08:12" (2/3) ... [2018-11-29 00:08:13,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a66cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:08:13, skipping insertion in model container [2018-11-29 00:08:13,944 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:08:13,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:08:13" (3/3) ... [2018-11-29 00:08:13,946 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2018-11-29 00:08:14,005 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:08:14,006 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:08:14,006 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:08:14,006 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:08:14,006 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:08:14,007 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:08:14,007 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:08:14,007 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:08:14,007 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:08:14,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states. [2018-11-29 00:08:14,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2018-11-29 00:08:14,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:14,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:14,073 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:08:14,073 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:08:14,073 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:08:14,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states. [2018-11-29 00:08:14,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2018-11-29 00:08:14,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:14,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:14,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:08:14,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:08:14,094 INFO L794 eck$LassoCheckResult]: Stem: 88#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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 55#L287true assume !(0 == ~r1~0);init_~tmp~0 := 0; 39#L287-1true init_#res := init_~tmp~0; 65#L416true main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 49#L485-2true [2018-11-29 00:08:14,095 INFO L796 eck$LassoCheckResult]: Loop: 49#L485-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 98#L118true 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 33#L122true assume !(node1_~m1~0 != ~nomsg~0); 46#L122-1true ~mode1~0 := 0; 85#L118-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 26#L150true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 16#L153true assume !(node2_~m2~0 != ~nomsg~0); 15#L153-1true ~mode2~0 := 0; 7#L150-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 103#L184true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 82#L187true assume !(node3_~m3~0 != ~nomsg~0); 81#L187-1true ~mode3~0 := 0; 99#L184-2true havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 48#L218true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 38#L221true assume !(node4_~m4~0 != ~nomsg~0); 37#L221-1true ~mode4~0 := 0; 59#L218-2true havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 4#L252true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 9#L255true assume !(node5_~m5~0 != ~nomsg~0); 111#L255-1true ~mode5~0 := 0; 3#L252-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 70#L424true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 73#L424-1true check_#res := check_~tmp~1; 23#L436true main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 61#L515true assume !(0 == assert_~arg % 256); 41#L510true main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; 49#L485-2true [2018-11-29 00:08:14,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:14,102 INFO L82 PathProgramCache]: Analyzing trace with hash 28880448, now seen corresponding path program 1 times [2018-11-29 00:08:14,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:14,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:14,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:14,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:14,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:14,438 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,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:14,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:08:14,447 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:08:14,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1018090030, now seen corresponding path program 1 times [2018-11-29 00:08:14,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:14,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:14,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:14,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:14,607 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,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:14,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:08:14,610 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:08:14,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:08:14,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:08:14,628 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 4 states. [2018-11-29 00:08:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:14,808 INFO L93 Difference]: Finished difference Result 118 states and 195 transitions. [2018-11-29 00:08:14,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:08:14,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 195 transitions. [2018-11-29 00:08:14,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-29 00:08:14,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 111 states and 157 transitions. [2018-11-29 00:08:14,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-11-29 00:08:14,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-11-29 00:08:14,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 157 transitions. [2018-11-29 00:08:14,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:14,838 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 157 transitions. [2018-11-29 00:08:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 157 transitions. [2018-11-29 00:08:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-29 00:08:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-29 00:08:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2018-11-29 00:08:14,882 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 157 transitions. [2018-11-29 00:08:14,882 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 157 transitions. [2018-11-29 00:08:14,882 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:08:14,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 157 transitions. [2018-11-29 00:08:14,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-29 00:08:14,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:14,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:14,895 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:08:14,895 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:08:14,899 INFO L794 eck$LassoCheckResult]: Stem: 353#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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 260#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 261#L287 assume 0 == ~r1~0; 266#L288 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 267#L289 assume ~id1~0 >= 0; 321#L290 assume 0 == ~st1~0; 322#L291 assume ~send1~0 == ~id1~0; 350#L292 assume 0 == ~mode1~0 % 256; 275#L293 assume ~id2~0 >= 0; 276#L294 assume 0 == ~st2~0; 330#L295 assume ~send2~0 == ~id2~0; 256#L296 assume 0 == ~mode2~0 % 256; 257#L297 assume ~id3~0 >= 0; 334#L298 assume 0 == ~st3~0; 270#L299 assume ~send3~0 == ~id3~0; 271#L300 assume 0 == ~mode3~0 % 256; 323#L301 assume ~id4~0 >= 0; 324#L302 assume 0 == ~st4~0; 337#L303 assume ~send4~0 == ~id4~0; 297#L304 assume 0 == ~mode4~0 % 256; 298#L305 assume ~id5~0 >= 0; 336#L306 assume 0 == ~st5~0; 268#L307 assume ~send5~0 == ~id5~0; 269#L308 assume 0 == ~mode5~0 % 256; 331#L309 assume ~id1~0 != ~id2~0; 254#L310 assume ~id1~0 != ~id3~0; 255#L311 assume ~id1~0 != ~id4~0; 305#L312 assume ~id1~0 != ~id5~0; 306#L313 assume ~id2~0 != ~id3~0; 349#L314 assume ~id2~0 != ~id4~0; 295#L315 assume ~id2~0 != ~id5~0; 296#L316 assume ~id3~0 != ~id4~0; 335#L317 assume ~id3~0 != ~id5~0; 264#L318 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 265#L287-1 init_#res := init_~tmp~0; 314#L416 main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 317#L485-2 [2018-11-29 00:08:14,899 INFO L796 eck$LassoCheckResult]: Loop: 317#L485-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 328#L118 assume !(0 != ~mode1~0 % 256); 281#L136 assume !(0 != ~alive1~0 % 256); 277#L136-2 ~mode1~0 := 1; 278#L118-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 290#L150 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 273#L153 assume !(node2_~m2~0 != ~nomsg~0); 272#L153-1 ~mode2~0 := 0; 258#L150-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 259#L184 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 351#L187 assume !(node3_~m3~0 != ~nomsg~0); 309#L187-1 ~mode3~0 := 0; 344#L184-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 327#L218 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 312#L221 assume !(node4_~m4~0 != ~nomsg~0); 311#L221-1 ~mode4~0 := 0; 293#L218-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 251#L252 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 253#L255 assume !(node5_~m5~0 != ~nomsg~0); 263#L255-1 ~mode5~0 := 0; 249#L252-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 250#L424 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 280#L424-1 check_#res := check_~tmp~1; 286#L436 main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 287#L515 assume !(0 == assert_~arg % 256); 316#L510 main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; 317#L485-2 [2018-11-29 00:08:14,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:14,900 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 1 times [2018-11-29 00:08:14,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:14,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:14,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:14,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:14,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:15,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash 214509128, now seen corresponding path program 1 times [2018-11-29 00:08:15,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:15,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:15,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:15,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:15,225 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,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:15,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:08:15,226 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:08:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:08:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:08:15,227 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. cyclomatic complexity: 47 Second operand 5 states. [2018-11-29 00:08:15,463 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-29 00:08:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:15,562 INFO L93 Difference]: Finished difference Result 114 states and 159 transitions. [2018-11-29 00:08:15,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:08:15,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 159 transitions. [2018-11-29 00:08:15,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-29 00:08:15,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 111 states and 155 transitions. [2018-11-29 00:08:15,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-11-29 00:08:15,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-11-29 00:08:15,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 155 transitions. [2018-11-29 00:08:15,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:15,570 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 155 transitions. [2018-11-29 00:08:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 155 transitions. [2018-11-29 00:08:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-29 00:08:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-29 00:08:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2018-11-29 00:08:15,587 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 155 transitions. [2018-11-29 00:08:15,587 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 155 transitions. [2018-11-29 00:08:15,587 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:08:15,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 155 transitions. [2018-11-29 00:08:15,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-29 00:08:15,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:08:15,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:08:15,595 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:08:15,595 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:08:15,595 INFO L794 eck$LassoCheckResult]: Stem: 590#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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 497#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 498#L287 assume 0 == ~r1~0; 503#L288 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 504#L289 assume ~id1~0 >= 0; 558#L290 assume 0 == ~st1~0; 559#L291 assume ~send1~0 == ~id1~0; 587#L292 assume 0 == ~mode1~0 % 256; 512#L293 assume ~id2~0 >= 0; 513#L294 assume 0 == ~st2~0; 567#L295 assume ~send2~0 == ~id2~0; 493#L296 assume 0 == ~mode2~0 % 256; 494#L297 assume ~id3~0 >= 0; 571#L298 assume 0 == ~st3~0; 507#L299 assume ~send3~0 == ~id3~0; 508#L300 assume 0 == ~mode3~0 % 256; 560#L301 assume ~id4~0 >= 0; 561#L302 assume 0 == ~st4~0; 574#L303 assume ~send4~0 == ~id4~0; 534#L304 assume 0 == ~mode4~0 % 256; 535#L305 assume ~id5~0 >= 0; 573#L306 assume 0 == ~st5~0; 505#L307 assume ~send5~0 == ~id5~0; 506#L308 assume 0 == ~mode5~0 % 256; 568#L309 assume ~id1~0 != ~id2~0; 491#L310 assume ~id1~0 != ~id3~0; 492#L311 assume ~id1~0 != ~id4~0; 542#L312 assume ~id1~0 != ~id5~0; 543#L313 assume ~id2~0 != ~id3~0; 586#L314 assume ~id2~0 != ~id4~0; 532#L315 assume ~id2~0 != ~id5~0; 533#L316 assume ~id3~0 != ~id4~0; 572#L317 assume ~id3~0 != ~id5~0; 501#L318 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 502#L287-1 init_#res := init_~tmp~0; 551#L416 main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 554#L485-2 [2018-11-29 00:08:15,596 INFO L796 eck$LassoCheckResult]: Loop: 554#L485-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 565#L118 assume !(0 != ~mode1~0 % 256); 518#L136 assume !(0 != ~alive1~0 % 256); 514#L136-2 ~mode1~0 := 1; 515#L118-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 527#L150 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 510#L153 assume !(node2_~m2~0 != ~nomsg~0); 509#L153-1 ~mode2~0 := 0; 495#L150-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 496#L184 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 588#L187 assume !(node3_~m3~0 != ~nomsg~0); 546#L187-1 ~mode3~0 := 0; 581#L184-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 564#L218 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 549#L221 assume !(node4_~m4~0 != ~nomsg~0); 548#L221-1 ~mode4~0 := 0; 530#L218-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 488#L252 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 490#L255 assume !(node5_~m5~0 != ~nomsg~0); 500#L255-1 ~mode5~0 := 0; 486#L252-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 487#L424 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 525#L425 assume ~r1~0 < 5;check_~tmp~1 := 1; 517#L424-1 check_#res := check_~tmp~1; 523#L436 main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 524#L515 assume !(0 == assert_~arg % 256); 553#L510 main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; 554#L485-2 [2018-11-29 00:08:15,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 2 times [2018-11-29 00:08:15,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:15,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:15,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:15,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:15,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:15,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1971488599, now seen corresponding path program 1 times [2018-11-29 00:08:15,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:15,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:08:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:08:15,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2077663555, now seen corresponding path program 1 times [2018-11-29 00:08:15,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:08:15,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:08:15,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:08:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:08:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:15,892 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,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:08:15,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:08:16,546 WARN L180 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 124 [2018-11-29 00:08:17,272 WARN L180 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2018-11-29 00:08:17,286 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:08:17,287 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:08:17,287 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:08:17,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:08:17,288 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:08:17,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:08:17,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:08:17,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:08:17,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-11-29 00:08:17,288 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:08:17,289 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:08:17,316 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:17,356 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:17,365 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:17,368 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:17,374 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:17,395 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:17,401 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:17,406 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:17,409 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:17,421 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:17,424 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:17,427 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:17,431 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:17,442 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:17,448 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:17,453 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:17,455 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:17,467 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:17,476 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:17,491 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:17,496 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:17,498 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:17,504 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:17,507 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:17,510 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:17,524 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:17,526 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:17,591 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:17,605 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:17,607 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:17,611 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:17,614 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:17,623 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,237 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-29 00:08:18,352 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-11-29 00:08:18,699 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-29 00:08:18,735 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:08:18,735 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:18,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:08:18,745 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:18,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:08:18,770 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:08:18,882 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:08:18,884 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:08:18,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:08:18,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:08:18,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:08:18,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:08:18,884 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:08:18,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:08:18,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:08:18,885 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-11-29 00:08:18,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:08:18,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:08:18,898 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,914 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,917 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,922 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,927 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,931 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,933 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,940 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,942 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,011 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,018 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,023 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,024 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,027 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,030 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,032 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,036 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,075 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,088 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,129 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,137 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,141 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,148 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,150 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,153 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,163 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,168 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,169 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,173 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,174 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,179 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,187 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,192 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,478 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-29 00:08:19,759 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-29 00:08:20,175 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-29 00:08:20,243 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:08:20,248 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:08:20,250 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:20,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,263 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:20,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:08:20,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:08:20,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,269 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:20,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,271 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:20,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:08:20,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:08:20,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,277 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:20,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,281 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:20,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,284 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:20,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,286 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:20,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:08:20,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:08:20,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,292 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:20,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,296 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:20,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:08:20,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:08:20,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,301 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:20,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,304 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:20,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,309 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:20,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,315 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:20,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,321 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:20,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,327 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:20,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:08:20,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:08:20,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,338 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:20,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:08:20,347 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:20,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:08:20,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:08:20,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:08:20,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:08:20,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:08:20,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:08:20,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:08:20,355 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:08:20,359 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:08:20,360 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:08:20,364 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:08:20,364 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:08:20,364 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:08:20,366 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2018-11-29 00:08:20,367 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:08:20,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:08:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:20,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:08:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:08:20,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:08:20,685 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:20,689 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:20,689 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 155 transitions. cyclomatic complexity: 45 Second operand 3 states. [2018-11-29 00:08:20,763 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 155 transitions. cyclomatic complexity: 45. Second operand 3 states. Result 186 states and 275 transitions. Complement of second has 4 states. [2018-11-29 00:08:20,764 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:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:08:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-29 00:08:20,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 155 transitions. Stem has 36 letters. Loop has 27 letters. [2018-11-29 00:08:20,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:08:20,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 155 transitions. Stem has 63 letters. Loop has 27 letters. [2018-11-29 00:08:20,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:08:20,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 155 transitions. Stem has 36 letters. Loop has 54 letters. [2018-11-29 00:08:20,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:08:20,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 275 transitions. [2018-11-29 00:08:20,773 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:08:20,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 0 states and 0 transitions. [2018-11-29 00:08:20,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:08:20,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:08:20,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:08:20,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:20,774 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:20,774 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:20,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:08:20,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:08:20,775 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-29 00:08:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:08:20,775 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:08:20,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:08:20,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:08:20,775 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:08:20,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:08:20,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:08:20,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:08:20,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:08:20,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:08:20,776 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:20,776 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:20,776 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:08:20,776 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:08:20,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:08:20,776 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:08:20,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:08:20,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:08:20 BoogieIcfgContainer [2018-11-29 00:08:20,784 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:08:20,784 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:08:20,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:08:20,784 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:08:20,785 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:13" (3/4) ... [2018-11-29 00:08:20,788 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:08:20,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:08:20,789 INFO L168 Benchmark]: Toolchain (without parser) took 8945.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 952.7 MB in the beginning and 892.5 MB in the end (delta: 60.2 MB). Peak memory consumption was 275.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:20,791 INFO L168 Benchmark]: CDTParser took 0.19 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:20,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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:20,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:20,793 INFO L168 Benchmark]: Boogie Preprocessor took 67.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:08:20,793 INFO L168 Benchmark]: RCFGBuilder took 1318.85 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: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:20,794 INFO L168 Benchmark]: BuchiAutomizer took 6845.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 892.5 MB in the end (delta: 185.2 MB). Peak memory consumption was 253.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:08:20,795 INFO L168 Benchmark]: Witness Printer took 4.50 ms. Allocated memory is still 1.2 GB. Free memory is still 892.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:08:20,800 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.19 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 557.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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 146.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1318.85 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: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6845.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 892.5 MB in the end (delta: 185.2 MB). Peak memory consumption was 253.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.50 ms. Allocated memory is still 1.2 GB. Free memory is still 892.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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 111 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 501 SDtfs, 274 SDslu, 926 SDs, 0 SdLazy, 22 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax142 hnf109 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq228 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...