./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/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 c878d4c6ffd1ff0965d17e614910488cd1ba3a61 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:57,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:57,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:57,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:57,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:57,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:57,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:57,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:57,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:57,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:57,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:57,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:57,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:57,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:57,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:57,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:57,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:57,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:57,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:57,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:57,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:57,918 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:57,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:57,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:57,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:57,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:57,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:57,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:57,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:57,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:57,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:57,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:57,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:57,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:57,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:57,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:57,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:57,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:57,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:57,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:57,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:57,934 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:54:57,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:57,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:57,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:57,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:57,950 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:57,950 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:57,950 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:57,950 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:57,951 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:57,951 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:57,953 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:57,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:57,953 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:57,953 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:57,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:57,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:57,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:57,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:57,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:57,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:57,954 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:57,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:57,955 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:57,955 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:57,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:57,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:57,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:57,956 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:57,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:57,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:57,956 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:57,957 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:57,957 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/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/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 -> c878d4c6ffd1ff0965d17e614910488cd1ba3a61 [2019-10-22 08:54:57,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:58,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:58,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:58,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:58,017 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:58,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-10-22 08:54:58,072 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/bin/uautomizer/data/0b828e9f0/fc92302313274329acd366d9b11eb9db/FLAG6996fe889 [2019-10-22 08:54:58,562 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:58,563 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-10-22 08:54:58,581 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/bin/uautomizer/data/0b828e9f0/fc92302313274329acd366d9b11eb9db/FLAG6996fe889 [2019-10-22 08:54:58,865 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/bin/uautomizer/data/0b828e9f0/fc92302313274329acd366d9b11eb9db [2019-10-22 08:54:58,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:58,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:58,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:58,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:58,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:58,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7dd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:58, skipping insertion in model container [2019-10-22 08:54:58,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:58" (1/1) ... [2019-10-22 08:54:58,886 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:58,948 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:59,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:59,351 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:59,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:59,486 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:59,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59 WrapperNode [2019-10-22 08:54:59,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:59,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:59,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:59,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:59,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (1/1) ... [2019-10-22 08:54:59,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (1/1) ... [2019-10-22 08:54:59,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:59,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:59,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:59,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:59,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (1/1) ... [2019-10-22 08:54:59,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (1/1) ... [2019-10-22 08:54:59,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (1/1) ... [2019-10-22 08:54:59,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (1/1) ... [2019-10-22 08:54:59,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (1/1) ... [2019-10-22 08:54:59,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (1/1) ... [2019-10-22 08:54:59,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (1/1) ... [2019-10-22 08:54:59,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:59,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:59,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:59,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:59,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/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-10-22 08:54:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:59,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:00,913 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:00,913 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-10-22 08:55:00,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:00 BoogieIcfgContainer [2019-10-22 08:55:00,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:00,916 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:00,916 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:00,919 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:00,920 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:00,920 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:58" (1/3) ... [2019-10-22 08:55:00,921 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1eb046aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:00, skipping insertion in model container [2019-10-22 08:55:00,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:00,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:59" (2/3) ... [2019-10-22 08:55:00,924 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1eb046aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:00, skipping insertion in model container [2019-10-22 08:55:00,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:00,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:00" (3/3) ... [2019-10-22 08:55:00,926 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-10-22 08:55:00,975 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:00,976 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:00,976 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:00,976 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:00,976 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:00,976 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:00,976 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:00,976 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:00,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states. [2019-10-22 08:55:01,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2019-10-22 08:55:01,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:01,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:01,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:01,051 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] [2019-10-22 08:55:01,051 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:01,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states. [2019-10-22 08:55:01,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2019-10-22 08:55:01,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:01,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:01,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:01,062 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] [2019-10-22 08:55:01,070 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~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]; 12#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 126#L484true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 139#L495true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 20#L505true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 18#L516true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 247#L526true assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 246#L537true init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 308#L547true assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 307#L558true init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 212#L568true assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 211#L579true init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 105#L589true assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 104#L600true init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 7#L610true assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 5#L621true init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 66#L631true assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 65#L642true init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 294#L652true assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 292#L663true init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 191#L673true assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 189#L684true init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 84#L694true assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 83#L705true init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 146#L715true assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 145#L726true init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 45#L736true assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 44#L747true init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 274#L757true assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 273#L768true init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 178#L778true assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 177#L789true init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 237#L799true assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 236#L810true init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 118#L820true assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 134#L831true init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 14#L841true assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 13#L852true init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 71#L862true assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 69#L873true init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 298#L883true assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 297#L894true init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 195#L904true assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 194#L915true init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 92#L925true assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 91#L936true init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 159#L946true assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 157#L957true init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 58#L967true assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 56#L978true init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 285#L988true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 287#L988-1true init_#res := init_~tmp___23~0; 87#L1173true main_#t~ret56 := init_#res;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 47#L1314-2true [2019-10-22 08:55:01,071 INFO L793 eck$LassoCheckResult]: Loop: 47#L1314-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 312#L156true assume !(0 != ~mode1~0 % 256); 155#L192true assume !(~r1~0 < 3); 150#L192-1true ~mode1~0 := 1; 306#L156-2true havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 109#L220true assume !(0 != ~mode2~0 % 256); 277#L256true assume !(~r2~0 < 3); 276#L256-1true ~mode2~0 := 1; 102#L220-2true havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 67#L284true assume !(0 != ~mode3~0 % 256); 235#L320true assume !(~r3~0 < 3); 238#L320-1true ~mode3~0 := 1; 62#L284-2true havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 202#L348true assume !(0 != ~mode4~0 % 256); 28#L384true assume !(~r4~0 < 3); 32#L384-1true ~mode4~0 := 1; 209#L348-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 256#L1181true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 258#L1181-1true check_#res := check_~tmp~1; 121#L1233true main_#t~ret57 := check_#res;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 264#L1357true assume !(0 == assert_~arg % 256); 76#L1352true main_#t~post58 := main_~i2~0;main_~i2~0 := 1 + main_#t~post58;havoc main_#t~post58; 47#L1314-2true [2019-10-22 08:55:01,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:01,077 INFO L82 PathProgramCache]: Analyzing trace with hash 15555676, now seen corresponding path program 1 times [2019-10-22 08:55:01,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:01,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050382898] [2019-10-22 08:55:01,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:01,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050382898] [2019-10-22 08:55:01,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:01,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:01,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274400053] [2019-10-22 08:55:01,458 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1346770731, now seen corresponding path program 1 times [2019-10-22 08:55:01,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:01,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224413695] [2019-10-22 08:55:01,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:01,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224413695] [2019-10-22 08:55:01,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:01,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:01,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347395673] [2019-10-22 08:55:01,588 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:01,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:01,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:01,602 INFO L87 Difference]: Start difference. First operand 321 states. Second operand 5 states. [2019-10-22 08:55:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:01,715 INFO L93 Difference]: Finished difference Result 325 states and 579 transitions. [2019-10-22 08:55:01,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:01,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 579 transitions. [2019-10-22 08:55:01,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2019-10-22 08:55:01,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 316 states and 562 transitions. [2019-10-22 08:55:01,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2019-10-22 08:55:01,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2019-10-22 08:55:01,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 562 transitions. [2019-10-22 08:55:01,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:01,734 INFO L688 BuchiCegarLoop]: Abstraction has 316 states and 562 transitions. [2019-10-22 08:55:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 562 transitions. [2019-10-22 08:55:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2019-10-22 08:55:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-10-22 08:55:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 562 transitions. [2019-10-22 08:55:01,780 INFO L711 BuchiCegarLoop]: Abstraction has 316 states and 562 transitions. [2019-10-22 08:55:01,780 INFO L591 BuchiCegarLoop]: Abstraction has 316 states and 562 transitions. [2019-10-22 08:55:01,781 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:01,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 562 transitions. [2019-10-22 08:55:01,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2019-10-22 08:55:01,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:01,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:01,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:01,787 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-10-22 08:55:01,787 INFO L791 eck$LassoCheckResult]: Stem: 870#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~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]; 684#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 685#L484 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 710#L495 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 704#L505 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 700#L516 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 701#L526 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 739#L537 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 967#L547 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 952#L558 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 950#L568 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 850#L579 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 848#L589 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 676#L600 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 673#L610 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 671#L621 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 672#L631 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 667#L642 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 787#L652 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 786#L663 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 940#L673 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 820#L684 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 818#L694 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 696#L705 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 816#L715 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 757#L726 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 753#L736 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 751#L747 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 752#L757 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 750#L768 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 924#L778 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 811#L789 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 923#L799 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 868#L810 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 866#L820 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 692#L831 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 688#L841 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 686#L852 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 687#L862 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 728#L873 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 796#L883 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 946#L894 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 943#L904 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 831#L915 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 828#L925 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 714#L936 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 827#L946 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 780#L957 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 777#L967 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 772#L978 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 773#L988 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 682#L988-1 init_#res := init_~tmp___23~0; 821#L1173 main_#t~ret56 := init_#res;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 758#L1314-2 [2019-10-22 08:55:01,787 INFO L793 eck$LassoCheckResult]: Loop: 758#L1314-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 759#L156 assume !(0 != ~mode1~0 % 256); 901#L192 assume !(~r1~0 < 3); 836#L192-1 ~mode1~0 := 1; 899#L156-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 852#L220 assume !(0 != ~mode2~0 % 256); 853#L256 assume !(~r2~0 < 3); 776#L256-1 ~mode2~0 := 1; 846#L220-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 788#L284 assume !(0 != ~mode3~0 % 256); 790#L320 assume !(~r3~0 < 3); 917#L320-1 ~mode3~0 := 1; 782#L284-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 783#L348 assume !(0 != ~mode4~0 % 256); 722#L384 assume !(~r4~0 < 3); 723#L384-1 ~mode4~0 := 1; 729#L348-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 949#L1181 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 732#L1182 assume ~st1~0 + ~nl1~0 <= 1; 733#L1183 assume ~st2~0 + ~nl2~0 <= 1; 822#L1184 assume ~st3~0 + ~nl3~0 <= 1; 823#L1185 assume ~st4~0 + ~nl4~0 <= 1; 939#L1186 assume ~r1~0 >= 3; 874#L1190 assume ~r1~0 < 3; 817#L1195 assume ~r1~0 >= 3; 694#L1200 assume ~r1~0 < 3;check_~tmp~1 := 1; 731#L1181-1 check_#res := check_~tmp~1; 871#L1233 main_#t~ret57 := check_#res;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 872#L1357 assume !(0 == assert_~arg % 256); 805#L1352 main_#t~post58 := main_~i2~0;main_~i2~0 := 1 + main_#t~post58;havoc main_#t~post58; 758#L1314-2 [2019-10-22 08:55:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:01,788 INFO L82 PathProgramCache]: Analyzing trace with hash 15555676, now seen corresponding path program 2 times [2019-10-22 08:55:01,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:01,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876665265] [2019-10-22 08:55:01,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:01,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876665265] [2019-10-22 08:55:01,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:01,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:01,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569851804] [2019-10-22 08:55:01,870 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:01,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1017631012, now seen corresponding path program 1 times [2019-10-22 08:55:01,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:01,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211318198] [2019-10-22 08:55:01,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:01,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211318198] [2019-10-22 08:55:01,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:01,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:01,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842305012] [2019-10-22 08:55:01,924 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:01,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:01,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:01,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:01,925 INFO L87 Difference]: Start difference. First operand 316 states and 562 transitions. cyclomatic complexity: 247 Second operand 3 states. [2019-10-22 08:55:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:01,990 INFO L93 Difference]: Finished difference Result 412 states and 716 transitions. [2019-10-22 08:55:01,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:01,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 716 transitions. [2019-10-22 08:55:01,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 218 [2019-10-22 08:55:02,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 412 states and 716 transitions. [2019-10-22 08:55:02,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 412 [2019-10-22 08:55:02,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2019-10-22 08:55:02,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 716 transitions. [2019-10-22 08:55:02,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:02,012 INFO L688 BuchiCegarLoop]: Abstraction has 412 states and 716 transitions. [2019-10-22 08:55:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 716 transitions. [2019-10-22 08:55:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2019-10-22 08:55:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-10-22 08:55:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 716 transitions. [2019-10-22 08:55:02,043 INFO L711 BuchiCegarLoop]: Abstraction has 412 states and 716 transitions. [2019-10-22 08:55:02,043 INFO L591 BuchiCegarLoop]: Abstraction has 412 states and 716 transitions. [2019-10-22 08:55:02,043 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:02,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 412 states and 716 transitions. [2019-10-22 08:55:02,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 218 [2019-10-22 08:55:02,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:02,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:02,049 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:02,052 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, 1, 1] [2019-10-22 08:55:02,052 INFO L791 eck$LassoCheckResult]: Stem: 1609#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~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]; 1422#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1423#L484 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1446#L495 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1440#L505 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1436#L516 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1437#L526 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 1475#L537 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 1714#L547 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 1697#L558 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 1694#L568 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 1589#L579 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1587#L589 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 1412#L600 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1409#L610 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 1404#L621 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 1405#L631 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 1403#L642 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 1524#L652 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 1523#L663 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 1681#L673 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 1558#L684 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 1554#L694 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 1430#L705 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 1553#L715 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 1493#L726 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 1489#L736 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 1487#L747 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 1488#L757 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 1485#L768 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 1665#L778 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 1548#L789 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 1664#L799 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 1607#L810 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 1605#L820 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 1428#L831 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 1424#L841 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 1420#L852 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 1421#L862 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 1464#L873 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 1531#L883 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 1686#L894 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 1682#L904 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 1569#L915 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 1567#L925 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 1450#L936 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 1566#L946 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 1517#L957 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 1511#L967 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 1506#L978 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 1507#L988 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1418#L988-1 init_#res := init_~tmp___23~0; 1559#L1173 main_#t~ret56 := init_#res;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1560#L1314-2 [2019-10-22 08:55:02,053 INFO L793 eck$LassoCheckResult]: Loop: 1560#L1314-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1729#L156 assume !(0 != ~mode1~0 % 256); 1728#L192 assume ~r1~0 < 3; 1571#L193 assume !(0 != ~ep12~0 % 256); 1563#L193-1 assume !(0 != ~ep13~0 % 256); 1564#L198 assume !(0 != ~ep14~0 % 256); 1575#L192-1 ~mode1~0 := 1; 1688#L156-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 1791#L220 assume !(0 != ~mode2~0 % 256); 1782#L256 assume !(~r2~0 < 3); 1781#L256-1 ~mode2~0 := 1; 1779#L220-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 1778#L284 assume !(0 != ~mode3~0 % 256); 1712#L320 assume !(~r3~0 < 3); 1658#L320-1 ~mode3~0 := 1; 1520#L284-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 1521#L348 assume !(0 != ~mode4~0 % 256); 1691#L384 assume !(~r4~0 < 3); 1743#L384-1 ~mode4~0 := 1; 1741#L348-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1740#L1181 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1739#L1182 assume ~st1~0 + ~nl1~0 <= 1; 1738#L1183 assume ~st2~0 + ~nl2~0 <= 1; 1737#L1184 assume ~st3~0 + ~nl3~0 <= 1; 1736#L1185 assume ~st4~0 + ~nl4~0 <= 1; 1734#L1186 assume !(~r1~0 >= 3); 1612#L1189 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 1613#L1190 assume ~r1~0 < 3; 1735#L1195 assume !(~r1~0 >= 3); 1432#L1199 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 1433#L1200 assume ~r1~0 < 3;check_~tmp~1 := 1; 1733#L1181-1 check_#res := check_~tmp~1; 1732#L1233 main_#t~ret57 := check_#res;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1731#L1357 assume !(0 == assert_~arg % 256); 1730#L1352 main_#t~post58 := main_~i2~0;main_~i2~0 := 1 + main_#t~post58;havoc main_#t~post58; 1560#L1314-2 [2019-10-22 08:55:02,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:02,053 INFO L82 PathProgramCache]: Analyzing trace with hash 15555676, now seen corresponding path program 3 times [2019-10-22 08:55:02,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:02,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869725602] [2019-10-22 08:55:02,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:02,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:02,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:02,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869725602] [2019-10-22 08:55:02,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:02,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:02,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685045386] [2019-10-22 08:55:02,148 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1567453802, now seen corresponding path program 1 times [2019-10-22 08:55:02,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:02,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727182581] [2019-10-22 08:55:02,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:02,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:02,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:02,193 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:02,735 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2019-10-22 08:55:02,942 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-10-22 08:55:02,952 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:02,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:02,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:02,953 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:02,953 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:02,953 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:02,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:02,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:02,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2019-10-22 08:55:02,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:02,954 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:02,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:02,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:02,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,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-10-22 08:55:03,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,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-10-22 08:55:03,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,501 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-22 08:55:03,753 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-22 08:55:03,801 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:03,801 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/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-10-22 08:55:03,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:03,809 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73eaa037-7429-49e7-8db8-e2823bc8bd81/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-10-22 08:55:03,817 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:03,818 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:03,928 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:03,933 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:03,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:03,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:03,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:03,933 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:03,933 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:03,934 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:03,934 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:03,934 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2019-10-22 08:55:03,934 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:03,934 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:03,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:03,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:04,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-10-22 08:55:04,285 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-22 08:55:04,598 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-22 08:55:04,689 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:04,693 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:04,695 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-10-22 08:55:04,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,696 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,697 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,699 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,699 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,702 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-10-22 08:55:04,702 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,703 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,703 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,703 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,704 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:04,705 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:04,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,706 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-10-22 08:55:04,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,707 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,707 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,708 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-10-22 08:55:04,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,709 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,709 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,709 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,710 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-10-22 08:55:04,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,711 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,711 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,711 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,711 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,712 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-10-22 08:55:04,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,714 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:04,714 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:04,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,717 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-10-22 08:55:04,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,717 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,717 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,717 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,718 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,718 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,720 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-10-22 08:55:04,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,722 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:04,722 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:04,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,724 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-10-22 08:55:04,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,724 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,724 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,725 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,725 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,725 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,726 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-10-22 08:55:04,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,726 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,726 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,727 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,727 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,728 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-10-22 08:55:04,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,728 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,729 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,729 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,729 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,729 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,730 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-10-22 08:55:04,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,732 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:04,732 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:04,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,734 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-10-22 08:55:04,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,735 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,735 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,735 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,736 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-10-22 08:55:04,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,740 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,741 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,744 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-10-22 08:55:04,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,745 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,746 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,746 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,747 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-10-22 08:55:04,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,747 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,748 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,748 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,749 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-10-22 08:55:04,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,749 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,750 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,751 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-10-22 08:55:04,751 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,751 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,751 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,752 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,752 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,753 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-10-22 08:55:04,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,753 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,754 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,755 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-10-22 08:55:04,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,756 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,757 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-10-22 08:55:04,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,758 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:04,759 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:04,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,761 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-10-22 08:55:04,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,761 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,762 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,762 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:04,764 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-10-22 08:55:04,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:04,764 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:04,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:04,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:04,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:04,765 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:04,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:04,767 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:04,769 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:04,770 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:55:04,771 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:04,771 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:04,772 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:04,772 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2019-10-22 08:55:04,774 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:04,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:04,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:04,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:04,962 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-10-22 08:55:04,963 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 412 states and 716 transitions. cyclomatic complexity: 305 Second operand 3 states. [2019-10-22 08:55:05,042 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 412 states and 716 transitions. cyclomatic complexity: 305. Second operand 3 states. Result 629 states and 1072 transitions. Complement of second has 4 states. [2019-10-22 08:55:05,042 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-10-22 08:55:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2019-10-22 08:55:05,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 562 transitions. Stem has 53 letters. Loop has 35 letters. [2019-10-22 08:55:05,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:05,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 562 transitions. Stem has 88 letters. Loop has 35 letters. [2019-10-22 08:55:05,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:05,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 562 transitions. Stem has 53 letters. Loop has 70 letters. [2019-10-22 08:55:05,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:05,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 629 states and 1072 transitions. [2019-10-22 08:55:05,054 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:05,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 629 states to 0 states and 0 transitions. [2019-10-22 08:55:05,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:05,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:05,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:05,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:05,054 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:05,055 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:05,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:05,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:05,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:05,055 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-10-22 08:55:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:05,055 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 08:55:05,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:55:05,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 08:55:05,056 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:05,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:55:05,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:05,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:05,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:05,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:05,056 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:05,056 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:05,056 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:05,056 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:05,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:05,057 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:05,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:05,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:05 BoogieIcfgContainer [2019-10-22 08:55:05,063 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:05,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:05,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:05,063 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:05,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:00" (3/4) ... [2019-10-22 08:55:05,067 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:05,067 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:05,069 INFO L168 Benchmark]: Toolchain (without parser) took 6200.21 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -243.4 MB). Peak memory consumption was 94.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:05,069 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:05,069 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:05,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:05,070 INFO L168 Benchmark]: Boogie Preprocessor took 84.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:05,071 INFO L168 Benchmark]: RCFGBuilder took 1279.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.3 MB in the end (delta: 123.3 MB). Peak memory consumption was 123.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:05,071 INFO L168 Benchmark]: BuchiAutomizer took 4147.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 995.3 MB in the beginning and 1.2 GB in the end (delta: -202.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:05,071 INFO L168 Benchmark]: Witness Printer took 4.14 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:05,076 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 618.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1279.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.3 MB in the end (delta: 123.3 MB). Peak memory consumption was 123.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4147.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 995.3 MB in the beginning and 1.2 GB in the end (delta: -202.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.14 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 412 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1693 SDtfs, 699 SDslu, 2451 SDs, 0 SdLazy, 36 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax122 hnf105 lsp27 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...