./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/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 07d26b06d586d42c162be3f3e932eb08baf149e0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:16:13,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:16:13,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:16:13,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:16:13,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:16:13,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:16:13,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:16:13,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:16:13,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:16:13,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:16:13,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:16:13,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:16:13,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:16:13,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:16:13,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:16:13,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:16:13,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:16:13,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:16:13,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:16:13,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:16:13,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:16:13,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:16:13,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:16:13,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:16:13,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:16:13,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:16:13,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:16:13,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:16:13,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:16:13,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:16:13,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:16:13,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:16:13,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:16:13,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:16:13,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:16:13,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:16:13,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:16:13,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:16:13,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:16:13,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:16:13,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:16:14,002 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:16:14,036 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:16:14,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:16:14,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:16:14,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:16:14,038 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:16:14,038 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:16:14,038 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:16:14,038 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:16:14,038 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:16:14,039 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:16:14,039 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:16:14,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:16:14,039 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:16:14,039 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:16:14,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:16:14,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:16:14,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:16:14,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:16:14,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:16:14,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:16:14,041 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:16:14,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:16:14,041 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:16:14,041 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:16:14,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:16:14,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:16:14,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:16:14,042 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:16:14,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:16:14,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:16:14,043 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:16:14,043 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:16:14,044 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:16:14,044 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/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 -> 07d26b06d586d42c162be3f3e932eb08baf149e0 [2020-11-28 03:16:14,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:16:14,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:16:14,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:16:14,391 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:16:14,394 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:16:14,396 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-11-28 03:16:14,476 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/data/f66f66dc6/07fb0101a2704b769a17946b22bfe930/FLAG0ea5c4422 [2020-11-28 03:16:15,058 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:16:15,062 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-11-28 03:16:15,082 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/data/f66f66dc6/07fb0101a2704b769a17946b22bfe930/FLAG0ea5c4422 [2020-11-28 03:16:15,389 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/data/f66f66dc6/07fb0101a2704b769a17946b22bfe930 [2020-11-28 03:16:15,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:16:15,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:16:15,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:16:15,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:16:15,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:16:15,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4877dbac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15, skipping insertion in model container [2020-11-28 03:16:15,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:16:15,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:16:15,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:16:15,722 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:16:15,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:16:15,820 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:16:15,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15 WrapperNode [2020-11-28 03:16:15,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:16:15,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:16:15,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:16:15,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:16:15,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:16:15,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:16:15,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:16:15,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:16:15,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (1/1) ... [2020-11-28 03:16:15,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:16:15,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:16:15,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:16:15,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:16:15,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/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 [2020-11-28 03:16:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:16:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:16:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:16:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:16:16,553 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:16:16,553 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-28 03:16:16,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:16 BoogieIcfgContainer [2020-11-28 03:16:16,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:16:16,555 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:16:16,556 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:16:16,558 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:16:16,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:16:16,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:16:15" (1/3) ... [2020-11-28 03:16:16,560 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc52789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:16, skipping insertion in model container [2020-11-28 03:16:16,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:16:16,560 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:15" (2/3) ... [2020-11-28 03:16:16,560 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc52789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:16, skipping insertion in model container [2020-11-28 03:16:16,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:16:16,561 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:16" (3/3) ... [2020-11-28 03:16:16,562 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-11-28 03:16:16,599 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:16:16,599 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:16:16,600 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:16:16,600 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:16:16,600 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:16:16,600 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:16:16,600 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:16:16,600 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:16:16,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2020-11-28 03:16:16,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-11-28 03:16:16,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:16,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:16,637 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:16,637 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:16,638 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:16:16,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2020-11-28 03:16:16,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-11-28 03:16:16,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:16,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:16,645 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:16,645 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:16,652 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; 11#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 61#L130true assume !(0 == ~r1~0);init_~tmp~0 := 0; 58#L130-1true init_#res := init_~tmp~0; 42#L195true main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 60#L247true assume !(0 == main_~i2~0); 55#L247-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 50#L255-2true [2020-11-28 03:16:16,653 INFO L796 eck$LassoCheckResult]: Loop: 50#L255-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 13#L54true assume !(0 != ~mode1~0 % 256); 64#L68true assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite7 := ~p1_new~0; 62#L68-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 53#L54-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 4#L80true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 51#L83true assume !(node2_~m2~0 != ~nomsg~0); 49#L83-1true ~mode2~0 := 0; 22#L80-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 52#L105true assume !(0 != ~mode3~0 % 256); 39#L118true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 28#L118-2true ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 48#L105-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 57#L203true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 54#L203-1true check_#res := check_~tmp~1; 29#L223true main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 41#L279true assume !(0 == assert_~arg % 256); 7#L274true main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 50#L255-2true [2020-11-28 03:16:16,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2020-11-28 03:16:16,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:16,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542825212] [2020-11-28 03:16:16,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:16,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542825212] [2020-11-28 03:16:16,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:16,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:16,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609223704] [2020-11-28 03:16:16,892 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:16:16,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:16,893 INFO L82 PathProgramCache]: Analyzing trace with hash -879473510, now seen corresponding path program 1 times [2020-11-28 03:16:16,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:16,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466927348] [2020-11-28 03:16:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:17,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466927348] [2020-11-28 03:16:17,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:17,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:17,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104256225] [2020-11-28 03:16:17,061 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:17,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:16:17,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:16:17,078 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2020-11-28 03:16:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:17,194 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2020-11-28 03:16:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:16:17,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2020-11-28 03:16:17,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-28 03:16:17,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2020-11-28 03:16:17,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-11-28 03:16:17,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-11-28 03:16:17,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-11-28 03:16:17,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:17,234 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-11-28 03:16:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-11-28 03:16:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2020-11-28 03:16:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-28 03:16:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2020-11-28 03:16:17,277 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-11-28 03:16:17,277 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-11-28 03:16:17,278 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:16:17,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2020-11-28 03:16:17,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-28 03:16:17,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:17,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:17,288 INFO L852 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] [2020-11-28 03:16:17,288 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:17,294 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; 196#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 197#L130 assume 0 == ~r1~0; 207#L131 assume ~id1~0 >= 0; 208#L132 assume 0 == ~st1~0; 222#L133 assume ~send1~0 == ~id1~0; 223#L134 assume 0 == ~mode1~0 % 256; 188#L135 assume ~id2~0 >= 0; 189#L136 assume 0 == ~st2~0; 215#L137 assume ~send2~0 == ~id2~0; 198#L138 assume 0 == ~mode2~0 % 256; 199#L139 assume ~id3~0 >= 0; 221#L140 assume 0 == ~st3~0; 227#L141 assume ~send3~0 == ~id3~0; 211#L142 assume 0 == ~mode3~0 % 256; 212#L143 assume ~id1~0 != ~id2~0; 214#L144 assume ~id1~0 != ~id3~0; 224#L145 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 230#L130-1 init_#res := init_~tmp~0; 228#L195 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 229#L247 assume !(0 == main_~i2~0); 233#L247-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 191#L255-2 [2020-11-28 03:16:17,295 INFO L796 eck$LassoCheckResult]: Loop: 191#L255-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 200#L54 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 179#L58 assume !(node1_~m1~0 != ~nomsg~0); 180#L58-1 ~mode1~0 := 0; 213#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 185#L80 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 186#L83 assume !(node2_~m2~0 != ~nomsg~0); 195#L83-1 ~mode2~0 := 0; 209#L80-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 210#L105 assume !(0 != ~mode3~0 % 256); 226#L118 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 216#L118-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 217#L105-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 231#L203 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 183#L203-1 check_#res := check_~tmp~1; 218#L223 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 219#L279 assume !(0 == assert_~arg % 256); 190#L274 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 191#L255-2 [2020-11-28 03:16:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2020-11-28 03:16:17,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:17,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031470124] [2020-11-28 03:16:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:17,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:17,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:17,408 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:17,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:17,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1735879526, now seen corresponding path program 1 times [2020-11-28 03:16:17,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:17,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380024813] [2020-11-28 03:16:17,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:17,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380024813] [2020-11-28 03:16:17,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:17,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:17,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199638171] [2020-11-28 03:16:17,508 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:17,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:17,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:16:17,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:16:17,510 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-11-28 03:16:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:17,578 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2020-11-28 03:16:17,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:16:17,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2020-11-28 03:16:17,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-28 03:16:17,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2020-11-28 03:16:17,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-11-28 03:16:17,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-11-28 03:16:17,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2020-11-28 03:16:17,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:17,585 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-28 03:16:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2020-11-28 03:16:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-28 03:16:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-28 03:16:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2020-11-28 03:16:17,593 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-28 03:16:17,593 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-28 03:16:17,593 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:16:17,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2020-11-28 03:16:17,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-28 03:16:17,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:17,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:17,596 INFO L852 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] [2020-11-28 03:16:17,596 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:17,596 INFO L794 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; 323#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 324#L130 assume 0 == ~r1~0; 334#L131 assume ~id1~0 >= 0; 335#L132 assume 0 == ~st1~0; 349#L133 assume ~send1~0 == ~id1~0; 350#L134 assume 0 == ~mode1~0 % 256; 315#L135 assume ~id2~0 >= 0; 316#L136 assume 0 == ~st2~0; 342#L137 assume ~send2~0 == ~id2~0; 325#L138 assume 0 == ~mode2~0 % 256; 326#L139 assume ~id3~0 >= 0; 348#L140 assume 0 == ~st3~0; 354#L141 assume ~send3~0 == ~id3~0; 336#L142 assume 0 == ~mode3~0 % 256; 337#L143 assume ~id1~0 != ~id2~0; 341#L144 assume ~id1~0 != ~id3~0; 351#L145 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 357#L130-1 init_#res := init_~tmp~0; 355#L195 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 356#L247 assume !(0 == main_~i2~0); 360#L247-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 318#L255-2 [2020-11-28 03:16:17,596 INFO L796 eck$LassoCheckResult]: Loop: 318#L255-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 327#L54 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 306#L58 assume !(node1_~m1~0 != ~nomsg~0); 307#L58-1 ~mode1~0 := 0; 340#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 309#L80 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 310#L83 assume !(node2_~m2~0 != ~nomsg~0); 322#L83-1 ~mode2~0 := 0; 338#L80-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 339#L105 assume !(0 != ~mode3~0 % 256); 353#L118 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 343#L118-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 344#L105-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 358#L203 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 329#L204 assume ~r1~0 >= 3; 312#L208 assume ~r1~0 < 3;check_~tmp~1 := 1; 313#L203-1 check_#res := check_~tmp~1; 345#L223 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 346#L279 assume !(0 == assert_~arg % 256); 317#L274 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 318#L255-2 [2020-11-28 03:16:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:17,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2020-11-28 03:16:17,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:17,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914008961] [2020-11-28 03:16:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:17,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:17,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:17,684 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:17,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:17,688 INFO L82 PathProgramCache]: Analyzing trace with hash 317028566, now seen corresponding path program 1 times [2020-11-28 03:16:17,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:17,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196020476] [2020-11-28 03:16:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:17,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196020476] [2020-11-28 03:16:17,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:17,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:17,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863183720] [2020-11-28 03:16:17,734 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:17,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:17,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:17,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:17,735 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. cyclomatic complexity: 18 Second operand 3 states. [2020-11-28 03:16:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:17,777 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-11-28 03:16:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:17,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2020-11-28 03:16:17,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-11-28 03:16:17,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2020-11-28 03:16:17,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-11-28 03:16:17,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-11-28 03:16:17,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2020-11-28 03:16:17,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:17,781 INFO L691 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-28 03:16:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2020-11-28 03:16:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-28 03:16:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-28 03:16:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2020-11-28 03:16:17,793 INFO L714 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-28 03:16:17,794 INFO L594 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-28 03:16:17,794 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:16:17,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2020-11-28 03:16:17,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-11-28 03:16:17,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:17,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:17,800 INFO L852 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] [2020-11-28 03:16:17,800 INFO L853 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] [2020-11-28 03:16:17,800 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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]; 469#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 470#L130 assume 0 == ~r1~0; 479#L131 assume ~id1~0 >= 0; 480#L132 assume 0 == ~st1~0; 494#L133 assume ~send1~0 == ~id1~0; 495#L134 assume 0 == ~mode1~0 % 256; 460#L135 assume ~id2~0 >= 0; 461#L136 assume 0 == ~st2~0; 487#L137 assume ~send2~0 == ~id2~0; 471#L138 assume 0 == ~mode2~0 % 256; 472#L139 assume ~id3~0 >= 0; 493#L140 assume 0 == ~st3~0; 499#L141 assume ~send3~0 == ~id3~0; 483#L142 assume 0 == ~mode3~0 % 256; 484#L143 assume ~id1~0 != ~id2~0; 486#L144 assume ~id1~0 != ~id3~0; 496#L145 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 504#L130-1 init_#res := init_~tmp~0; 500#L195 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 501#L247 assume !(0 == main_~i2~0); 508#L247-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 509#L255-2 [2020-11-28 03:16:17,801 INFO L796 eck$LassoCheckResult]: Loop: 509#L255-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 532#L54 assume !(0 != ~mode1~0 % 256); 531#L68 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite7 := ~p1_new~0; 530#L68-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 485#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 529#L80 assume !(0 != ~mode2~0 % 256); 528#L93 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 523#L93-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 522#L80-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 520#L105 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 519#L108 assume !(node3_~m3~0 != ~nomsg~0); 516#L108-1 ~mode3~0 := 0; 513#L105-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 512#L203 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 511#L204 assume !(~r1~0 >= 3); 502#L207 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 503#L208 assume ~r1~0 < 3;check_~tmp~1 := 1; 514#L203-1 check_#res := check_~tmp~1; 535#L223 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 534#L279 assume !(0 == assert_~arg % 256); 533#L274 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 509#L255-2 [2020-11-28 03:16:17,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2020-11-28 03:16:17,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:17,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330198699] [2020-11-28 03:16:17,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:17,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:17,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:17,852 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1423181589, now seen corresponding path program 1 times [2020-11-28 03:16:17,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:17,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816554916] [2020-11-28 03:16:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:17,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:17,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:17,907 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:17,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1593761069, now seen corresponding path program 1 times [2020-11-28 03:16:17,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:17,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251030562] [2020-11-28 03:16:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:18,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251030562] [2020-11-28 03:16:18,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:18,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:18,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109491802] [2020-11-28 03:16:18,375 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2020-11-28 03:16:18,749 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2020-11-28 03:16:18,762 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:16:18,762 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:16:18,762 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:16:18,763 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:16:18,763 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-28 03:16:18,763 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:16:18,763 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:16:18,763 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:16:18,764 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-28 03:16:18,764 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:16:18,764 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:16:18,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:18,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:18,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:18,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:18,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:18,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:18,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,039 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-11-28 03:16:19,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:19,445 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-28 03:16:19,570 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-28 03:16:25,765 WARN L193 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 175 DAG size of output: 103 [2020-11-28 03:16:25,924 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:16:25,925 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/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) [2020-11-28 03:16:25,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-28 03:16:25,941 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/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) [2020-11-28 03:16:25,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-28 03:16:25,999 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:16:26,038 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-28 03:16:26,040 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:16:26,040 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:16:26,040 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:16:26,040 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:16:26,041 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:16:26,041 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:16:26,041 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:16:26,041 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:16:26,041 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-28 03:16:26,041 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:16:26,041 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:16:26,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,288 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-11-28 03:16:26,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:16:26,589 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-28 03:16:26,663 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-28 03:16:32,632 WARN L193 SmtUtils]: Spent 5.88 s on a formula simplification. DAG size of input: 175 DAG size of output: 103 [2020-11-28 03:16:32,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:16:32,802 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:16:32,815 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 [2020-11-28 03:16:32,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:16:32,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:16:32,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:16:32,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:16:32,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:16:32,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:16:32,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:16:32,825 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:16:32,858 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-28 03:16:32,859 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_856c3e60-14da-4b15-bd0f-18584a6d6965/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:16:32,869 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 03:16:32,869 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-28 03:16:32,870 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:16:32,870 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:16:32,907 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-28 03:16:33,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:33,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:16:33,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:16:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:33,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:16:33,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:16:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:33,269 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 [2020-11-28 03:16:33,269 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-11-28 03:16:33,329 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 145 states and 204 transitions. Complement of second has 4 states. [2020-11-28 03:16:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-28 03:16:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:16:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-11-28 03:16:33,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2020-11-28 03:16:33,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:16:33,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2020-11-28 03:16:33,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:16:33,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2020-11-28 03:16:33,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:16:33,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. [2020-11-28 03:16:33,342 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:16:33,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2020-11-28 03:16:33,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-28 03:16:33,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-28 03:16:33,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-28 03:16:33,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:33,343 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:16:33,343 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:16:33,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:33,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:16:33,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:16:33,345 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2020-11-28 03:16:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:33,346 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-11-28 03:16:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-28 03:16:33,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-11-28 03:16:33,348 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:16:33,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-11-28 03:16:33,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-28 03:16:33,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-28 03:16:33,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-28 03:16:33,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:33,349 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:16:33,349 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:16:33,350 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:16:33,350 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:16:33,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-28 03:16:33,350 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:16:33,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-28 03:16:33,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:16:33 BoogieIcfgContainer [2020-11-28 03:16:33,355 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:16:33,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:16:33,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:16:33,356 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:16:33,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:16" (3/4) ... [2020-11-28 03:16:33,359 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-28 03:16:33,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:16:33,360 INFO L168 Benchmark]: Toolchain (without parser) took 17964.75 ms. Allocated memory was 107.0 MB in the beginning and 272.6 MB in the end (delta: 165.7 MB). Free memory was 75.6 MB in the beginning and 233.0 MB in the end (delta: -157.4 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:33,361 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 77.6 MB. Free memory was 38.0 MB in the beginning and 38.0 MB in the end (delta: 38.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:16:33,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.23 ms. Allocated memory is still 107.0 MB. Free memory was 75.3 MB in the beginning and 80.0 MB in the end (delta: -4.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:33,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.80 ms. Allocated memory is still 107.0 MB. Free memory was 80.0 MB in the beginning and 78.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:33,363 INFO L168 Benchmark]: Boogie Preprocessor took 27.88 ms. Allocated memory is still 107.0 MB. Free memory was 78.3 MB in the beginning and 76.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:33,363 INFO L168 Benchmark]: RCFGBuilder took 639.19 ms. Allocated memory is still 107.0 MB. Free memory was 76.6 MB in the beginning and 82.4 MB in the end (delta: -5.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:33,364 INFO L168 Benchmark]: BuchiAutomizer took 16800.15 ms. Allocated memory was 107.0 MB in the beginning and 272.6 MB in the end (delta: 165.7 MB). Free memory was 82.0 MB in the beginning and 234.1 MB in the end (delta: -152.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:33,365 INFO L168 Benchmark]: Witness Printer took 3.23 ms. Allocated memory is still 272.6 MB. Free memory was 234.1 MB in the beginning and 233.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:16:33,369 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80 ms. Allocated memory is still 77.6 MB. Free memory was 38.0 MB in the beginning and 38.0 MB in the end (delta: 38.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 423.23 ms. Allocated memory is still 107.0 MB. Free memory was 75.3 MB in the beginning and 80.0 MB in the end (delta: -4.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 62.80 ms. Allocated memory is still 107.0 MB. Free memory was 80.0 MB in the beginning and 78.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.88 ms. Allocated memory is still 107.0 MB. Free memory was 78.3 MB in the beginning and 76.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 639.19 ms. Allocated memory is still 107.0 MB. Free memory was 76.6 MB in the beginning and 82.4 MB in the end (delta: -5.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 16800.15 ms. Allocated memory was 107.0 MB in the beginning and 272.6 MB in the end (delta: 165.7 MB). Free memory was 82.0 MB in the beginning and 234.1 MB in the end (delta: -152.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. * Witness Printer took 3.23 ms. Allocated memory is still 272.6 MB. Free memory was 234.1 MB in the beginning and 233.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 15.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 347 SDtfs, 219 SDslu, 585 SDs, 0 SdLazy, 46 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital151 mio100 ax123 hnf104 lsp69 ukn64 mio100 lsp100 div169 bol100 ite100 ukn100 eq166 hnf68 smp100 dnf7015 smp23 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 66ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 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...