./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/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.25-f470102 [2019-12-07 14:37:31,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:37:31,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:37:31,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:37:31,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:37:31,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:37:31,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:37:31,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:37:31,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:37:31,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:37:31,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:37:31,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:37:31,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:37:31,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:37:31,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:37:31,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:37:31,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:37:31,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:37:31,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:37:31,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:37:31,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:37:31,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:37:31,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:37:31,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:37:31,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:37:31,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:37:31,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:37:31,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:37:31,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:37:31,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:37:31,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:37:31,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:37:31,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:37:31,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:37:31,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:37:31,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:37:31,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:37:31,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:37:31,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:37:31,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:37:31,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:37:31,791 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 14:37:31,802 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:37:31,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:37:31,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:37:31,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:37:31,803 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:37:31,803 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 14:37:31,803 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 14:37:31,804 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 14:37:31,804 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 14:37:31,804 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 14:37:31,804 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 14:37:31,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:37:31,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:37:31,804 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:37:31,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:37:31,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:37:31,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:37:31,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 14:37:31,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 14:37:31,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 14:37:31,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:37:31,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:37:31,805 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 14:37:31,805 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:37:31,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 14:37:31,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:37:31,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:37:31,806 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 14:37:31,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:37:31,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:37:31,806 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:37:31,806 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 14:37:31,807 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 14:37:31,807 INFO L138 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/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/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 [2019-12-07 14:37:31,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:37:31,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:37:31,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:37:31,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:37:31,925 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:37:31,925 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2019-12-07 14:37:31,971 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/data/d5d1b2a73/fbd8ebbc19974221adc4940b53dd18f5/FLAG0daf17269 [2019-12-07 14:37:32,323 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:37:32,323 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2019-12-07 14:37:32,330 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/data/d5d1b2a73/fbd8ebbc19974221adc4940b53dd18f5/FLAG0daf17269 [2019-12-07 14:37:32,733 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/data/d5d1b2a73/fbd8ebbc19974221adc4940b53dd18f5 [2019-12-07 14:37:32,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:37:32,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:37:32,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:37:32,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:37:32,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:37:32,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:37:32" (1/1) ... [2019-12-07 14:37:32,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf3238d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:32, skipping insertion in model container [2019-12-07 14:37:32,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:37:32" (1/1) ... [2019-12-07 14:37:32,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:37:32,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:37:32,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:37:32,951 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:37:32,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:37:33,002 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:37:33,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33 WrapperNode [2019-12-07 14:37:33,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:37:33,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:37:33,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:37:33,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:37:33,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (1/1) ... [2019-12-07 14:37:33,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (1/1) ... [2019-12-07 14:37:33,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:37:33,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:37:33,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:37:33,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:37:33,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (1/1) ... [2019-12-07 14:37:33,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (1/1) ... [2019-12-07 14:37:33,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (1/1) ... [2019-12-07 14:37:33,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (1/1) ... [2019-12-07 14:37:33,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (1/1) ... [2019-12-07 14:37:33,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (1/1) ... [2019-12-07 14:37:33,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (1/1) ... [2019-12-07 14:37:33,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:37:33,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:37:33,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:37:33,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:37:33,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/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 [2019-12-07 14:37:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:37:33,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:37:33,436 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:37:33,436 INFO L287 CfgBuilder]: Removed 23 assume(true) statements. [2019-12-07 14:37:33,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:37:33 BoogieIcfgContainer [2019-12-07 14:37:33,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:37:33,437 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 14:37:33,437 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 14:37:33,439 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 14:37:33,440 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:37:33,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 02:37:32" (1/3) ... [2019-12-07 14:37:33,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27011a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 02:37:33, skipping insertion in model container [2019-12-07 14:37:33,441 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:37:33,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:33" (2/3) ... [2019-12-07 14:37:33,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27011a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 02:37:33, skipping insertion in model container [2019-12-07 14:37:33,441 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:37:33,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:37:33" (3/3) ... [2019-12-07 14:37:33,442 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c [2019-12-07 14:37:33,469 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 14:37:33,469 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 14:37:33,469 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 14:37:33,469 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:37:33,469 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:37:33,469 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 14:37:33,469 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:37:33,469 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 14:37:33,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2019-12-07 14:37:33,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-12-07 14:37:33,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:37:33,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:37:33,507 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 14:37:33,507 INFO L850 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] [2019-12-07 14:37:33,507 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 14:37:33,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2019-12-07 14:37:33,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-12-07 14:37:33,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:37:33,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:37:33,513 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 14:37:33,513 INFO L850 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] [2019-12-07 14:37:33,518 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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 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;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 88#L272true assume !(0 == ~r1~0);init_~tmp~0 := 0; 86#L272-1true init_#res := init_~tmp~0; 39#L433true main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 102#L511-2true [2019-12-07 14:37:33,519 INFO L796 eck$LassoCheckResult]: Loop: 102#L511-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 15#L120true assume !(0 != ~mode1~0 % 256); 97#L134true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 109#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 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 62#L146true assume 0 != ~mode2~0 % 256;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 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 66#L171true assume 0 != ~mode3~0 % 256;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 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 56#L196true assume 0 != ~mode4~0 % 256;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 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 33#L221true assume !(0 != ~mode5~0 % 256); 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 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 37#L246true assume !(0 != ~mode6~0 % 256); 70#L259true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~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 ~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;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;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 8#L544true assume !(0 == assert_~arg % 256); 95#L539true main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 102#L511-2true [2019-12-07 14:37:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash 28928112, now seen corresponding path program 1 times [2019-12-07 14:37:33,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:33,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944397986] [2019-12-07 14:37:33,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:37:33,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944397986] [2019-12-07 14:37:33,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:33,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:37:33,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559939180] [2019-12-07 14:37:33,677 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:37:33,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash 15305473, now seen corresponding path program 1 times [2019-12-07 14:37:33,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:33,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983306288] [2019-12-07 14:37:33,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:37:33,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983306288] [2019-12-07 14:37:33,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:33,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:37:33,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921100454] [2019-12-07 14:37:33,768 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 14:37:33,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:33,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:33,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:33,780 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2019-12-07 14:37:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:33,842 INFO L93 Difference]: Finished difference Result 109 states and 183 transitions. [2019-12-07 14:37:33,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:33,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 183 transitions. [2019-12-07 14:37:33,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-12-07 14:37:33,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 102 states and 137 transitions. [2019-12-07 14:37:33,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-12-07 14:37:33,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2019-12-07 14:37:33,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 137 transitions. [2019-12-07 14:37:33,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:37:33,852 INFO L688 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2019-12-07 14:37:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 137 transitions. [2019-12-07 14:37:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-07 14:37:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 14:37:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2019-12-07 14:37:33,874 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2019-12-07 14:37:33,874 INFO L591 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2019-12-07 14:37:33,874 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 14:37:33,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 137 transitions. [2019-12-07 14:37:33,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-12-07 14:37:33,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:37:33,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:37:33,877 INFO L849 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] [2019-12-07 14:37:33,877 INFO L850 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] [2019-12-07 14:37:33,877 INFO L794 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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]; 244#L-1 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;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 245#L272 assume 0 == ~r1~0; 303#L273 assume ~id1~0 >= 0; 234#L274 assume 0 == ~st1~0; 235#L275 assume ~send1~0 == ~id1~0; 291#L276 assume 0 == ~mode1~0 % 256; 246#L277 assume ~id2~0 >= 0; 247#L278 assume 0 == ~st2~0; 295#L279 assume ~send2~0 == ~id2~0; 296#L280 assume 0 == ~mode2~0 % 256; 322#L281 assume ~id3~0 >= 0; 264#L282 assume 0 == ~st3~0; 265#L283 assume ~send3~0 == ~id3~0; 304#L284 assume 0 == ~mode3~0 % 256; 236#L285 assume ~id4~0 >= 0; 237#L286 assume 0 == ~st4~0; 310#L287 assume ~send4~0 == ~id4~0; 248#L288 assume 0 == ~mode4~0 % 256; 249#L289 assume ~id5~0 >= 0; 297#L290 assume 0 == ~st5~0; 298#L291 assume ~send5~0 == ~id5~0; 323#L292 assume 0 == ~mode5~0 % 256; 266#L293 assume ~id6~0 >= 0; 267#L294 assume 0 == ~st6~0; 305#L295 assume ~send6~0 == ~id6~0; 240#L296 assume 0 == ~mode6~0 % 256; 241#L297 assume ~id1~0 != ~id2~0; 311#L298 assume ~id1~0 != ~id3~0; 252#L299 assume ~id1~0 != ~id4~0; 253#L300 assume ~id1~0 != ~id5~0; 301#L301 assume ~id1~0 != ~id6~0; 302#L302 assume ~id2~0 != ~id3~0; 315#L303 assume ~id2~0 != ~id4~0; 278#L304 assume ~id2~0 != ~id5~0; 279#L305 assume ~id2~0 != ~id6~0; 312#L306 assume ~id3~0 != ~id4~0; 250#L307 assume ~id3~0 != ~id5~0; 251#L308 assume ~id3~0 != ~id6~0; 306#L309 assume ~id4~0 != ~id5~0; 238#L310 assume ~id4~0 != ~id6~0; 239#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 325#L272-1 init_#res := init_~tmp~0; 299#L433 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 300#L511-2 [2019-12-07 14:37:33,878 INFO L796 eck$LassoCheckResult]: Loop: 300#L511-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 256#L120 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 257#L124 assume !(node1_~m1~0 != ~nomsg~0); 272#L124-1 ~mode1~0 := 0; 254#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 255#L146 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 317#L149 assume !(node2_~m2~0 != ~nomsg~0); 260#L149-1 ~mode2~0 := 0; 309#L146-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 316#L171 assume !(0 != ~mode3~0 % 256); 320#L184 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 329#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; 307#L171-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 308#L196 assume !(0 != ~mode4~0 % 256); 314#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 324#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; 285#L196-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 288#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 289#L224 assume !(node5_~m5~0 != ~nomsg~0); 292#L224-1 ~mode5~0 := 0; 282#L221-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 283#L246 assume !(0 != ~mode6~0 % 256); 294#L259 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 321#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; 274#L246-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 275#L441 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 270#L441-1 check_#res := check_~tmp~1; 268#L461 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 242#L544 assume !(0 == assert_~arg % 256); 243#L539 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 300#L511-2 [2019-12-07 14:37:33,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:33,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 1 times [2019-12-07 14:37:33,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:33,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958589291] [2019-12-07 14:37:33,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:37:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:37:33,960 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:37:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:33,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1179596289, now seen corresponding path program 1 times [2019-12-07 14:37:33,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:33,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364561952] [2019-12-07 14:37:33,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:37:34,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364561952] [2019-12-07 14:37:34,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:34,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:37:34,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391841118] [2019-12-07 14:37:34,030 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 14:37:34,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:34,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:37:34,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:34,031 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. cyclomatic complexity: 36 Second operand 5 states. [2019-12-07 14:37:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:34,066 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2019-12-07 14:37:34,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:37:34,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 139 transitions. [2019-12-07 14:37:34,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-12-07 14:37:34,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 102 states and 134 transitions. [2019-12-07 14:37:34,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-12-07 14:37:34,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2019-12-07 14:37:34,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 134 transitions. [2019-12-07 14:37:34,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:37:34,070 INFO L688 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-12-07 14:37:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 134 transitions. [2019-12-07 14:37:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-07 14:37:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 14:37:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2019-12-07 14:37:34,075 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-12-07 14:37:34,075 INFO L591 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-12-07 14:37:34,075 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 14:37:34,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 134 transitions. [2019-12-07 14:37:34,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-12-07 14:37:34,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:37:34,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:37:34,078 INFO L849 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] [2019-12-07 14:37:34,078 INFO L850 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] [2019-12-07 14:37:34,078 INFO L794 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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]; 463#L-1 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;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 464#L272 assume 0 == ~r1~0; 522#L273 assume ~id1~0 >= 0; 453#L274 assume 0 == ~st1~0; 454#L275 assume ~send1~0 == ~id1~0; 510#L276 assume 0 == ~mode1~0 % 256; 465#L277 assume ~id2~0 >= 0; 466#L278 assume 0 == ~st2~0; 514#L279 assume ~send2~0 == ~id2~0; 515#L280 assume 0 == ~mode2~0 % 256; 541#L281 assume ~id3~0 >= 0; 483#L282 assume 0 == ~st3~0; 484#L283 assume ~send3~0 == ~id3~0; 523#L284 assume 0 == ~mode3~0 % 256; 455#L285 assume ~id4~0 >= 0; 456#L286 assume 0 == ~st4~0; 529#L287 assume ~send4~0 == ~id4~0; 467#L288 assume 0 == ~mode4~0 % 256; 468#L289 assume ~id5~0 >= 0; 516#L290 assume 0 == ~st5~0; 517#L291 assume ~send5~0 == ~id5~0; 542#L292 assume 0 == ~mode5~0 % 256; 485#L293 assume ~id6~0 >= 0; 486#L294 assume 0 == ~st6~0; 524#L295 assume ~send6~0 == ~id6~0; 459#L296 assume 0 == ~mode6~0 % 256; 460#L297 assume ~id1~0 != ~id2~0; 530#L298 assume ~id1~0 != ~id3~0; 471#L299 assume ~id1~0 != ~id4~0; 472#L300 assume ~id1~0 != ~id5~0; 520#L301 assume ~id1~0 != ~id6~0; 521#L302 assume ~id2~0 != ~id3~0; 534#L303 assume ~id2~0 != ~id4~0; 497#L304 assume ~id2~0 != ~id5~0; 498#L305 assume ~id2~0 != ~id6~0; 531#L306 assume ~id3~0 != ~id4~0; 469#L307 assume ~id3~0 != ~id5~0; 470#L308 assume ~id3~0 != ~id6~0; 525#L309 assume ~id4~0 != ~id5~0; 457#L310 assume ~id4~0 != ~id6~0; 458#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 544#L272-1 init_#res := init_~tmp~0; 518#L433 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 519#L511-2 [2019-12-07 14:37:34,078 INFO L796 eck$LassoCheckResult]: Loop: 519#L511-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 475#L120 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 476#L124 assume !(node1_~m1~0 != ~nomsg~0); 491#L124-1 ~mode1~0 := 0; 473#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 474#L146 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 536#L149 assume !(node2_~m2~0 != ~nomsg~0); 479#L149-1 ~mode2~0 := 0; 528#L146-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 535#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 532#L174 assume !(node3_~m3~0 != ~nomsg~0); 451#L174-1 ~mode3~0 := 0; 526#L171-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 527#L196 assume !(0 != ~mode4~0 % 256); 533#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 543#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; 504#L196-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 507#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 508#L224 assume !(node5_~m5~0 != ~nomsg~0); 511#L224-1 ~mode5~0 := 0; 501#L221-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 502#L246 assume !(0 != ~mode6~0 % 256); 513#L259 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 540#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; 493#L246-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 494#L441 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 480#L442 assume ~r1~0 >= 6; 481#L446 assume ~r1~0 < 6;check_~tmp~1 := 1; 489#L441-1 check_#res := check_~tmp~1; 487#L461 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 461#L544 assume !(0 == assert_~arg % 256); 462#L539 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 519#L511-2 [2019-12-07 14:37:34,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:34,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 2 times [2019-12-07 14:37:34,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:34,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827746861] [2019-12-07 14:37:34,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:37:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:37:34,113 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:37:34,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:34,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1341300421, now seen corresponding path program 1 times [2019-12-07 14:37:34,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:34,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190832833] [2019-12-07 14:37:34,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:37:34,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190832833] [2019-12-07 14:37:34,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:34,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:37:34,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361967975] [2019-12-07 14:37:34,132 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 14:37:34,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:34,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:37:34,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:37:34,132 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. cyclomatic complexity: 33 Second operand 3 states. [2019-12-07 14:37:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:34,150 INFO L93 Difference]: Finished difference Result 154 states and 213 transitions. [2019-12-07 14:37:34,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:37:34,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 213 transitions. [2019-12-07 14:37:34,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2019-12-07 14:37:34,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 213 transitions. [2019-12-07 14:37:34,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-12-07 14:37:34,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-12-07 14:37:34,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 213 transitions. [2019-12-07 14:37:34,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:37:34,154 INFO L688 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-12-07 14:37:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 213 transitions. [2019-12-07 14:37:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-12-07 14:37:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 14:37:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-12-07 14:37:34,160 INFO L711 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-12-07 14:37:34,161 INFO L591 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-12-07 14:37:34,161 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 14:37:34,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 213 transitions. [2019-12-07 14:37:34,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2019-12-07 14:37:34,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:37:34,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:37:34,163 INFO L849 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] [2019-12-07 14:37:34,163 INFO L850 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] [2019-12-07 14:37:34,163 INFO L794 eck$LassoCheckResult]: Stem: 808#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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]; 725#L-1 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;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 726#L272 assume 0 == ~r1~0; 783#L273 assume ~id1~0 >= 0; 715#L274 assume 0 == ~st1~0; 716#L275 assume ~send1~0 == ~id1~0; 771#L276 assume 0 == ~mode1~0 % 256; 727#L277 assume ~id2~0 >= 0; 728#L278 assume 0 == ~st2~0; 775#L279 assume ~send2~0 == ~id2~0; 776#L280 assume 0 == ~mode2~0 % 256; 803#L281 assume ~id3~0 >= 0; 744#L282 assume 0 == ~st3~0; 745#L283 assume ~send3~0 == ~id3~0; 784#L284 assume 0 == ~mode3~0 % 256; 717#L285 assume ~id4~0 >= 0; 718#L286 assume 0 == ~st4~0; 790#L287 assume ~send4~0 == ~id4~0; 729#L288 assume 0 == ~mode4~0 % 256; 730#L289 assume ~id5~0 >= 0; 777#L290 assume 0 == ~st5~0; 778#L291 assume ~send5~0 == ~id5~0; 804#L292 assume 0 == ~mode5~0 % 256; 746#L293 assume ~id6~0 >= 0; 747#L294 assume 0 == ~st6~0; 785#L295 assume ~send6~0 == ~id6~0; 721#L296 assume 0 == ~mode6~0 % 256; 722#L297 assume ~id1~0 != ~id2~0; 791#L298 assume ~id1~0 != ~id3~0; 733#L299 assume ~id1~0 != ~id4~0; 734#L300 assume ~id1~0 != ~id5~0; 781#L301 assume ~id1~0 != ~id6~0; 782#L302 assume ~id2~0 != ~id3~0; 795#L303 assume ~id2~0 != ~id4~0; 758#L304 assume ~id2~0 != ~id5~0; 759#L305 assume ~id2~0 != ~id6~0; 792#L306 assume ~id3~0 != ~id4~0; 731#L307 assume ~id3~0 != ~id5~0; 732#L308 assume ~id3~0 != ~id6~0; 786#L309 assume ~id4~0 != ~id5~0; 719#L310 assume ~id4~0 != ~id6~0; 720#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 806#L272-1 init_#res := init_~tmp~0; 779#L433 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 780#L511-2 [2019-12-07 14:37:34,163 INFO L796 eck$LassoCheckResult]: Loop: 780#L511-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 861#L120 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 738#L124 assume !(node1_~m1~0 != ~nomsg~0); 752#L124-1 ~mode1~0 := 0; 797#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 858#L146 assume !(0 != ~mode2~0 % 256); 854#L159 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 853#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; 851#L146-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 850#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 848#L174 assume !(node3_~m3~0 != ~nomsg~0); 844#L174-1 ~mode3~0 := 0; 843#L171-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 842#L196 assume !(0 != ~mode4~0 % 256); 838#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 837#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; 835#L196-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 834#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 832#L224 assume !(node5_~m5~0 != ~nomsg~0); 829#L224-1 ~mode5~0 := 0; 827#L221-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 826#L246 assume !(0 != ~mode6~0 % 256); 822#L259 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 820#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; 819#L246-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 818#L441 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 817#L442 assume !(~r1~0 >= 6); 815#L445 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 816#L446 assume ~r1~0 < 6;check_~tmp~1 := 1; 865#L441-1 check_#res := check_~tmp~1; 864#L461 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 863#L544 assume !(0 == assert_~arg % 256); 862#L539 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 780#L511-2 [2019-12-07 14:37:34,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:34,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 3 times [2019-12-07 14:37:34,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:34,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621218202] [2019-12-07 14:37:34,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:37:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:37:34,194 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:37:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:34,194 INFO L82 PathProgramCache]: Analyzing trace with hash 636710160, now seen corresponding path program 1 times [2019-12-07 14:37:34,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:34,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264423542] [2019-12-07 14:37:34,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:37:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:37:34,217 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:37:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1784458480, now seen corresponding path program 1 times [2019-12-07 14:37:34,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:34,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152101544] [2019-12-07 14:37:34,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:37:34,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152101544] [2019-12-07 14:37:34,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:34,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:37:34,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178618280] [2019-12-07 14:37:34,699 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 173 [2019-12-07 14:37:40,355 WARN L192 SmtUtils]: Spent 5.59 s on a formula simplification. DAG size of input: 186 DAG size of output: 167 [2019-12-07 14:37:40,366 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 14:37:40,366 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 14:37:40,366 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 14:37:40,366 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 14:37:40,366 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 14:37:40,366 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:37:40,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 14:37:40,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 14:37:40,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2019-12-07 14:37:40,367 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 14:37:40,367 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 14:37:40,382 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 14:37:40,515 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 11692 disjunctions. This might take some time... [2019-12-07 14:37:40,914 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 60 disjunctions. [2019-12-07 14:37:40,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,087 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-12-07 14:37:41,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:37:41,391 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-12-07 14:37:41,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 14:38:22,690 WARN L192 SmtUtils]: Spent 41.03 s on a formula simplification. DAG size of input: 647 DAG size of output: 199 [2019-12-07 14:38:22,882 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 14:38:22,882 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/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 [2019-12-07 14:38:22,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 14:38:22,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 14:38:27,575 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 14:38:27,575 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p1_old~0=32, ~send6~0=-224, ~nomsg~0=32, ULTIMATE.start_node4_~m4~0=32, ~p6_new~0=32, ULTIMATE.start_node5_~m5~0=32, ~p5_new~0=32, ~p2_old~0=32, ~p4_old~0=32, ~p5_old~0=32, ~p3_old~0=32, ULTIMATE.start_node2_~m2~0=32, ~p4_new~0=32, ~p1_new~0=32, ~p2_new~0=32, ~p3_new~0=32, ~p6_old~0=32, ULTIMATE.start_node1_~m1~0=32, ~send2~0=-224, ULTIMATE.start_node6_~m6~0=32, ~send4~0=-224, ULTIMATE.start_node3_~m3~0=32} Honda state: {~p1_old~0=32, ~send6~0=-224, ~nomsg~0=32, ULTIMATE.start_node4_~m4~0=32, ~p6_new~0=32, ULTIMATE.start_node5_~m5~0=32, ~p5_new~0=32, ~p2_old~0=32, ~p4_old~0=32, ~p5_old~0=32, ~p3_old~0=32, ULTIMATE.start_node2_~m2~0=32, ~p4_new~0=32, ~p1_new~0=32, ~p2_new~0=32, ~p3_new~0=32, ~p6_old~0=32, ULTIMATE.start_node1_~m1~0=32, ~send2~0=-224, ULTIMATE.start_node6_~m6~0=32, ~send4~0=-224, ULTIMATE.start_node3_~m3~0=32} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/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 [2019-12-07 14:38:27,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 14:38:27,589 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:38:27,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 14:38:27,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 14:38:27,720 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 14:38:27,721 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 14:38:27,722 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 14:38:27,722 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 14:38:27,722 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 14:38:27,722 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 14:38:27,722 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:38:27,722 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 14:38:27,722 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 14:38:27,722 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2019-12-07 14:38:27,722 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 14:38:27,722 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 14:38:27,725 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 14:38:27,816 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 11692 disjunctions. This might take some time... [2019-12-07 14:38:28,185 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 60 disjunctions. [2019-12-07 14:38:28,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,431 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-12-07 14:38:28,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:28,801 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-12-07 14:38:28,808 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 14:39:10,392 WARN L192 SmtUtils]: Spent 41.38 s on a formula simplification. DAG size of input: 647 DAG size of output: 199 [2019-12-07 14:39:10,424 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 14:39:10,429 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,441 INFO L120 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 [2019-12-07 14:39:10,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,453 INFO L120 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 [2019-12-07 14:39:10,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,460 INFO L120 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 [2019-12-07 14:39:10,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:39:10,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:39:10,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,473 INFO L120 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 [2019-12-07 14:39:10,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,481 INFO L120 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 [2019-12-07 14:39:10,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,488 INFO L120 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 [2019-12-07 14:39:10,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,497 INFO L120 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 [2019-12-07 14:39:10,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,499 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-12-07 14:39:10,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,501 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-12-07 14:39:10,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,508 INFO L120 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 [2019-12-07 14:39:10,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:39:10,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:39:10,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,519 INFO L120 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 [2019-12-07 14:39:10,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,528 INFO L120 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 [2019-12-07 14:39:10,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:39:10,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:39:10,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,543 INFO L120 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 [2019-12-07 14:39:10,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:39:10,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:39:10,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,553 INFO L120 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 [2019-12-07 14:39:10,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,565 INFO L120 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 [2019-12-07 14:39:10,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,573 INFO L120 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 [2019-12-07 14:39:10,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:39:10,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:39:10,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,583 INFO L120 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 [2019-12-07 14:39:10,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:39:10,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:39:10,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,592 INFO L120 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 [2019-12-07 14:39:10,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,598 INFO L120 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 [2019-12-07 14:39:10,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,606 INFO L120 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 [2019-12-07 14:39:10,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:39:10,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:39:10,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:39:10,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:39:10,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:39:10,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:39:10,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:39:10,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 14:39:10,613 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 14:39:10,613 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7399e951-be61-4d7e-a1d7-a74b077531ef/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:39:10,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 14:39:10,619 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 14:39:10,620 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 14:39:10,620 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2019-12-07 14:39:10,622 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 14:39:10,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:10,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:39:10,677 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:39:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:10,702 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:39:10,703 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:39:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:39:10,721 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 [2019-12-07 14:39:10,721 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60 Second operand 3 states. [2019-12-07 14:39:10,756 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60. Second operand 3 states. Result 263 states and 382 transitions. Complement of second has 4 states. [2019-12-07 14:39:10,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-12-07 14:39:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 14:39:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2019-12-07 14:39:10,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 33 letters. [2019-12-07 14:39:10,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:39:10,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 77 letters. Loop has 33 letters. [2019-12-07 14:39:10,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:39:10,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 66 letters. [2019-12-07 14:39:10,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:39:10,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 382 transitions. [2019-12-07 14:39:10,763 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 14:39:10,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 0 states and 0 transitions. [2019-12-07 14:39:10,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 14:39:10,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 14:39:10,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 14:39:10,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:39:10,764 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:39:10,764 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:39:10,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:39:10,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:39:10,764 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-12-07 14:39:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:10,764 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-12-07 14:39:10,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 14:39:10,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-12-07 14:39:10,764 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 14:39:10,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:39:10,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 14:39:10,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 14:39:10,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 14:39:10,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:39:10,765 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:39:10,765 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:39:10,765 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:39:10,765 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 14:39:10,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:39:10,765 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 14:39:10,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 14:39:10,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 02:39:10 BoogieIcfgContainer [2019-12-07 14:39:10,769 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 14:39:10,769 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:39:10,769 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:39:10,770 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:39:10,770 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:37:33" (3/4) ... [2019-12-07 14:39:10,772 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:39:10,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:39:10,773 INFO L168 Benchmark]: Toolchain (without parser) took 98037.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 85.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:39:10,773 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:39:10,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:39:10,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:39:10,774 INFO L168 Benchmark]: Boogie Preprocessor took 24.85 ms. Allocated memory is still 1.1 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. [2019-12-07 14:39:10,775 INFO L168 Benchmark]: RCFGBuilder took 371.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:39:10,775 INFO L168 Benchmark]: BuchiAutomizer took 97331.98 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -67.0 MB). Peak memory consumption was 74.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:39:10,775 INFO L168 Benchmark]: Witness Printer took 2.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:39:10,777 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.85 ms. Allocated memory is still 1.1 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 371.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 97331.98 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -67.0 MB). Peak memory consumption was 74.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 97.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 96.9s. 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 154 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 653 SDtfs, 213 SDslu, 929 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: inital3298 mio100 ax102 hnf100 lsp6 ukn67 mio100 lsp100 div162 bol100 ite100 ukn100 eq171 hnf69 smp100 dnf40960 smp12 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...