./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 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 f872f81062b55a64a24a8c09fb6124976a424d54 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 05:52:16,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:52:16,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:52:16,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:52:16,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:52:16,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:52:16,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:52:16,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:52:16,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:52:16,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:52:16,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:52:16,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:52:16,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:52:16,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:52:16,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:52:16,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:52:16,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:52:16,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:52:16,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:52:16,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:52:16,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:52:16,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:52:16,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:52:16,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:52:16,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:52:16,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:52:16,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:52:16,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:52:16,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:52:16,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:52:16,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:52:16,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:52:16,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:52:16,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:52:16,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:52:16,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:52:16,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:52:16,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:52:16,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:52:16,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:52:16,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:52:16,987 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 05:52:17,035 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:52:17,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:52:17,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:52:17,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:52:17,039 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:52:17,040 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:52:17,040 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:52:17,040 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:52:17,041 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:52:17,041 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:52:17,042 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:52:17,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:52:17,043 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:52:17,043 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:52:17,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:52:17,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:52:17,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:52:17,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:52:17,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:52:17,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:52:17,045 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:52:17,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:52:17,045 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:52:17,046 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:52:17,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:52:17,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:52:17,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:52:17,047 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:52:17,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:52:17,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:52:17,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:52:17,048 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:52:17,050 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:52:17,050 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> f872f81062b55a64a24a8c09fb6124976a424d54 [2020-10-26 05:52:17,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:52:17,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:52:17,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:52:17,520 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:52:17,523 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:52:17,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2020-10-26 05:52:17,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a25258e/bc2eb87fcaf94fd18f2b85601d0e77d1/FLAG97a366247 [2020-10-26 05:52:18,258 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:52:18,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2020-10-26 05:52:18,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a25258e/bc2eb87fcaf94fd18f2b85601d0e77d1/FLAG97a366247 [2020-10-26 05:52:18,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a25258e/bc2eb87fcaf94fd18f2b85601d0e77d1 [2020-10-26 05:52:18,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:52:18,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:52:18,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:52:18,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:52:18,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:52:18,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:52:18" (1/1) ... [2020-10-26 05:52:18,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208bc61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:18, skipping insertion in model container [2020-10-26 05:52:18,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:52:18" (1/1) ... [2020-10-26 05:52:18,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:52:18,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:52:18,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:52:18,964 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:52:19,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:52:19,075 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:52:19,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19 WrapperNode [2020-10-26 05:52:19,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:52:19,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:52:19,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:52:19,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:52:19,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (1/1) ... [2020-10-26 05:52:19,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (1/1) ... [2020-10-26 05:52:19,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:52:19,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:52:19,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:52:19,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:52:19,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (1/1) ... [2020-10-26 05:52:19,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (1/1) ... [2020-10-26 05:52:19,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (1/1) ... [2020-10-26 05:52:19,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (1/1) ... [2020-10-26 05:52:19,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (1/1) ... [2020-10-26 05:52:19,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (1/1) ... [2020-10-26 05:52:19,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (1/1) ... [2020-10-26 05:52:19,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:52:19,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:52:19,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:52:19,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:52:19,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-26 05:52:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:52:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:52:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:52:19,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:52:20,047 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:52:20,048 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-26 05:52:20,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:52:20 BoogieIcfgContainer [2020-10-26 05:52:20,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:52:20,052 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:52:20,052 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:52:20,055 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:52:20,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:52:20,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:52:18" (1/3) ... [2020-10-26 05:52:20,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b8eac93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:52:20, skipping insertion in model container [2020-10-26 05:52:20,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:52:20,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:19" (2/3) ... [2020-10-26 05:52:20,058 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b8eac93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:52:20, skipping insertion in model container [2020-10-26 05:52:20,059 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:52:20,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:52:20" (3/3) ... [2020-10-26 05:52:20,060 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2020-10-26 05:52:20,113 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:52:20,114 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:52:20,114 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:52:20,114 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:52:20,115 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:52:20,115 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:52:20,115 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:52:20,115 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:52:20,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states. [2020-10-26 05:52:20,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2020-10-26 05:52:20,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:52:20,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:52:20,180 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:20,180 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-10-26 05:52:20,180 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:52:20,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states. [2020-10-26 05:52:20,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2020-10-26 05:52:20,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:52:20,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:52:20,203 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:20,203 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-10-26 05:52:20,213 INFO L794 eck$LassoCheckResult]: Stem: 37#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]; 12#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; 26#L209true assume !(0 == ~r1~0);init_~tmp~0 := 0; 24#L209-1true init_#res := init_~tmp~0; 39#L278true main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 23#L325true assume 0 == main_~i2~0;assume false; 4#L325-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; 30#L333-2true [2020-10-26 05:52:20,214 INFO L796 eck$LassoCheckResult]: Loop: 30#L333-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; 51#L104true 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; 77#L108true assume !(node1_~m1~0 != ~nomsg~0); 73#L108-1true ~mode1~0 := 0; 47#L104-2true havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 79#L141true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 46#L144true assume !(node2_~m2~0 != ~nomsg~0); 45#L144-1true ~mode2~0 := 0; 74#L141-2true havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 3#L175true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 64#L178true assume !(node3_~m3~0 != ~nomsg~0); 63#L178-1true ~mode3~0 := 0; 20#L175-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; 32#L286true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 29#L286-1true check_#res := check_~tmp~1; 70#L298true 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; 80#L357true assume !(0 == assert_~arg % 256); 52#L352true main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 30#L333-2true [2020-10-26 05:52:20,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:20,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2020-10-26 05:52:20,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:20,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800180978] [2020-10-26 05:52:20,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:20,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800180978] [2020-10-26 05:52:20,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:20,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:52:20,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72536002] [2020-10-26 05:52:20,493 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:52:20,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:20,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480252, now seen corresponding path program 1 times [2020-10-26 05:52:20,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:20,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447335151] [2020-10-26 05:52:20,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:20,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447335151] [2020-10-26 05:52:20,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:20,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:52:20,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966732758] [2020-10-26 05:52:20,632 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:52:20,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:52:20,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-26 05:52:20,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-26 05:52:20,651 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2020-10-26 05:52:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:52:20,664 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2020-10-26 05:52:20,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 05:52:20,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 125 transitions. [2020-10-26 05:52:20,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-10-26 05:52:20,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 120 transitions. [2020-10-26 05:52:20,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2020-10-26 05:52:20,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2020-10-26 05:52:20,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 120 transitions. [2020-10-26 05:52:20,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:52:20,695 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2020-10-26 05:52:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 120 transitions. [2020-10-26 05:52:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-26 05:52:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-26 05:52:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2020-10-26 05:52:20,729 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2020-10-26 05:52:20,729 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2020-10-26 05:52:20,730 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:52:20,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 120 transitions. [2020-10-26 05:52:20,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-10-26 05:52:20,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:52:20,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:52:20,733 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:20,733 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-10-26 05:52:20,734 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(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]; 193#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; 194#L209 assume !(0 == ~r1~0);init_~tmp~0 := 0; 175#L209-1 init_#res := init_~tmp~0; 204#L278 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 203#L325 assume !(0 == main_~i2~0); 171#L325-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; 172#L333-2 [2020-10-26 05:52:20,734 INFO L796 eck$LassoCheckResult]: Loop: 172#L333-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; 210#L104 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; 230#L108 assume !(node1_~m1~0 != ~nomsg~0); 177#L108-1 ~mode1~0 := 0; 225#L104-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 226#L141 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 223#L144 assume !(node2_~m2~0 != ~nomsg~0); 182#L144-1 ~mode2~0 := 0; 217#L141-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 168#L175 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 169#L178 assume !(node3_~m3~0 != ~nomsg~0); 185#L178-1 ~mode3~0 := 0; 199#L175-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; 200#L286 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 208#L286-1 check_#res := check_~tmp~1; 209#L298 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; 239#L357 assume !(0 == assert_~arg % 256); 231#L352 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 172#L333-2 [2020-10-26 05:52:20,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:20,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2020-10-26 05:52:20,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:20,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125567531] [2020-10-26 05:52:20,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:20,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125567531] [2020-10-26 05:52:20,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:20,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:52:20,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399094169] [2020-10-26 05:52:20,796 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:52:20,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:20,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480252, now seen corresponding path program 2 times [2020-10-26 05:52:20,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:20,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335408253] [2020-10-26 05:52:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:20,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335408253] [2020-10-26 05:52:20,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:20,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:52:20,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451374808] [2020-10-26 05:52:20,884 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:52:20,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:52:20,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:52:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:52:20,886 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. cyclomatic complexity: 48 Second operand 5 states. [2020-10-26 05:52:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:52:21,017 INFO L93 Difference]: Finished difference Result 126 states and 202 transitions. [2020-10-26 05:52:21,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 05:52:21,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 202 transitions. [2020-10-26 05:52:21,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-10-26 05:52:21,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 123 states and 183 transitions. [2020-10-26 05:52:21,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2020-10-26 05:52:21,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2020-10-26 05:52:21,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 183 transitions. [2020-10-26 05:52:21,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:52:21,035 INFO L691 BuchiCegarLoop]: Abstraction has 123 states and 183 transitions. [2020-10-26 05:52:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 183 transitions. [2020-10-26 05:52:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 73. [2020-10-26 05:52:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-26 05:52:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2020-10-26 05:52:21,048 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2020-10-26 05:52:21,049 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2020-10-26 05:52:21,049 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:52:21,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 103 transitions. [2020-10-26 05:52:21,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-10-26 05:52:21,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:52:21,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:52:21,055 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-10-26 05:52:21,055 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-10-26 05:52:21,061 INFO L794 eck$LassoCheckResult]: Stem: 434#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]; 407#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; 408#L209 assume 0 == ~r1~0; 420#L210 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 441#L211 assume ~id1~0 >= 0; 402#L212 assume 0 == ~st1~0; 403#L213 assume ~send1~0 == ~id1~0; 446#L214 assume 0 == ~mode1~0 % 256; 410#L215 assume ~id2~0 >= 0; 411#L216 assume 0 == ~st2~0; 436#L217 assume ~send2~0 == ~id2~0; 452#L218 assume 0 == ~mode2~0 % 256; 387#L219 assume ~id3~0 >= 0; 388#L220 assume 0 == ~st3~0; 421#L221 assume ~send3~0 == ~id3~0; 442#L222 assume 0 == ~mode3~0 % 256; 430#L223 assume ~id1~0 != ~id2~0; 431#L224 assume ~id1~0 != ~id3~0; 447#L225 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 417#L209-1 init_#res := init_~tmp~0; 418#L278 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 416#L325 assume !(0 == main_~i2~0); 385#L325-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; 386#L333-2 [2020-10-26 05:52:21,061 INFO L796 eck$LassoCheckResult]: Loop: 386#L333-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; 424#L104 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; 444#L108 assume !(node1_~m1~0 != ~nomsg~0); 390#L108-1 ~mode1~0 := 0; 439#L104-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 440#L141 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 437#L144 assume !(node2_~m2~0 != ~nomsg~0); 395#L144-1 ~mode2~0 := 0; 433#L141-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 382#L175 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 383#L178 assume !(node3_~m3~0 != ~nomsg~0); 398#L178-1 ~mode3~0 := 0; 414#L175-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; 415#L286 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 422#L286-1 check_#res := check_~tmp~1; 423#L298 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; 453#L357 assume !(0 == assert_~arg % 256); 445#L352 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 386#L333-2 [2020-10-26 05:52:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2020-10-26 05:52:21,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:21,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591935665] [2020-10-26 05:52:21,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:21,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:21,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:21,206 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:52:21,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:21,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480252, now seen corresponding path program 3 times [2020-10-26 05:52:21,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:21,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348420681] [2020-10-26 05:52:21,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:21,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348420681] [2020-10-26 05:52:21,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:21,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:52:21,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425669846] [2020-10-26 05:52:21,297 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:52:21,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:52:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:52:21,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:52:21,299 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. cyclomatic complexity: 31 Second operand 5 states. [2020-10-26 05:52:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:52:21,377 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2020-10-26 05:52:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 05:52:21,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 105 transitions. [2020-10-26 05:52:21,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-10-26 05:52:21,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 101 transitions. [2020-10-26 05:52:21,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2020-10-26 05:52:21,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2020-10-26 05:52:21,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 101 transitions. [2020-10-26 05:52:21,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:52:21,381 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-10-26 05:52:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 101 transitions. [2020-10-26 05:52:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-26 05:52:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-26 05:52:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2020-10-26 05:52:21,387 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-10-26 05:52:21,387 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-10-26 05:52:21,387 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:52:21,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. [2020-10-26 05:52:21,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-10-26 05:52:21,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:52:21,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:52:21,389 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-10-26 05:52:21,389 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-10-26 05:52:21,390 INFO L794 eck$LassoCheckResult]: Stem: 595#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]; 567#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; 568#L209 assume 0 == ~r1~0; 581#L210 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 602#L211 assume ~id1~0 >= 0; 563#L212 assume 0 == ~st1~0; 564#L213 assume ~send1~0 == ~id1~0; 607#L214 assume 0 == ~mode1~0 % 256; 571#L215 assume ~id2~0 >= 0; 572#L216 assume 0 == ~st2~0; 597#L217 assume ~send2~0 == ~id2~0; 613#L218 assume 0 == ~mode2~0 % 256; 548#L219 assume ~id3~0 >= 0; 549#L220 assume 0 == ~st3~0; 582#L221 assume ~send3~0 == ~id3~0; 603#L222 assume 0 == ~mode3~0 % 256; 591#L223 assume ~id1~0 != ~id2~0; 592#L224 assume ~id1~0 != ~id3~0; 609#L225 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 578#L209-1 init_#res := init_~tmp~0; 579#L278 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 577#L325 assume !(0 == main_~i2~0); 546#L325-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; 547#L333-2 [2020-10-26 05:52:21,390 INFO L796 eck$LassoCheckResult]: Loop: 547#L333-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; 585#L104 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; 605#L108 assume !(node1_~m1~0 != ~nomsg~0); 551#L108-1 ~mode1~0 := 0; 600#L104-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 601#L141 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 598#L144 assume !(node2_~m2~0 != ~nomsg~0); 556#L144-1 ~mode2~0 := 0; 594#L141-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 543#L175 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 544#L178 assume !(node3_~m3~0 != ~nomsg~0); 559#L178-1 ~mode3~0 := 0; 573#L175-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; 574#L286 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 586#L287 assume ~r1~0 < 3;check_~tmp~1 := 1; 583#L286-1 check_#res := check_~tmp~1; 584#L298 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; 614#L357 assume !(0 == assert_~arg % 256); 606#L352 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 547#L333-2 [2020-10-26 05:52:21,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:21,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2020-10-26 05:52:21,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:21,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844646155] [2020-10-26 05:52:21,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:21,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:21,435 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:21,455 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:52:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:21,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1995544032, now seen corresponding path program 1 times [2020-10-26 05:52:21,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:21,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979167632] [2020-10-26 05:52:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:21,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:21,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:21,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:52:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash 964547747, now seen corresponding path program 1 times [2020-10-26 05:52:21,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:21,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325285560] [2020-10-26 05:52:21,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:21,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325285560] [2020-10-26 05:52:21,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:21,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:52:21,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928651418] [2020-10-26 05:52:21,874 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2020-10-26 05:52:22,147 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2020-10-26 05:52:22,160 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:52:22,160 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:52:22,161 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:52:22,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:52:22,161 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 05:52:22,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:52:22,162 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:52:22,162 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:52:22,162 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-10-26 05:52:22,162 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:52:22,162 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:52:22,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:22,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,009 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:52:23,010 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-26 05:52:23,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 05:52:23,019 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-26 05:52:23,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 05:52:23,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 05:52:23,078 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 05:52:23,081 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:52:23,081 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:52:23,082 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:52:23,082 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:52:23,082 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 05:52:23,082 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:52:23,082 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:52:23,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:52:23,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-10-26 05:52:23,082 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:52:23,082 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:52:23,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:23,946 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:52:23,951 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:52:23,968 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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:52:23,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:52:23,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:52:23,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:52:23,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:52:23,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:52:23,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:52:23,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:52:23,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 05:52:23,993 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 05:52:23,993 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:52:24,000 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 05:52:24,000 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 05:52:24,001 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 05:52:24,002 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-10-26 05:52:24,052 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 05:52:24,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:24,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 05:52:24,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:52:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:24,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 05:52:24,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:52:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:24,366 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-10-26 05:52:24,367 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-10-26 05:52:24,436 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-10-26 05:52:24,437 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-10-26 05:52:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 05:52:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-10-26 05:52:24,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 19 letters. [2020-10-26 05:52:24,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:52:24,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 42 letters. Loop has 19 letters. [2020-10-26 05:52:24,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:52:24,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 38 letters. [2020-10-26 05:52:24,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:52:24,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 180 transitions. [2020-10-26 05:52:24,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:52:24,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2020-10-26 05:52:24,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:52:24,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:52:24,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:52:24,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:52:24,451 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:52:24,451 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:52:24,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:52:24,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:52:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:52:24,453 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-10-26 05:52:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:52:24,453 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-26 05:52:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 05:52:24,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-26 05:52:24,454 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:52:24,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 05:52:24,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:52:24,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:52:24,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:52:24,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:52:24,455 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:52:24,455 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:52:24,455 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:52:24,455 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:52:24,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 05:52:24,455 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:52:24,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 05:52:24,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:52:24 BoogieIcfgContainer [2020-10-26 05:52:24,461 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:52:24,462 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:52:24,462 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:52:24,462 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:52:24,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:52:20" (3/4) ... [2020-10-26 05:52:24,465 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 05:52:24,465 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:52:24,467 INFO L168 Benchmark]: Toolchain (without parser) took 5844.74 ms. Allocated memory was 48.2 MB in the beginning and 111.1 MB in the end (delta: 62.9 MB). Free memory was 24.5 MB in the beginning and 77.7 MB in the end (delta: -53.3 MB). Peak memory consumption was 12.5 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:24,467 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 48.2 MB. Free memory is still 29.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:52:24,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.05 ms. Allocated memory is still 48.2 MB. Free memory was 23.8 MB in the beginning and 22.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:24,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.65 ms. Allocated memory was 48.2 MB in the beginning and 62.9 MB in the end (delta: 14.7 MB). Free memory was 22.1 MB in the beginning and 46.3 MB in the end (delta: -24.1 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:24,470 INFO L168 Benchmark]: Boogie Preprocessor took 39.30 ms. Allocated memory is still 62.9 MB. Free memory was 46.3 MB in the beginning and 44.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:24,471 INFO L168 Benchmark]: RCFGBuilder took 862.35 ms. Allocated memory is still 62.9 MB. Free memory was 44.4 MB in the beginning and 29.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:24,471 INFO L168 Benchmark]: BuchiAutomizer took 4409.45 ms. Allocated memory was 62.9 MB in the beginning and 111.1 MB in the end (delta: 48.2 MB). Free memory was 29.3 MB in the beginning and 78.8 MB in the end (delta: -49.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:52:24,472 INFO L168 Benchmark]: Witness Printer took 3.37 ms. Allocated memory is still 111.1 MB. Free memory was 78.8 MB in the beginning and 77.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:24,478 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 48.2 MB. Free memory is still 29.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 445.05 ms. Allocated memory is still 48.2 MB. Free memory was 23.8 MB in the beginning and 22.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.65 ms. Allocated memory was 48.2 MB in the beginning and 62.9 MB in the end (delta: 14.7 MB). Free memory was 22.1 MB in the beginning and 46.3 MB in the end (delta: -24.1 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.30 ms. Allocated memory is still 62.9 MB. Free memory was 46.3 MB in the beginning and 44.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 862.35 ms. Allocated memory is still 62.9 MB. Free memory was 44.4 MB in the beginning and 29.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4409.45 ms. Allocated memory was 62.9 MB in the beginning and 111.1 MB in the end (delta: 48.2 MB). Free memory was 29.3 MB in the beginning and 78.8 MB in the end (delta: -49.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 3.37 ms. Allocated memory is still 111.1 MB. Free memory was 78.8 MB in the beginning and 77.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. 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.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 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: 48ms 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...