./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.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_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/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 ca5338245ac2cf80ca20dadcdab0215a80a80895 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:18:25,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:18:25,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:18:25,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:18:25,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:18:25,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:18:25,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:18:25,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:18:25,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:18:25,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:18:25,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:18:25,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:18:25,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:18:25,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:18:25,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:18:25,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:18:25,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:18:25,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:18:25,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:18:25,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:18:25,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:18:25,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:18:25,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:18:25,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:18:25,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:18:25,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:18:25,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:18:25,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:18:25,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:18:25,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:18:25,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:18:25,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:18:25,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:18:25,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:18:25,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:18:25,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:18:25,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:18:25,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:18:25,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:18:25,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:18:25,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:18:25,805 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:18:25,842 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:18:25,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:18:25,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:18:25,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:18:25,843 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:18:25,843 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:18:25,844 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:18:25,844 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:18:25,844 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:18:25,844 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:18:25,844 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:18:25,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:18:25,844 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:18:25,844 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:18:25,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:18:25,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:18:25,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:18:25,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:18:25,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:18:25,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:18:25,845 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:18:25,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:18:25,846 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:18:25,846 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:18:25,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:18:25,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:18:25,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:18:25,846 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:18:25,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:18:25,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:18:25,847 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:18:25,847 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:18:25,853 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:18:25,853 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_763003fe-9fb5-400a-ae8a-c7935242fc04/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_763003fe-9fb5-400a-ae8a-c7935242fc04/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 -> ca5338245ac2cf80ca20dadcdab0215a80a80895 [2020-11-28 03:18:26,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:18:26,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:18:26,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:18:26,126 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:18:26,127 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:18:26,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2020-11-28 03:18:26,200 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/data/e4482ef46/19e48049e48d4dfa83069372e168bea9/FLAG1643296ea [2020-11-28 03:18:26,673 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:18:26,673 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2020-11-28 03:18:26,682 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/data/e4482ef46/19e48049e48d4dfa83069372e168bea9/FLAG1643296ea [2020-11-28 03:18:27,039 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/data/e4482ef46/19e48049e48d4dfa83069372e168bea9 [2020-11-28 03:18:27,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:18:27,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:18:27,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:18:27,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:18:27,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:18:27,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:18:27" (1/1) ... [2020-11-28 03:18:27,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f2e059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27, skipping insertion in model container [2020-11-28 03:18:27,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:18:27" (1/1) ... [2020-11-28 03:18:27,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:18:27,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:18:27,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:18:27,340 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:18:27,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:18:27,430 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:18:27,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27 WrapperNode [2020-11-28 03:18:27,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:18:27,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:18:27,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:18:27,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:18:27,440 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:18:27" (1/1) ... [2020-11-28 03:18:27,449 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:18:27" (1/1) ... [2020-11-28 03:18:27,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:18:27,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:18:27,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:18:27,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:18:27,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27" (1/1) ... [2020-11-28 03:18:27,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27" (1/1) ... [2020-11-28 03:18:27,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27" (1/1) ... [2020-11-28 03:18:27,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27" (1/1) ... [2020-11-28 03:18:27,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27" (1/1) ... [2020-11-28 03:18:27,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27" (1/1) ... [2020-11-28 03:18:27,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27" (1/1) ... [2020-11-28 03:18:27,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:18:27,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:18:27,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:18:27,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:18:27,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/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:18:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:18:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:18:27,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:18:27,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:18:28,408 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:18:28,411 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-28 03:18:28,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:28 BoogieIcfgContainer [2020-11-28 03:18:28,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:18:28,416 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:18:28,417 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:18:28,420 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:18:28,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:18:28,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:18:27" (1/3) ... [2020-11-28 03:18:28,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7201a3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:18:28, skipping insertion in model container [2020-11-28 03:18:28,424 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:18:28,424 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:27" (2/3) ... [2020-11-28 03:18:28,425 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7201a3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:18:28, skipping insertion in model container [2020-11-28 03:18:28,425 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:18:28,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:28" (3/3) ... [2020-11-28 03:18:28,427 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2020-11-28 03:18:28,488 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:18:28,488 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:18:28,488 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:18:28,489 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:18:28,489 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:18:28,490 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:18:28,490 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:18:28,490 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:18:28,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states. [2020-11-28 03:18:28,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2020-11-28 03:18:28,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:28,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:28,546 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:18:28,546 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:18:28,546 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:18:28,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states. [2020-11-28 03:18:28,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2020-11-28 03:18:28,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:28,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:28,560 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:18:28,560 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:18:28,568 INFO L794 eck$LassoCheckResult]: Stem: 36#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(49);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;~alive1~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;~alive2~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;~alive3~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]; 14#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 58#L162true assume !(0 == ~r1~0);init_~tmp~0 := 0; 56#L162-1true init_#res := init_~tmp~0; 32#L231true main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 38#L278true assume 0 == main_~i2~0;assume false; 13#L278-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; 31#L286-2true [2020-11-28 03:18:28,568 INFO L796 eck$LassoCheckResult]: Loop: 31#L286-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 81#L57true 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; 71#L61true assume !(node1_~m1~0 != ~nomsg~0); 67#L61-1true ~mode1~0 := 0; 77#L57-2true havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 73#L94true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 76#L97true assume !(node2_~m2~0 != ~nomsg~0); 75#L97-1true ~mode2~0 := 0; 68#L94-2true havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 37#L128true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 21#L131true assume !(node3_~m3~0 != ~nomsg~0); 19#L131-1true ~mode3~0 := 0; 12#L128-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; 45#L239true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 62#L239-1true check_#res := check_~tmp~1; 65#L251true main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 9#L310true assume !(0 == assert_~arg % 256); 59#L305true main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 31#L286-2true [2020-11-28 03:18:28,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:28,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2020-11-28 03:18:28,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:28,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340079917] [2020-11-28 03:18:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:28,777 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:18:28,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340079917] [2020-11-28 03:18:28,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:28,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:18:28,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972561383] [2020-11-28 03:18:28,786 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:18:28,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:28,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480252, now seen corresponding path program 1 times [2020-11-28 03:18:28,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:28,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058597369] [2020-11-28 03:18:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:28,970 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:18:28,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058597369] [2020-11-28 03:18:28,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:28,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:18:28,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865275809] [2020-11-28 03:18:28,972 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:28,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:28,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-28 03:18:28,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-28 03:18:28,990 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2020-11-28 03:18:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:29,001 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2020-11-28 03:18:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-28 03:18:29,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 125 transitions. [2020-11-28 03:18:29,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-28 03:18:29,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 120 transitions. [2020-11-28 03:18:29,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2020-11-28 03:18:29,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2020-11-28 03:18:29,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 120 transitions. [2020-11-28 03:18:29,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:29,016 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2020-11-28 03:18:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 120 transitions. [2020-11-28 03:18:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-11-28 03:18:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-28 03:18:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2020-11-28 03:18:29,048 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2020-11-28 03:18:29,048 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2020-11-28 03:18:29,048 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:18:29,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 120 transitions. [2020-11-28 03:18:29,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-28 03:18:29,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:29,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:29,052 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:18:29,052 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:18:29,052 INFO L794 eck$LassoCheckResult]: Stem: 218#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(49);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;~alive1~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;~alive2~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;~alive3~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]; 190#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 191#L162 assume !(0 == ~r1~0);init_~tmp~0 := 0; 169#L162-1 init_#res := init_~tmp~0; 210#L231 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 211#L278 assume !(0 == main_~i2~0); 188#L278-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; 189#L286-2 [2020-11-28 03:18:29,052 INFO L796 eck$LassoCheckResult]: Loop: 189#L286-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 209#L57 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; 238#L61 assume !(node1_~m1~0 != ~nomsg~0); 186#L61-1 ~mode1~0 := 0; 201#L57-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 239#L94 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 240#L97 assume !(node2_~m2~0 != ~nomsg~0); 177#L97-1 ~mode2~0 := 0; 207#L94-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 216#L128 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 199#L131 assume !(node3_~m3~0 != ~nomsg~0); 198#L131-1 ~mode3~0 := 0; 183#L128-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; 184#L239 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 226#L239-1 check_#res := check_~tmp~1; 236#L251 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 179#L310 assume !(0 == assert_~arg % 256); 180#L305 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 189#L286-2 [2020-11-28 03:18:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2020-11-28 03:18:29,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:29,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952519701] [2020-11-28 03:18:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:29,119 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:18:29,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952519701] [2020-11-28 03:18:29,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:29,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:18:29,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075515260] [2020-11-28 03:18:29,121 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:18:29,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:29,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480252, now seen corresponding path program 2 times [2020-11-28 03:18:29,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:29,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832441850] [2020-11-28 03:18:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:29,264 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:18:29,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832441850] [2020-11-28 03:18:29,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:29,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:18:29,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094425429] [2020-11-28 03:18:29,265 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:29,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:29,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:18:29,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:18:29,266 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. cyclomatic complexity: 48 Second operand 5 states. [2020-11-28 03:18:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:29,408 INFO L93 Difference]: Finished difference Result 126 states and 202 transitions. [2020-11-28 03:18:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:18:29,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 202 transitions. [2020-11-28 03:18:29,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-28 03:18:29,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 123 states and 183 transitions. [2020-11-28 03:18:29,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2020-11-28 03:18:29,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2020-11-28 03:18:29,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 183 transitions. [2020-11-28 03:18:29,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:29,418 INFO L691 BuchiCegarLoop]: Abstraction has 123 states and 183 transitions. [2020-11-28 03:18:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 183 transitions. [2020-11-28 03:18:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 73. [2020-11-28 03:18:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-28 03:18:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2020-11-28 03:18:29,425 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2020-11-28 03:18:29,426 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2020-11-28 03:18:29,426 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:18:29,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 103 transitions. [2020-11-28 03:18:29,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-28 03:18:29,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:29,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:29,429 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, 1] [2020-11-28 03:18:29,429 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:18:29,430 INFO L794 eck$LassoCheckResult]: Stem: 431#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(49);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;~alive1~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;~alive2~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;~alive3~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]; 403#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 404#L162 assume 0 == ~r1~0; 448#L163 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 415#L164 assume ~id1~0 >= 0; 416#L165 assume 0 == ~st1~0; 418#L166 assume ~send1~0 == ~id1~0; 441#L167 assume 0 == ~mode1~0 % 256; 394#L168 assume ~id2~0 >= 0; 395#L169 assume 0 == ~st2~0; 428#L170 assume ~send2~0 == ~id2~0; 407#L171 assume 0 == ~mode2~0 % 256; 408#L172 assume ~id3~0 >= 0; 432#L173 assume 0 == ~st3~0; 449#L174 assume ~send3~0 == ~id3~0; 382#L175 assume 0 == ~mode3~0 % 256; 383#L176 assume ~id1~0 != ~id2~0; 419#L177 assume ~id1~0 != ~id3~0; 442#L178 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 446#L162-1 init_#res := init_~tmp~0; 423#L231 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 424#L278 assume !(0 == main_~i2~0); 401#L278-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; 402#L286-2 [2020-11-28 03:18:29,430 INFO L796 eck$LassoCheckResult]: Loop: 402#L286-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 422#L57 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; 452#L61 assume !(node1_~m1~0 != ~nomsg~0); 397#L61-1 ~mode1~0 := 0; 414#L57-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 453#L94 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 454#L97 assume !(node2_~m2~0 != ~nomsg~0); 390#L97-1 ~mode2~0 := 0; 421#L94-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 429#L128 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 412#L131 assume !(node3_~m3~0 != ~nomsg~0); 411#L131-1 ~mode3~0 := 0; 399#L128-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; 400#L239 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 439#L239-1 check_#res := check_~tmp~1; 450#L251 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 392#L310 assume !(0 == assert_~arg % 256); 393#L305 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 402#L286-2 [2020-11-28 03:18:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2020-11-28 03:18:29,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:29,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014831887] [2020-11-28 03:18:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:29,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:29,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:29,590 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480252, now seen corresponding path program 3 times [2020-11-28 03:18:29,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:29,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240731481] [2020-11-28 03:18:29,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:29,674 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:18:29,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240731481] [2020-11-28 03:18:29,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:29,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:18:29,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497439371] [2020-11-28 03:18:29,675 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:29,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:18:29,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:18:29,677 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. cyclomatic complexity: 31 Second operand 5 states. [2020-11-28 03:18:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:29,733 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2020-11-28 03:18:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:18:29,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 105 transitions. [2020-11-28 03:18:29,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-28 03:18:29,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 101 transitions. [2020-11-28 03:18:29,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2020-11-28 03:18:29,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2020-11-28 03:18:29,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 101 transitions. [2020-11-28 03:18:29,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:29,738 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-11-28 03:18:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 101 transitions. [2020-11-28 03:18:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-11-28 03:18:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-28 03:18:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2020-11-28 03:18:29,763 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-11-28 03:18:29,763 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-11-28 03:18:29,763 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:18:29,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. [2020-11-28 03:18:29,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-28 03:18:29,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:29,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:29,767 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, 1] [2020-11-28 03:18:29,767 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] [2020-11-28 03:18:29,767 INFO L794 eck$LassoCheckResult]: Stem: 592#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(49);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;~alive1~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;~alive2~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;~alive3~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]; 564#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 565#L162 assume 0 == ~r1~0; 609#L163 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 576#L164 assume ~id1~0 >= 0; 577#L165 assume 0 == ~st1~0; 579#L166 assume ~send1~0 == ~id1~0; 601#L167 assume 0 == ~mode1~0 % 256; 555#L168 assume ~id2~0 >= 0; 556#L169 assume 0 == ~st2~0; 589#L170 assume ~send2~0 == ~id2~0; 568#L171 assume 0 == ~mode2~0 % 256; 569#L172 assume ~id3~0 >= 0; 593#L173 assume 0 == ~st3~0; 610#L174 assume ~send3~0 == ~id3~0; 543#L175 assume 0 == ~mode3~0 % 256; 544#L176 assume ~id1~0 != ~id2~0; 580#L177 assume ~id1~0 != ~id3~0; 603#L178 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 607#L162-1 init_#res := init_~tmp~0; 584#L231 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 585#L278 assume !(0 == main_~i2~0); 562#L278-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; 563#L286-2 [2020-11-28 03:18:29,767 INFO L796 eck$LassoCheckResult]: Loop: 563#L286-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 583#L57 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; 613#L61 assume !(node1_~m1~0 != ~nomsg~0); 560#L61-1 ~mode1~0 := 0; 575#L57-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 614#L94 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 615#L97 assume !(node2_~m2~0 != ~nomsg~0); 551#L97-1 ~mode2~0 := 0; 582#L94-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 590#L128 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 573#L131 assume !(node3_~m3~0 != ~nomsg~0); 570#L131-1 ~mode3~0 := 0; 557#L128-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; 558#L239 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 598#L240 assume ~r1~0 < 3;check_~tmp~1 := 1; 605#L239-1 check_#res := check_~tmp~1; 611#L251 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 553#L310 assume !(0 == assert_~arg % 256); 554#L305 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 563#L286-2 [2020-11-28 03:18:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:29,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2020-11-28 03:18:29,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:29,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974225793] [2020-11-28 03:18:29,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:29,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:29,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:29,823 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1995544032, now seen corresponding path program 1 times [2020-11-28 03:18:29,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:29,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825662410] [2020-11-28 03:18:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:29,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:29,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:29,852 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash 964547747, now seen corresponding path program 1 times [2020-11-28 03:18:29,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:29,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121138250] [2020-11-28 03:18:29,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:29,903 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:18:29,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121138250] [2020-11-28 03:18:29,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:29,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:18:29,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039220078] [2020-11-28 03:18:30,201 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2020-11-28 03:18:30,502 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2020-11-28 03:18:30,515 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:18:30,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:18:30,517 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:18:30,517 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:18:30,517 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-28 03:18:30,517 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:18:30,517 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:18:30,518 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:18:30,518 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-28 03:18:30,518 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:18:30,518 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:18:30,550 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:18:30,563 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:18:30,568 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:18:30,572 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:18:30,580 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:18:30,587 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:18:30,591 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:18:30,595 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:18:30,598 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:18:30,602 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:18:30,611 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:18:30,615 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:18:30,624 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:18:30,630 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:18:30,639 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:18:30,660 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:18:30,668 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:18:30,671 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:18:30,675 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:18:30,703 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:18:30,707 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:18:30,711 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:18:30,715 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:18:31,360 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2020-11-28 03:18:31,499 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:18:31,500 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:18:31,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-28 03:18:31,513 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:18:31,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-28 03:18:31,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-28 03:18:31,565 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-28 03:18:31,567 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:18:31,567 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:18:31,567 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:18:31,568 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:18:31,568 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:18:31,568 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:18:31,568 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:18:31,568 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:18:31,568 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-28 03:18:31,568 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:18:31,568 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:18:31,586 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:18:31,597 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:18:31,600 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:18:31,615 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:18:31,619 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:18:31,627 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:18:31,631 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:18:31,634 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:18:31,644 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:18:31,649 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:18:31,653 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:18:31,656 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:18:31,660 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:18:31,664 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:18:31,673 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:18:31,681 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:18:31,685 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:18:31,710 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:18:31,720 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:18:31,746 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:18:31,749 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:18:31,758 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:18:31,761 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:18:32,395 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:18:32,403 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_763003fe-9fb5-400a-ae8a-c7935242fc04/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:18:32,411 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:18:32,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:18:32,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:18:32,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:18:32,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:18:32,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:18:32,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:18:32,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:18:32,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:18:32,429 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-28 03:18:32,430 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_763003fe-9fb5-400a-ae8a-c7935242fc04/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:18:32,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 03:18:32,434 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-28 03:18:32,435 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:18:32,436 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:18:32,471 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-28 03:18:32,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:32,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:18:32,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:18:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:32,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:18:32,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:18:32,721 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:18:32,724 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:18:32,725 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-11-28 03:18:32,767 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 123 states and 180 transitions. Complement of second has 4 states. [2020-11-28 03:18:32,767 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:18:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:18:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-11-28 03:18:32,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 19 letters. [2020-11-28 03:18:32,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:18:32,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 42 letters. Loop has 19 letters. [2020-11-28 03:18:32,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:18:32,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 38 letters. [2020-11-28 03:18:32,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:18:32,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 180 transitions. [2020-11-28 03:18:32,775 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:18:32,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2020-11-28 03:18:32,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-28 03:18:32,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-28 03:18:32,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-28 03:18:32,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:32,775 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:18:32,776 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:18:32,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:32,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:18:32,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:18:32,776 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-11-28 03:18:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:32,777 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-11-28 03:18:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-28 03:18:32,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-11-28 03:18:32,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:18:32,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-11-28 03:18:32,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-28 03:18:32,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-28 03:18:32,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-28 03:18:32,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:32,778 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:18:32,778 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:18:32,778 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:18:32,778 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:18:32,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-28 03:18:32,778 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:18:32,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-28 03:18:32,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:18:32 BoogieIcfgContainer [2020-11-28 03:18:32,784 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:18:32,784 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:18:32,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:18:32,784 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:18:32,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:28" (3/4) ... [2020-11-28 03:18:32,787 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-28 03:18:32,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:18:32,789 INFO L168 Benchmark]: Toolchain (without parser) took 5745.45 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 57.3 MB in the beginning and 45.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 53.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:32,790 INFO L168 Benchmark]: CDTParser took 1.18 ms. Allocated memory is still 88.1 MB. Free memory is still 44.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:18:32,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.05 ms. Allocated memory is still 88.1 MB. Free memory was 57.2 MB in the beginning and 62.9 MB in the end (delta: -5.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:32,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.50 ms. Allocated memory is still 88.1 MB. Free memory was 62.9 MB in the beginning and 60.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:32,791 INFO L168 Benchmark]: Boogie Preprocessor took 33.54 ms. Allocated memory is still 88.1 MB. Free memory was 60.8 MB in the beginning and 58.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:32,792 INFO L168 Benchmark]: RCFGBuilder took 900.36 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 58.8 MB in the beginning and 81.0 MB in the end (delta: -22.2 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:32,793 INFO L168 Benchmark]: BuchiAutomizer took 4367.38 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 81.0 MB in the beginning and 45.2 MB in the end (delta: 35.8 MB). Peak memory consumption was 60.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:32,793 INFO L168 Benchmark]: Witness Printer took 3.54 ms. Allocated memory is still 130.0 MB. Free memory is still 45.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:18:32,797 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18 ms. Allocated memory is still 88.1 MB. Free memory is still 44.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 386.05 ms. Allocated memory is still 88.1 MB. Free memory was 57.2 MB in the beginning and 62.9 MB in the end (delta: -5.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.50 ms. Allocated memory is still 88.1 MB. Free memory was 62.9 MB in the beginning and 60.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.54 ms. Allocated memory is still 88.1 MB. Free memory was 60.8 MB in the beginning and 58.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 900.36 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 58.8 MB in the beginning and 81.0 MB in the end (delta: -22.2 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4367.38 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 81.0 MB in the beginning and 45.2 MB in the end (delta: 35.8 MB). Peak memory consumption was 60.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.54 ms. Allocated memory is still 130.0 MB. Free memory is still 45.2 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 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 50 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 73 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 441 SDtfs, 260 SDslu, 699 SDs, 0 SdLazy, 35 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax129 hnf106 lsp22 ukn100 mio100 lsp100 div168 bol100 ite100 ukn100 eq153 hnf75 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 31ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...