./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.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_4afabc50-be95-4b7a-9181-93ebf95701c0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/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 bface9c2aaf995719ea2868f2c86b44f41c1d67a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:36:22,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:36:22,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:36:22,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:36:22,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:36:22,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:36:22,378 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:36:22,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:36:22,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:36:22,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:36:22,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:36:22,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:36:22,382 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:36:22,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:36:22,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:36:22,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:36:22,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:36:22,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:36:22,387 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:36:22,388 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:36:22,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:36:22,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:36:22,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:36:22,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:36:22,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:36:22,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:36:22,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:36:22,394 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:36:22,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:36:22,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:36:22,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:36:22,396 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:36:22,396 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:36:22,396 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:36:22,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:36:22,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:36:22,397 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:36:22,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:36:22,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:36:22,410 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:36:22,410 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:36:22,410 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:36:22,410 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:36:22,411 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:36:22,411 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:36:22,411 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:36:22,411 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:36:22,411 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:36:22,411 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:36:22,411 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:36:22,412 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:36:22,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:36:22,412 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:36:22,412 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:36:22,412 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:36:22,412 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:36:22,412 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:36:22,412 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:36:22,413 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:36:22,413 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:36:22,413 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:36:22,413 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:36:22,413 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:36:22,413 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:36:22,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:36:22,413 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:36:22,413 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:36:22,414 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:36:22,414 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_4afabc50-be95-4b7a-9181-93ebf95701c0/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 -> bface9c2aaf995719ea2868f2c86b44f41c1d67a [2018-11-10 12:36:22,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:36:22,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:36:22,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:36:22,447 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:36:22,447 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:36:22,447 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2018-11-10 12:36:22,483 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/bin-2019/uautomizer/data/7799813f3/17b783e4008a496b96b891d26b9c3ceb/FLAGcbdb54f84 [2018-11-10 12:36:22,912 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:36:22,913 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2018-11-10 12:36:22,918 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/bin-2019/uautomizer/data/7799813f3/17b783e4008a496b96b891d26b9c3ceb/FLAGcbdb54f84 [2018-11-10 12:36:22,928 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/bin-2019/uautomizer/data/7799813f3/17b783e4008a496b96b891d26b9c3ceb [2018-11-10 12:36:22,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:36:22,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:36:22,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:36:22,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:36:22,934 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:36:22,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:36:22" (1/1) ... [2018-11-10 12:36:22,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11bcb58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:22, skipping insertion in model container [2018-11-10 12:36:22,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:36:22" (1/1) ... [2018-11-10 12:36:22,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:36:22,973 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:36:23,116 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:36:23,122 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:36:23,160 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:36:23,173 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:36:23,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23 WrapperNode [2018-11-10 12:36:23,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:36:23,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:36:23,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:36:23,174 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:36:23,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (1/1) ... [2018-11-10 12:36:23,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (1/1) ... [2018-11-10 12:36:23,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:36:23,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:36:23,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:36:23,245 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:36:23,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (1/1) ... [2018-11-10 12:36:23,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (1/1) ... [2018-11-10 12:36:23,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (1/1) ... [2018-11-10 12:36:23,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (1/1) ... [2018-11-10 12:36:23,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (1/1) ... [2018-11-10 12:36:23,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (1/1) ... [2018-11-10 12:36:23,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (1/1) ... [2018-11-10 12:36:23,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:36:23,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:36:23,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:36:23,269 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:36:23,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/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-10 12:36:23,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:36:23,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:36:23,731 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:36:23,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:36:23 BoogieIcfgContainer [2018-11-10 12:36:23,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:36:23,732 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:36:23,732 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:36:23,735 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:36:23,736 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:36:23,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:36:22" (1/3) ... [2018-11-10 12:36:23,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e9b8878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:36:23, skipping insertion in model container [2018-11-10 12:36:23,737 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:36:23,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:23" (2/3) ... [2018-11-10 12:36:23,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e9b8878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:36:23, skipping insertion in model container [2018-11-10 12:36:23,738 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:36:23,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:36:23" (3/3) ... [2018-11-10 12:36:23,739 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2018-11-10 12:36:23,770 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:36:23,771 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:36:23,771 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:36:23,771 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:36:23,771 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:36:23,771 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:36:23,771 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:36:23,771 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:36:23,771 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:36:23,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states. [2018-11-10 12:36:23,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2018-11-10 12:36:23,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:36:23,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:36:23,807 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:36:23,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:23,807 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:36:23,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states. [2018-11-10 12:36:23,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2018-11-10 12:36:23,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:36:23,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:36:23,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:36:23,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:23,819 INFO L793 eck$LassoCheckResult]: Stem: 82#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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 88#L272true assume !(~r1~0 == 0);init_~tmp~0 := 0; 86#L272-1true init_#res := init_~tmp~0; 39#L433true main_#t~ret31 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 105#L511-3true [2018-11-10 12:36:23,820 INFO L795 eck$LassoCheckResult]: Loop: 105#L511-3true assume true; 101#L511-1true assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 15#L120true assume !(~mode1~0 % 256 != 0); 97#L134true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 110#L134-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 14#L120-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; 62#L146true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 64#L149true assume !(node2_~m2~0 != ~nomsg~0); 49#L149-1true ~mode2~0 := 0; 59#L146-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; 66#L171true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 55#L174true assume !(node3_~m3~0 != ~nomsg~0); 54#L174-1true ~mode3~0 := 0; 48#L171-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 56#L196true assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 32#L199true assume !(node4_~m4~0 != ~nomsg~0); 30#L199-1true ~mode4~0 := 0; 53#L196-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 33#L221true assume !(~mode5~0 % 256 != 0); 81#L234true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 63#L234-2true ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 29#L221-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 37#L246true assume !(~mode6~0 % 256 != 0); 70#L259true assume !(~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0);node6_#t~ite5 := ~p6_new~0; 67#L259-2true ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 23#L246-2true assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 42#L441true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 43#L441-1true check_#res := check_~tmp~1; 20#L461true main_#t~ret32 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;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; 8#L544true assume !(assert_~arg % 256 == 0); 95#L539true assume { :end_inline_assert } true;main_#t~post33 := main_~i2~0;main_~i2~0 := main_#t~post33 + 1;havoc main_#t~post33; 105#L511-3true [2018-11-10 12:36:23,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:23,825 INFO L82 PathProgramCache]: Analyzing trace with hash 28928112, now seen corresponding path program 1 times [2018-11-10 12:36:23,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:36:23,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:36:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:23,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:23,955 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-10 12:36:23,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:23,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:36:23,961 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:36:23,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:23,961 INFO L82 PathProgramCache]: Analyzing trace with hash -404923018, now seen corresponding path program 1 times [2018-11-10 12:36:23,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:36:23,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:36:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:23,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:24,047 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-10 12:36:24,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:24,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:36:24,049 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:36:24,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:36:24,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:36:24,060 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2018-11-10 12:36:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:24,137 INFO L93 Difference]: Finished difference Result 110 states and 184 transitions. [2018-11-10 12:36:24,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:36:24,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 184 transitions. [2018-11-10 12:36:24,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-10 12:36:24,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 103 states and 138 transitions. [2018-11-10 12:36:24,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2018-11-10 12:36:24,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2018-11-10 12:36:24,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 138 transitions. [2018-11-10 12:36:24,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:36:24,147 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 138 transitions. [2018-11-10 12:36:24,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 138 transitions. [2018-11-10 12:36:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-10 12:36:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 12:36:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 138 transitions. [2018-11-10 12:36:24,175 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 138 transitions. [2018-11-10 12:36:24,175 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 138 transitions. [2018-11-10 12:36:24,175 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:36:24,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 138 transitions. [2018-11-10 12:36:24,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-10 12:36:24,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:36:24,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:36:24,179 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:24,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:24,179 INFO L793 eck$LassoCheckResult]: Stem: 329#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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 247#L272 assume ~r1~0 == 0; 305#L273 assume ~id1~0 >= 0; 236#L274 assume ~st1~0 == 0; 237#L275 assume ~send1~0 == ~id1~0; 293#L276 assume ~mode1~0 % 256 == 0; 248#L277 assume ~id2~0 >= 0; 249#L278 assume ~st2~0 == 0; 297#L279 assume ~send2~0 == ~id2~0; 298#L280 assume ~mode2~0 % 256 == 0; 324#L281 assume ~id3~0 >= 0; 266#L282 assume ~st3~0 == 0; 267#L283 assume ~send3~0 == ~id3~0; 306#L284 assume ~mode3~0 % 256 == 0; 238#L285 assume ~id4~0 >= 0; 239#L286 assume ~st4~0 == 0; 312#L287 assume ~send4~0 == ~id4~0; 250#L288 assume ~mode4~0 % 256 == 0; 251#L289 assume ~id5~0 >= 0; 299#L290 assume ~st5~0 == 0; 300#L291 assume ~send5~0 == ~id5~0; 325#L292 assume ~mode5~0 % 256 == 0; 268#L293 assume ~id6~0 >= 0; 269#L294 assume ~st6~0 == 0; 307#L295 assume ~send6~0 == ~id6~0; 242#L296 assume ~mode6~0 % 256 == 0; 243#L297 assume ~id1~0 != ~id2~0; 313#L298 assume ~id1~0 != ~id3~0; 254#L299 assume ~id1~0 != ~id4~0; 255#L300 assume ~id1~0 != ~id5~0; 303#L301 assume ~id1~0 != ~id6~0; 304#L302 assume ~id2~0 != ~id3~0; 317#L303 assume ~id2~0 != ~id4~0; 280#L304 assume ~id2~0 != ~id5~0; 281#L305 assume ~id2~0 != ~id6~0; 314#L306 assume ~id3~0 != ~id4~0; 252#L307 assume ~id3~0 != ~id5~0; 253#L308 assume ~id3~0 != ~id6~0; 308#L309 assume ~id4~0 != ~id5~0; 240#L310 assume ~id4~0 != ~id6~0; 241#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 327#L272-1 init_#res := init_~tmp~0; 301#L433 main_#t~ret31 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 302#L511-3 [2018-11-10 12:36:24,180 INFO L795 eck$LassoCheckResult]: Loop: 302#L511-3 assume true; 335#L511-1 assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 258#L120 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 259#L124 assume !(node1_~m1~0 != ~nomsg~0); 274#L124-1 ~mode1~0 := 0; 256#L120-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; 257#L146 assume !(~mode2~0 % 256 != 0); 320#L159 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 330#L159-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 311#L146-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; 318#L171 assume !(~mode3~0 % 256 != 0); 322#L184 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 331#L184-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; 309#L171-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 310#L196 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 288#L199 assume !(node4_~m4~0 != ~nomsg~0); 286#L199-1 ~mode4~0 := 0; 287#L196-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 290#L221 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 291#L224 assume !(node5_~m5~0 != ~nomsg~0); 294#L224-1 ~mode5~0 := 0; 284#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 285#L246 assume !(~mode6~0 % 256 != 0); 296#L259 assume !(~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0);node6_#t~ite5 := ~p6_new~0; 323#L259-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 276#L246-2 assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 277#L441 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 272#L441-1 check_#res := check_~tmp~1; 270#L461 main_#t~ret32 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;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; 244#L544 assume !(assert_~arg % 256 == 0); 245#L539 assume { :end_inline_assert } true;main_#t~post33 := main_~i2~0;main_~i2~0 := main_#t~post33 + 1;havoc main_#t~post33; 302#L511-3 [2018-11-10 12:36:24,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 1 times [2018-11-10 12:36:24,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:36:24,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:36:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:36:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:36:24,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:24,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1608069750, now seen corresponding path program 1 times [2018-11-10 12:36:24,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:36:24,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:36:24,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:24,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:24,323 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-10 12:36:24,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:24,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:36:24,324 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:36:24,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:36:24,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:36:24,324 INFO L87 Difference]: Start difference. First operand 103 states and 138 transitions. cyclomatic complexity: 36 Second operand 5 states. [2018-11-10 12:36:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:24,366 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2018-11-10 12:36:24,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:36:24,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 140 transitions. [2018-11-10 12:36:24,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-10 12:36:24,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 103 states and 135 transitions. [2018-11-10 12:36:24,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2018-11-10 12:36:24,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2018-11-10 12:36:24,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 135 transitions. [2018-11-10 12:36:24,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:36:24,370 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 135 transitions. [2018-11-10 12:36:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 135 transitions. [2018-11-10 12:36:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-10 12:36:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 12:36:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2018-11-10 12:36:24,373 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 135 transitions. [2018-11-10 12:36:24,373 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 135 transitions. [2018-11-10 12:36:24,373 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:36:24,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 135 transitions. [2018-11-10 12:36:24,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-10 12:36:24,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:36:24,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:36:24,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:24,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:24,376 INFO L793 eck$LassoCheckResult]: Stem: 550#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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 467#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 468#L272 assume ~r1~0 == 0; 526#L273 assume ~id1~0 >= 0; 457#L274 assume ~st1~0 == 0; 458#L275 assume ~send1~0 == ~id1~0; 514#L276 assume ~mode1~0 % 256 == 0; 469#L277 assume ~id2~0 >= 0; 470#L278 assume ~st2~0 == 0; 518#L279 assume ~send2~0 == ~id2~0; 519#L280 assume ~mode2~0 % 256 == 0; 545#L281 assume ~id3~0 >= 0; 487#L282 assume ~st3~0 == 0; 488#L283 assume ~send3~0 == ~id3~0; 527#L284 assume ~mode3~0 % 256 == 0; 459#L285 assume ~id4~0 >= 0; 460#L286 assume ~st4~0 == 0; 533#L287 assume ~send4~0 == ~id4~0; 471#L288 assume ~mode4~0 % 256 == 0; 472#L289 assume ~id5~0 >= 0; 520#L290 assume ~st5~0 == 0; 521#L291 assume ~send5~0 == ~id5~0; 546#L292 assume ~mode5~0 % 256 == 0; 489#L293 assume ~id6~0 >= 0; 490#L294 assume ~st6~0 == 0; 528#L295 assume ~send6~0 == ~id6~0; 463#L296 assume ~mode6~0 % 256 == 0; 464#L297 assume ~id1~0 != ~id2~0; 534#L298 assume ~id1~0 != ~id3~0; 475#L299 assume ~id1~0 != ~id4~0; 476#L300 assume ~id1~0 != ~id5~0; 524#L301 assume ~id1~0 != ~id6~0; 525#L302 assume ~id2~0 != ~id3~0; 538#L303 assume ~id2~0 != ~id4~0; 501#L304 assume ~id2~0 != ~id5~0; 502#L305 assume ~id2~0 != ~id6~0; 535#L306 assume ~id3~0 != ~id4~0; 473#L307 assume ~id3~0 != ~id5~0; 474#L308 assume ~id3~0 != ~id6~0; 529#L309 assume ~id4~0 != ~id5~0; 461#L310 assume ~id4~0 != ~id6~0; 462#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 548#L272-1 init_#res := init_~tmp~0; 522#L433 main_#t~ret31 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 523#L511-3 [2018-11-10 12:36:24,377 INFO L795 eck$LassoCheckResult]: Loop: 523#L511-3 assume true; 556#L511-1 assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 479#L120 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 480#L124 assume !(node1_~m1~0 != ~nomsg~0); 495#L124-1 ~mode1~0 := 0; 477#L120-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; 478#L146 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 540#L149 assume !(node2_~m2~0 != ~nomsg~0); 483#L149-1 ~mode2~0 := 0; 532#L146-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; 539#L171 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 536#L174 assume !(node3_~m3~0 != ~nomsg~0); 455#L174-1 ~mode3~0 := 0; 530#L171-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 531#L196 assume !(~mode4~0 % 256 != 0); 537#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 547#L209-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 508#L196-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 511#L221 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 512#L224 assume !(node5_~m5~0 != ~nomsg~0); 515#L224-1 ~mode5~0 := 0; 505#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 506#L246 assume !(~mode6~0 % 256 != 0); 517#L259 assume !(~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0);node6_#t~ite5 := ~p6_new~0; 544#L259-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 497#L246-2 assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 498#L441 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 484#L442 assume ~r1~0 >= 6; 485#L446 assume ~r1~0 < 6;check_~tmp~1 := 1; 493#L441-1 check_#res := check_~tmp~1; 491#L461 main_#t~ret32 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;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; 465#L544 assume !(assert_~arg % 256 == 0); 466#L539 assume { :end_inline_assert } true;main_#t~post33 := main_~i2~0;main_~i2~0 := main_#t~post33 + 1;havoc main_#t~post33; 523#L511-3 [2018-11-10 12:36:24,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:24,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 2 times [2018-11-10 12:36:24,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:36:24,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:36:24,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:24,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:36:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:36:24,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1453954416, now seen corresponding path program 1 times [2018-11-10 12:36:24,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:36:24,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:36:24,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:36:24,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:24,437 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-10 12:36:24,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:24,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:36:24,438 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:36:24,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:36:24,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:36:24,438 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. cyclomatic complexity: 33 Second operand 3 states. [2018-11-10 12:36:24,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:24,482 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2018-11-10 12:36:24,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:36:24,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 215 transitions. [2018-11-10 12:36:24,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2018-11-10 12:36:24,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 215 transitions. [2018-11-10 12:36:24,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-10 12:36:24,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2018-11-10 12:36:24,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 215 transitions. [2018-11-10 12:36:24,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:36:24,487 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2018-11-10 12:36:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 215 transitions. [2018-11-10 12:36:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-11-10 12:36:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 12:36:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2018-11-10 12:36:24,496 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2018-11-10 12:36:24,496 INFO L608 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2018-11-10 12:36:24,496 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:36:24,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 215 transitions. [2018-11-10 12:36:24,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2018-11-10 12:36:24,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:36:24,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:36:24,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:24,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:24,499 INFO L793 eck$LassoCheckResult]: Stem: 815#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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 732#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 733#L272 assume ~r1~0 == 0; 790#L273 assume ~id1~0 >= 0; 722#L274 assume ~st1~0 == 0; 723#L275 assume ~send1~0 == ~id1~0; 778#L276 assume ~mode1~0 % 256 == 0; 734#L277 assume ~id2~0 >= 0; 735#L278 assume ~st2~0 == 0; 782#L279 assume ~send2~0 == ~id2~0; 783#L280 assume ~mode2~0 % 256 == 0; 810#L281 assume ~id3~0 >= 0; 751#L282 assume ~st3~0 == 0; 752#L283 assume ~send3~0 == ~id3~0; 791#L284 assume ~mode3~0 % 256 == 0; 724#L285 assume ~id4~0 >= 0; 725#L286 assume ~st4~0 == 0; 797#L287 assume ~send4~0 == ~id4~0; 736#L288 assume ~mode4~0 % 256 == 0; 737#L289 assume ~id5~0 >= 0; 784#L290 assume ~st5~0 == 0; 785#L291 assume ~send5~0 == ~id5~0; 811#L292 assume ~mode5~0 % 256 == 0; 753#L293 assume ~id6~0 >= 0; 754#L294 assume ~st6~0 == 0; 792#L295 assume ~send6~0 == ~id6~0; 728#L296 assume ~mode6~0 % 256 == 0; 729#L297 assume ~id1~0 != ~id2~0; 798#L298 assume ~id1~0 != ~id3~0; 740#L299 assume ~id1~0 != ~id4~0; 741#L300 assume ~id1~0 != ~id5~0; 788#L301 assume ~id1~0 != ~id6~0; 789#L302 assume ~id2~0 != ~id3~0; 802#L303 assume ~id2~0 != ~id4~0; 765#L304 assume ~id2~0 != ~id5~0; 766#L305 assume ~id2~0 != ~id6~0; 799#L306 assume ~id3~0 != ~id4~0; 738#L307 assume ~id3~0 != ~id5~0; 739#L308 assume ~id3~0 != ~id6~0; 793#L309 assume ~id4~0 != ~id5~0; 726#L310 assume ~id4~0 != ~id6~0; 727#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 813#L272-1 init_#res := init_~tmp~0; 786#L433 main_#t~ret31 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 787#L511-3 [2018-11-10 12:36:24,499 INFO L795 eck$LassoCheckResult]: Loop: 787#L511-3 assume true; 871#L511-1 assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 870#L120 assume !(~mode1~0 % 256 != 0); 869#L134 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 868#L134-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 804#L120-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; 864#L146 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 865#L149 assume !(node2_~m2~0 != ~nomsg~0); 861#L149-1 ~mode2~0 := 0; 858#L146-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; 856#L171 assume !(~mode3~0 % 256 != 0); 855#L184 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 854#L184-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; 852#L171-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 851#L196 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 848#L199 assume !(node4_~m4~0 != ~nomsg~0); 846#L199-1 ~mode4~0 := 0; 844#L196-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 842#L221 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 840#L224 assume !(node5_~m5~0 != ~nomsg~0); 838#L224-1 ~mode5~0 := 0; 835#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 834#L246 assume ~mode6~0 % 256 != 0;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 832#L249 assume !(node6_~m6~0 != ~nomsg~0); 829#L249-1 ~mode6~0 := 0; 827#L246-2 assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 826#L441 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 825#L442 assume !(~r1~0 >= 6); 823#L445 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 == 0; 824#L446 assume ~r1~0 < 6;check_~tmp~1 := 1; 836#L441-1 check_#res := check_~tmp~1; 874#L461 main_#t~ret32 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;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; 873#L544 assume !(assert_~arg % 256 == 0); 872#L539 assume { :end_inline_assert } true;main_#t~post33 := main_~i2~0;main_~i2~0 := main_#t~post33 + 1;havoc main_#t~post33; 787#L511-3 [2018-11-10 12:36:24,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:24,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 3 times [2018-11-10 12:36:24,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:36:24,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:36:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:36:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:36:24,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2079361520, now seen corresponding path program 1 times [2018-11-10 12:36:24,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:36:24,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:36:24,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:36:24,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:36:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:36:24,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash -858901968, now seen corresponding path program 1 times [2018-11-10 12:36:24,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:36:24,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:36:24,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:24,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:36:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:24,630 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-10 12:36:24,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:24,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:36:24,989 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 161 [2018-11-10 12:36:25,931 WARN L179 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 140 [2018-11-10 12:36:25,938 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:36:25,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:36:25,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:36:25,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:36:25,939 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:36:25,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:36:25,940 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:36:25,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:36:25,940 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2018-11-10 12:36:25,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:36:25,940 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:36:25,975 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-10 12:36:25,983 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-10 12:36:25,985 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-10 12:36:25,987 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-10 12:36:25,988 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-10 12:36:25,994 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-10 12:36:25,995 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-10 12:36:26,000 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-10 12:36:26,001 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-10 12:36:26,003 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-10 12:36:26,004 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-10 12:36:26,005 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-10 12:36:26,008 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-10 12:36:26,009 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-10 12:36:26,010 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-10 12:36:26,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:36:26,014 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-10 12:36:26,017 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-10 12:36:26,118 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-10 12:36:26,121 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-10 12:36:26,125 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-10 12:36:26,126 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-10 12:36:26,128 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-10 12:36:26,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:36:26,131 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-10 12:36:26,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:36:26,134 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-10 12:36:26,135 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-10 12:36:26,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:36:26,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:36:26,143 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-10 12:36:26,144 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-10 12:36:26,382 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 12:36:26,440 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 12:36:30,767 WARN L179 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2018-11-10 12:36:30,825 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:36:30,825 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/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-10 12:36:30,830 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:36:30,830 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4afabc50-be95-4b7a-9181-93ebf95701c0/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-10 12:36:30,866 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:36:30,866 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:36:30,980 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:36:30,982 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:36:30,982 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:36:30,982 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:36:30,982 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:36:30,982 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:36:30,982 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:36:30,982 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:36:30,982 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:36:30,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2018-11-10 12:36:30,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:36:30,982 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:36:30,992 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-10 12:36:31,004 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-10 12:36:31,006 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-10 12:36:31,007 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-10 12:36:31,008 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-10 12:36:31,014 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-10 12:36:31,015 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-10 12:36:31,016 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-10 12:36:31,019 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-10 12:36:31,021 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-10 12:36:31,022 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-10 12:36:31,034 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-10 12:36:31,035 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-10 12:36:31,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:36:31,037 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-10 12:36:31,040 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-10 12:36:31,041 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-10 12:36:31,042 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-10 12:36:31,045 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-10 12:36:31,143 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-10 12:36:31,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:36:31,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:36:31,149 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-10 12:36:31,152 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-10 12:36:31,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:36:31,158 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-10 12:36:31,160 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-10 12:36:31,161 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-10 12:36:31,162 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-10 12:36:31,165 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-10 12:36:31,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:36:31,170 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-10 12:36:31,410 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 12:36:31,464 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 12:36:35,622 WARN L179 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2018-11-10 12:36:35,669 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:36:35,674 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:36:35,675 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-10 12:36:35,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:36:35,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:36:35,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:36:35,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,682 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-10 12:36:35,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:36:35,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:36:35,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,687 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-10 12:36:35,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:36:35,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:36:35,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:36:35,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,693 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-10 12:36:35,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:36:35,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:36:35,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:36:35,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,695 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-10 12:36:35,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:36:35,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:36:35,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:36:35,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,697 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-10 12:36:35,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:36:35,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:36:35,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:36:35,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,699 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-10 12:36:35,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:36:35,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:36:35,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,703 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-10 12:36:35,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:36:35,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:36:35,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:36:35,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,707 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-10 12:36:35,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:36:35,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:36:35,711 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,711 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-10 12:36:35,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:36:35,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:36:35,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,715 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-10 12:36:35,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:36:35,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:36:35,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:36:35,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,718 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-10 12:36:35,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:36:35,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:36:35,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:36:35,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,720 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-10 12:36:35,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:36:35,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:36:35,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,724 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-10 12:36:35,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:36:35,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:36:35,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:36:35,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:36:35,726 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-10 12:36:35,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:36:35,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:36:35,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:36:35,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:36:35,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:36:35,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:36:35,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:36:35,728 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:36:35,731 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:36:35,731 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:36:35,733 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:36:35,733 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:36:35,733 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:36:35,733 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2018-11-10 12:36:35,734 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:36:35,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:35,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:36:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:35,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:36:35,844 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-10 12:36:35,848 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-10 12:36:35,849 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 156 states and 215 transitions. cyclomatic complexity: 60 Second operand 4 states. [2018-11-10 12:36:35,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 156 states and 215 transitions. cyclomatic complexity: 60. Second operand 4 states. Result 267 states and 386 transitions. Complement of second has 6 states. [2018-11-10 12:36:35,899 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-10 12:36:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:36:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2018-11-10 12:36:35,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 44 letters. Loop has 34 letters. [2018-11-10 12:36:35,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:36:35,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 78 letters. Loop has 34 letters. [2018-11-10 12:36:35,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:36:35,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 44 letters. Loop has 68 letters. [2018-11-10 12:36:35,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:36:35,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 386 transitions. [2018-11-10 12:36:35,909 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:36:35,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 0 states and 0 transitions. [2018-11-10 12:36:35,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:36:35,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:36:35,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:36:35,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:36:35,909 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:36:35,909 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:36:35,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:36:35,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:36:35,910 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 12:36:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:35,910 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 12:36:35,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:36:35,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 12:36:35,910 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:36:35,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:36:35,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:36:35,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:36:35,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:36:35,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:36:35,911 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:36:35,911 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:36:35,911 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:36:35,911 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:36:35,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:36:35,911 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:36:35,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:36:35,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:36:35 BoogieIcfgContainer [2018-11-10 12:36:35,921 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:36:35,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:36:35,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:36:35,921 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:36:35,922 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:36:23" (3/4) ... [2018-11-10 12:36:35,924 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:36:35,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:36:35,925 INFO L168 Benchmark]: Toolchain (without parser) took 12994.93 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 212.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:36:35,926 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:36:35,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.30 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 941.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:36:35,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:36:35,927 INFO L168 Benchmark]: Boogie Preprocessor took 23.81 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:36:35,927 INFO L168 Benchmark]: RCFGBuilder took 463.25 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: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:36:35,928 INFO L168 Benchmark]: BuchiAutomizer took 12188.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.9 MB). Peak memory consumption was 199.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:36:35,928 INFO L168 Benchmark]: Witness Printer took 3.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:36:35,931 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.30 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 941.5 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 70.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.81 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 463.25 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: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12188.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.9 MB). Peak memory consumption was 199.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 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 12.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 11.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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 156 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 658 SDtfs, 215 SDslu, 937 SDs, 0 SdLazy, 32 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital742 mio100 ax109 hnf102 lsp20 ukn72 mio100 lsp100 div153 bol100 ite100 ukn100 eq177 hnf71 smp100 dnf5369 smp24 tf100 neg98 sie103 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.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...