./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 21f67d0148e6a362a7411b86d83b7f3dc8bc3a6e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 23:51:21,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 23:51:21,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 23:51:21,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 23:51:21,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 23:51:21,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 23:51:21,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 23:51:21,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 23:51:21,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 23:51:21,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 23:51:21,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 23:51:21,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 23:51:21,803 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 23:51:21,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 23:51:21,804 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 23:51:21,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 23:51:21,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 23:51:21,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 23:51:21,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 23:51:21,809 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 23:51:21,810 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 23:51:21,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 23:51:21,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 23:51:21,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 23:51:21,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 23:51:21,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 23:51:21,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 23:51:21,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 23:51:21,816 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 23:51:21,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 23:51:21,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 23:51:21,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 23:51:21,818 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 23:51:21,818 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 23:51:21,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 23:51:21,819 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 23:51:21,819 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-09 23:51:21,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 23:51:21,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 23:51:21,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 23:51:21,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 23:51:21,832 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 23:51:21,832 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 23:51:21,832 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 23:51:21,832 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 23:51:21,832 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 23:51:21,832 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 23:51:21,832 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 23:51:21,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 23:51:21,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 23:51:21,833 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 23:51:21,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 23:51:21,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 23:51:21,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 23:51:21,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 23:51:21,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 23:51:21,834 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 23:51:21,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 23:51:21,834 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 23:51:21,834 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 23:51:21,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 23:51:21,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 23:51:21,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 23:51:21,834 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 23:51:21,834 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 23:51:21,835 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 23:51:21,835 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 23:51:21,835 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 23:51:21,835 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21f67d0148e6a362a7411b86d83b7f3dc8bc3a6e [2018-11-09 23:51:21,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 23:51:21,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 23:51:21,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 23:51:21,879 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 23:51:21,880 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 23:51:21,880 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-09 23:51:21,929 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/data/ed92b1ec7/8789abe04fbe412aac1eb34abdc62ce6/FLAGa1ebaf9b9 [2018-11-09 23:51:22,280 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 23:51:22,280 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-09 23:51:22,285 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/data/ed92b1ec7/8789abe04fbe412aac1eb34abdc62ce6/FLAGa1ebaf9b9 [2018-11-09 23:51:22,294 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/data/ed92b1ec7/8789abe04fbe412aac1eb34abdc62ce6 [2018-11-09 23:51:22,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 23:51:22,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 23:51:22,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 23:51:22,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 23:51:22,301 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 23:51:22,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23082619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22, skipping insertion in model container [2018-11-09 23:51:22,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 23:51:22,338 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 23:51:22,472 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:51:22,476 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 23:51:22,498 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:51:22,508 INFO L193 MainTranslator]: Completed translation [2018-11-09 23:51:22,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22 WrapperNode [2018-11-09 23:51:22,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 23:51:22,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 23:51:22,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 23:51:22,509 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 23:51:22,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 23:51:22,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 23:51:22,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 23:51:22,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 23:51:22,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (1/1) ... [2018-11-09 23:51:22,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 23:51:22,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 23:51:22,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 23:51:22,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 23:51:22,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/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-09 23:51:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 23:51:22,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 23:51:22,913 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 23:51:22,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:51:22 BoogieIcfgContainer [2018-11-09 23:51:22,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 23:51:22,914 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 23:51:22,914 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 23:51:22,917 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 23:51:22,918 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:51:22,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 11:51:22" (1/3) ... [2018-11-09 23:51:22,919 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34c69408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:51:22, skipping insertion in model container [2018-11-09 23:51:22,919 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:51:22,919 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:51:22" (2/3) ... [2018-11-09 23:51:22,919 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34c69408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:51:22, skipping insertion in model container [2018-11-09 23:51:22,919 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:51:22,919 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:51:22" (3/3) ... [2018-11-09 23:51:22,920 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-09 23:51:22,957 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 23:51:22,957 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 23:51:22,958 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 23:51:22,958 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 23:51:22,958 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 23:51:22,958 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 23:51:22,958 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 23:51:22,958 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 23:51:22,958 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 23:51:22,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2018-11-09 23:51:22,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-09 23:51:22,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:51:22,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:51:22,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-09 23:51:22,987 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] [2018-11-09 23:51:22,987 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 23:51:22,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2018-11-09 23:51:22,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-09 23:51:22,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:51:22,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:51:22,991 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-09 23:51:22,991 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] [2018-11-09 23:51:22,996 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 32#L177true assume !(~r1~0 == 0);init_~tmp~0 := 0; 30#L177-1true init_#res := init_~tmp~0; 20#L242true main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 55#L302-3true [2018-11-09 23:51:22,997 INFO L795 eck$LassoCheckResult]: Loop: 55#L302-3true assume true; 60#L302-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 26#L99true assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 19#L103true assume !(node1_~m1~0 != ~nomsg~0); 18#L103-1true ~mode1~0 := 0; 23#L99-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 8#L127true assume !(~mode2~0 % 256 != 0); 42#L140true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 40#L140-2true ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 50#L127-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 61#L152true assume !(~mode3~0 % 256 != 0); 16#L165true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 27#L165-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 57#L152-2true assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 29#L250true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 44#L250-1true check_#res := check_~tmp~1; 15#L270true main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 25#L326true assume !(assert_~arg % 256 == 0); 4#L321true assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := main_#t~post18 + 1;havoc main_#t~post18; 55#L302-3true [2018-11-09 23:51:23,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:51:23,001 INFO L82 PathProgramCache]: Analyzing trace with hash 28785120, now seen corresponding path program 1 times [2018-11-09 23:51:23,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:51:23,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:51:23,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:51:23,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:51:23,133 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-09 23:51:23,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:51:23,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:51:23,137 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-09 23:51:23,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:51:23,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1809972829, now seen corresponding path program 1 times [2018-11-09 23:51:23,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:51:23,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:51:23,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:51:23,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:51:23,228 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-09 23:51:23,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:51:23,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 23:51:23,230 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:51:23,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 23:51:23,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 23:51:23,242 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 4 states. [2018-11-09 23:51:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:51:23,303 INFO L93 Difference]: Finished difference Result 62 states and 97 transitions. [2018-11-09 23:51:23,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 23:51:23,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 97 transitions. [2018-11-09 23:51:23,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-09 23:51:23,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 55 states and 75 transitions. [2018-11-09 23:51:23,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-09 23:51:23,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-09 23:51:23,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 75 transitions. [2018-11-09 23:51:23,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:51:23,313 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2018-11-09 23:51:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 75 transitions. [2018-11-09 23:51:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-09 23:51:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-09 23:51:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2018-11-09 23:51:23,335 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2018-11-09 23:51:23,335 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2018-11-09 23:51:23,335 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 23:51:23,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2018-11-09 23:51:23,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-09 23:51:23,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:51:23,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:51:23,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:51:23,337 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] [2018-11-09 23:51:23,337 INFO L793 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 149#L177 assume ~r1~0 == 0; 180#L178 assume ~id1~0 >= 0; 141#L179 assume ~st1~0 == 0; 142#L180 assume ~send1~0 == ~id1~0; 168#L181 assume ~mode1~0 % 256 == 0; 153#L182 assume ~id2~0 >= 0; 154#L183 assume ~st2~0 == 0; 170#L184 assume ~send2~0 == ~id2~0; 188#L185 assume ~mode2~0 % 256 == 0; 137#L186 assume ~id3~0 >= 0; 138#L187 assume ~st3~0 == 0; 162#L188 assume ~send3~0 == ~id3~0; 182#L189 assume ~mode3~0 % 256 == 0; 143#L190 assume ~id1~0 != ~id2~0; 144#L191 assume ~id1~0 != ~id3~0; 185#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 177#L177-1 init_#res := init_~tmp~0; 167#L242 main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 140#L302-3 [2018-11-09 23:51:23,338 INFO L795 eck$LassoCheckResult]: Loop: 140#L302-3 assume true; 191#L302-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 171#L99 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 165#L103 assume !(node1_~m1~0 != ~nomsg~0); 163#L103-1 ~mode1~0 := 0; 164#L99-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 150#L127 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 151#L130 assume !(node2_~m2~0 != ~nomsg~0); 156#L130-1 ~mode2~0 := 0; 187#L127-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 190#L152 assume !(~mode3~0 % 256 != 0); 160#L165 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 161#L165-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 173#L152-2 assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 175#L250 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 146#L250-1 check_#res := check_~tmp~1; 158#L270 main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 159#L326 assume !(assert_~arg % 256 == 0); 139#L321 assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := main_#t~post18 + 1;havoc main_#t~post18; 140#L302-3 [2018-11-09 23:51:23,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:51:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 1 times [2018-11-09 23:51:23,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:51:23,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:51:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:51:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:51:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:51:23,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:51:23,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2147201325, now seen corresponding path program 1 times [2018-11-09 23:51:23,386 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:51:23,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:51:23,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:51:23,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:51:23,447 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-09 23:51:23,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:51:23,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 23:51:23,448 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:51:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 23:51:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-09 23:51:23,449 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-09 23:51:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:51:23,499 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-09 23:51:23,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 23:51:23,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 77 transitions. [2018-11-09 23:51:23,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-09 23:51:23,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 72 transitions. [2018-11-09 23:51:23,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-09 23:51:23,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-09 23:51:23,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 72 transitions. [2018-11-09 23:51:23,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:51:23,503 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-09 23:51:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 72 transitions. [2018-11-09 23:51:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-09 23:51:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-09 23:51:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2018-11-09 23:51:23,508 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-09 23:51:23,508 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-09 23:51:23,508 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 23:51:23,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 72 transitions. [2018-11-09 23:51:23,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-09 23:51:23,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:51:23,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:51:23,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:51:23,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:51:23,511 INFO L793 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 271#L177 assume ~r1~0 == 0; 305#L178 assume ~id1~0 >= 0; 266#L179 assume ~st1~0 == 0; 267#L180 assume ~send1~0 == ~id1~0; 293#L181 assume ~mode1~0 % 256 == 0; 278#L182 assume ~id2~0 >= 0; 279#L183 assume ~st2~0 == 0; 295#L184 assume ~send2~0 == ~id2~0; 313#L185 assume ~mode2~0 % 256 == 0; 262#L186 assume ~id3~0 >= 0; 263#L187 assume ~st3~0 == 0; 287#L188 assume ~send3~0 == ~id3~0; 307#L189 assume ~mode3~0 % 256 == 0; 268#L190 assume ~id1~0 != ~id2~0; 269#L191 assume ~id1~0 != ~id3~0; 310#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 302#L177-1 init_#res := init_~tmp~0; 292#L242 main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 265#L302-3 [2018-11-09 23:51:23,512 INFO L795 eck$LassoCheckResult]: Loop: 265#L302-3 assume true; 316#L302-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 296#L99 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 290#L103 assume !(node1_~m1~0 != ~nomsg~0); 288#L103-1 ~mode1~0 := 0; 289#L99-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 272#L127 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 273#L130 assume !(node2_~m2~0 != ~nomsg~0); 281#L130-1 ~mode2~0 := 0; 312#L127-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 315#L152 assume !(~mode3~0 % 256 != 0); 285#L165 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 286#L165-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 298#L152-2 assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 300#L250 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 301#L251 assume ~r1~0 >= 3; 275#L255 assume ~r1~0 < 3;check_~tmp~1 := 1; 276#L250-1 check_#res := check_~tmp~1; 283#L270 main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 284#L326 assume !(assert_~arg % 256 == 0); 264#L321 assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := main_#t~post18 + 1;havoc main_#t~post18; 265#L302-3 [2018-11-09 23:51:23,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:51:23,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 2 times [2018-11-09 23:51:23,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:51:23,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:51:23,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:51:23,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:51:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:51:23,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:51:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash 460347421, now seen corresponding path program 1 times [2018-11-09 23:51:23,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:51:23,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:51:23,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:51:23,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:51:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:51:23,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:51:23,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:51:23,579 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:51:23,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:51:23,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:51:23,579 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-11-09 23:51:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:51:23,604 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2018-11-09 23:51:23,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:51:23,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2018-11-09 23:51:23,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2018-11-09 23:51:23,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2018-11-09 23:51:23,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-09 23:51:23,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-11-09 23:51:23,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2018-11-09 23:51:23,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:51:23,608 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-09 23:51:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2018-11-09 23:51:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-09 23:51:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-09 23:51:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2018-11-09 23:51:23,614 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-09 23:51:23,614 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-09 23:51:23,614 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 23:51:23,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2018-11-09 23:51:23,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2018-11-09 23:51:23,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:51:23,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:51:23,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:51:23,617 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] [2018-11-09 23:51:23,617 INFO L793 eck$LassoCheckResult]: Stem: 439#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 418#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 419#L177 assume ~r1~0 == 0; 451#L178 assume ~id1~0 >= 0; 411#L179 assume ~st1~0 == 0; 412#L180 assume ~send1~0 == ~id1~0; 438#L181 assume ~mode1~0 % 256 == 0; 422#L182 assume ~id2~0 >= 0; 423#L183 assume ~st2~0 == 0; 440#L184 assume ~send2~0 == ~id2~0; 459#L185 assume ~mode2~0 % 256 == 0; 407#L186 assume ~id3~0 >= 0; 408#L187 assume ~st3~0 == 0; 432#L188 assume ~send3~0 == ~id3~0; 452#L189 assume ~mode3~0 % 256 == 0; 413#L190 assume ~id1~0 != ~id2~0; 414#L191 assume ~id1~0 != ~id3~0; 456#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 447#L177-1 init_#res := init_~tmp~0; 437#L242 main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 410#L302-3 [2018-11-09 23:51:23,617 INFO L795 eck$LassoCheckResult]: Loop: 410#L302-3 assume true; 464#L302-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 441#L99 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 435#L103 assume !(node1_~m1~0 != ~nomsg~0); 433#L103-1 ~mode1~0 := 0; 434#L99-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 415#L127 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 416#L130 assume !(node2_~m2~0 != ~nomsg~0); 425#L130-1 ~mode2~0 := 0; 458#L127-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 463#L152 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 448#L155 assume !(node3_~m3~0 != ~nomsg~0); 444#L155-1 ~mode3~0 := 0; 443#L152-2 assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 445#L250 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 446#L251 assume !(~r1~0 >= 3); 454#L254 assume ~st1~0 + ~st2~0 + ~st3~0 == 0; 455#L255 assume ~r1~0 < 3;check_~tmp~1 := 1; 460#L250-1 check_#res := check_~tmp~1; 428#L270 main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 429#L326 assume !(assert_~arg % 256 == 0); 409#L321 assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := main_#t~post18 + 1;havoc main_#t~post18; 410#L302-3 [2018-11-09 23:51:23,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:51:23,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 3 times [2018-11-09 23:51:23,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:51:23,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:51:23,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:51:23,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:51:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:51:23,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:51:23,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1913164776, now seen corresponding path program 1 times [2018-11-09 23:51:23,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:51:23,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:51:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:51:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:51:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:51:23,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:51:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash -58219676, now seen corresponding path program 1 times [2018-11-09 23:51:23,658 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:51:23,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:51:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:51:23,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:51:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:51:23,691 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-09 23:51:23,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:51:23,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:51:23,896 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 98 [2018-11-09 23:51:24,204 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2018-11-09 23:51:24,212 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:51:24,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:51:24,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:51:24,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:51:24,213 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:51:24,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:51:24,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:51:24,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:51:24,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-09 23:51:24,214 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:51:24,214 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:51:24,232 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-09 23:51:24,238 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-09 23:51:24,252 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-09 23:51:24,253 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-09 23:51:24,257 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-09 23:51:24,259 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-09 23:51:24,262 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-09 23:51:24,288 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-09 23:51:24,295 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-09 23:51:24,297 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-09 23:51:24,299 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-09 23:51:24,300 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-09 23:51:24,303 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-09 23:51:24,304 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-09 23:51:24,305 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-09 23:51:24,309 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-09 23:51:24,312 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-09 23:51:24,314 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-09 23:51:24,315 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-09 23:51:24,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-09 23:51:24,640 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:51:24,643 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/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-09 23:51:24,655 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:51:24,655 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96b15744-b1dd-48f3-9656-1bf5ae3098d9/bin-2019/uautomizer/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-09 23:51:24,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:51:24,695 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:51:24,866 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 23:51:24,867 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:51:24,867 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:51:24,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:51:24,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:51:24,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:51:24,868 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:51:24,868 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:51:24,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:51:24,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-09 23:51:24,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:51:24,868 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:51:24,872 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-09 23:51:24,886 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-09 23:51:24,887 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-09 23:51:24,891 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-09 23:51:24,894 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-09 23:51:24,896 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-09 23:51:24,897 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-09 23:51:24,899 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-09 23:51:24,921 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-09 23:51:24,923 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-09 23:51:24,926 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-09 23:51:24,929 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-09 23:51:24,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-09 23:51:24,932 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-09 23:51:24,935 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-09 23:51:24,936 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-09 23:51:24,939 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-09 23:51:24,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-09 23:51:24,941 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-09 23:51:24,943 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-09 23:51:25,160 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:51:25,163 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:51:25,165 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-09 23:51:25,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:51:25,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,181 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,181 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-09 23:51:25,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,185 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-09 23:51:25,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,192 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-09 23:51:25,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:51:25,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:51:25,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,197 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-09 23:51:25,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,203 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-09 23:51:25,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:51:25,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:51:25,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,208 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-09 23:51:25,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,209 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:51:25,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,214 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:51:25,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,218 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-09 23:51:25,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:51:25,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:51:25,224 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,225 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-09 23:51:25,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,228 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-09 23:51:25,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,233 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-09 23:51:25,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:51:25,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:51:25,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,239 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-09 23:51:25,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,240 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-09 23:51:25,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,248 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-09 23:51:25,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,250 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:51:25,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-09 23:51:25,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:51:25,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:51:25,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:51:25,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:51:25,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:51:25,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:51:25,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:51:25,253 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:51:25,256 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 23:51:25,256 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-09 23:51:25,257 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:51:25,258 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 23:51:25,258 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:51:25,258 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-11-09 23:51:25,259 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-09 23:51:25,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:51:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:51:25,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:51:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:51:25,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:51:25,346 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-09 23:51:25,348 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-09 23:51:25,349 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-11-09 23:51:25,385 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 147 states and 206 transitions. Complement of second has 6 states. [2018-11-09 23:51:25,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:51:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:51:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-09 23:51:25,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 20 letters. Loop has 22 letters. [2018-11-09 23:51:25,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:51:25,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 42 letters. Loop has 22 letters. [2018-11-09 23:51:25,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:51:25,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 20 letters. Loop has 44 letters. [2018-11-09 23:51:25,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:51:25,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 206 transitions. [2018-11-09 23:51:25,392 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:51:25,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 0 states and 0 transitions. [2018-11-09 23:51:25,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 23:51:25,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 23:51:25,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 23:51:25,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:51:25,392 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:51:25,392 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:51:25,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:51:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:51:25,393 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-09 23:51:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:51:25,393 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-09 23:51:25,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 23:51:25,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-09 23:51:25,393 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:51:25,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 23:51:25,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 23:51:25,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 23:51:25,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 23:51:25,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:51:25,395 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:51:25,395 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:51:25,395 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:51:25,395 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-09 23:51:25,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 23:51:25,396 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:51:25,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 23:51:25,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 11:51:25 BoogieIcfgContainer [2018-11-09 23:51:25,400 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 23:51:25,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 23:51:25,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 23:51:25,401 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 23:51:25,401 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:51:22" (3/4) ... [2018-11-09 23:51:25,404 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 23:51:25,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 23:51:25,405 INFO L168 Benchmark]: Toolchain (without parser) took 3108.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 954.8 MB in the beginning and 1.0 GB in the end (delta: -70.5 MB). Peak memory consumption was 137.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:51:25,405 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:51:25,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.00 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 938.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-09 23:51:25,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -207.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-09 23:51:25,406 INFO L168 Benchmark]: Boogie Preprocessor took 17.51 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-09 23:51:25,407 INFO L168 Benchmark]: RCFGBuilder took 326.46 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: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-11-09 23:51:25,407 INFO L168 Benchmark]: BuchiAutomizer took 2486.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.3 MB). Peak memory consumption was 143.4 MB. Max. memory is 11.5 GB. [2018-11-09 23:51:25,408 INFO L168 Benchmark]: Witness Printer took 3.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:51:25,410 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 211.00 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 938.7 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 60.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -207.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.51 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 326.46 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: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2486.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.3 MB). Peak memory consumption was 143.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 343 SDtfs, 163 SDslu, 496 SDs, 0 SdLazy, 32 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital216 mio100 ax117 hnf103 lsp22 ukn65 mio100 lsp100 div173 bol100 ite100 ukn100 eq151 hnf74 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...