./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.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.7.ufo.BOUNDED-14.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 a653a3dff9cd3dfb980f532209c278feb5859b6c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:56:01,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:56:01,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:56:01,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:56:01,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:56:01,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:56:01,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:56:01,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:56:01,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:56:01,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:56:01,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:56:01,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:56:01,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:56:01,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:56:01,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:56:01,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:56:01,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:56:01,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:56:01,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:56:01,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:56:01,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:56:01,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:56:01,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:56:01,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:56:01,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:56:01,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:56:01,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:56:01,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:56:01,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:56:01,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:56:01,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:56:01,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:56:01,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:56:01,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:56:01,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:56:01,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:56:01,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:56:01,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:56:01,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:56:01,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:56:01,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:56:01,835 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:56:01,886 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:56:01,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:56:01,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:56:01,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:56:01,888 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:56:01,889 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:56:01,889 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:56:01,889 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:56:01,889 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:56:01,890 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:56:01,890 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:56:01,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:56:01,890 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:56:01,891 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:56:01,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:56:01,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:56:01,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:56:01,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:56:01,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:56:01,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:56:01,893 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:56:01,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:56:01,893 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:56:01,893 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:56:01,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:56:01,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:56:01,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:56:01,894 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:56:01,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:56:01,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:56:01,895 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:56:01,895 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:56:01,897 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:56:01,897 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 -> a653a3dff9cd3dfb980f532209c278feb5859b6c [2020-10-26 05:56:02,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:56:02,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:56:02,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:56:02,309 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:56:02,312 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:56:02,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2020-10-26 05:56:02,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3346b330/2960ddfb1f9c4e3782b6206fe78feb33/FLAG05a330d41 [2020-10-26 05:56:03,110 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:56:03,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2020-10-26 05:56:03,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3346b330/2960ddfb1f9c4e3782b6206fe78feb33/FLAG05a330d41 [2020-10-26 05:56:03,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3346b330/2960ddfb1f9c4e3782b6206fe78feb33 [2020-10-26 05:56:03,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:56:03,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:56:03,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:56:03,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:56:03,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:56:03,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:56:03" (1/1) ... [2020-10-26 05:56:03,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199b7d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:03, skipping insertion in model container [2020-10-26 05:56:03,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:56:03" (1/1) ... [2020-10-26 05:56:03,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:56:03,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:56:03,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:56:03,969 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:56:04,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:56:04,062 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:56:04,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:04 WrapperNode [2020-10-26 05:56:04,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:56:04,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:56:04,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:56:04,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:56:04,073 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:56:04" (1/1) ... [2020-10-26 05:56:04,087 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:56:04" (1/1) ... [2020-10-26 05:56:04,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:56:04,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:56:04,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:56:04,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:56:04,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:04" (1/1) ... [2020-10-26 05:56:04,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:04" (1/1) ... [2020-10-26 05:56:04,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:04" (1/1) ... [2020-10-26 05:56:04,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:04" (1/1) ... [2020-10-26 05:56:04,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:04" (1/1) ... [2020-10-26 05:56:04,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:04" (1/1) ... [2020-10-26 05:56:04,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:04" (1/1) ... [2020-10-26 05:56:04,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:56:04,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:56:04,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:56:04,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:56:04,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:04" (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:56:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:56:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:56:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:56:04,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:56:05,150 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:56:05,150 INFO L298 CfgBuilder]: Removed 29 assume(true) statements. [2020-10-26 05:56:05,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:56:05 BoogieIcfgContainer [2020-10-26 05:56:05,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:56:05,154 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:56:05,154 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:56:05,158 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:56:05,159 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:56:05,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:56:03" (1/3) ... [2020-10-26 05:56:05,161 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dc7ea87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:56:05, skipping insertion in model container [2020-10-26 05:56:05,161 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:56:05,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:56:04" (2/3) ... [2020-10-26 05:56:05,161 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dc7ea87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:56:05, skipping insertion in model container [2020-10-26 05:56:05,162 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:56:05,162 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:56:05" (3/3) ... [2020-10-26 05:56:05,163 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c [2020-10-26 05:56:05,215 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:56:05,215 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:56:05,215 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:56:05,216 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:56:05,216 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:56:05,216 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:56:05,216 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:56:05,216 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:56:05,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2020-10-26 05:56:05,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-10-26 05:56:05,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:56:05,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:56:05,279 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:05,279 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:05,280 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:56:05,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2020-10-26 05:56:05,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-10-26 05:56:05,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:56:05,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:56:05,298 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:05,298 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:05,307 INFO L794 eck$LassoCheckResult]: Stem: 96#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(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 14#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~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;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 58#L309true assume !(0 == ~r1~0);init_~tmp~0 := 0; 47#L309-1true init_#res := init_~tmp~0; 48#L510true main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 69#L69true assume !(0 == assume_abort_if_not_~cond); 129#L68true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 113#L594-2true [2020-10-26 05:56:05,309 INFO L796 eck$LassoCheckResult]: Loop: 113#L594-2true assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 98#L132true assume !(0 != ~mode1~0 % 256); 71#L146true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 70#L146-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 97#L132-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 25#L158true assume !(0 != ~mode2~0 % 256); 74#L171true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 59#L171-2true ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 22#L158-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 31#L183true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 3#L186true assume !(node3_~m3~0 != ~nomsg~0); 20#L186-1true ~mode3~0 := 0; 28#L183-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 4#L208true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 121#L211true assume !(node4_~m4~0 != ~nomsg~0); 120#L211-1true ~mode4~0 := 0; 19#L208-2true havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 122#L233true assume !(0 != ~mode5~0 % 256); 49#L246true assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite11 := ~p5_new~0; 26#L246-2true ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 119#L233-2true havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 126#L258true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 99#L261true assume !(node6_~m6~0 != ~nomsg~0); 116#L261-1true ~mode6~0 := 0; 123#L258-2true havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 100#L283true assume !(0 != ~mode7~0 % 256); 12#L296true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite13 := ~send7~0; 6#L296-2true ~p7_new~0 := (if node7_#t~ite13 % 256 <= 127 then node7_#t~ite13 % 256 else node7_#t~ite13 % 256 - 256);havoc node7_#t~ite13;~mode7~0 := 1; 114#L283-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 66#L518true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1 := 0; 67#L518-1true check_#res := check_~tmp~1; 37#L538true main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 101#L630true assume !(0 == assert_~arg % 256); 77#L625true main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 113#L594-2true [2020-10-26 05:56:05,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:05,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2087378158, now seen corresponding path program 1 times [2020-10-26 05:56:05,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:05,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924848577] [2020-10-26 05:56:05,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:05,633 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:56:05,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924848577] [2020-10-26 05:56:05,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:56:05,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:56:05,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317498913] [2020-10-26 05:56:05,641 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:56:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash -338600038, now seen corresponding path program 1 times [2020-10-26 05:56:05,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:05,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936034005] [2020-10-26 05:56:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:05,862 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:56:05,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936034005] [2020-10-26 05:56:05,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:56:05,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:56:05,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907368415] [2020-10-26 05:56:05,866 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:56:05,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:56:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:56:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:56:05,887 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 5 states. [2020-10-26 05:56:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:56:06,037 INFO L93 Difference]: Finished difference Result 130 states and 219 transitions. [2020-10-26 05:56:06,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 05:56:06,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 219 transitions. [2020-10-26 05:56:06,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-10-26 05:56:06,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 162 transitions. [2020-10-26 05:56:06,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2020-10-26 05:56:06,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2020-10-26 05:56:06,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 162 transitions. [2020-10-26 05:56:06,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:56:06,054 INFO L691 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2020-10-26 05:56:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 162 transitions. [2020-10-26 05:56:06,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-10-26 05:56:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-26 05:56:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2020-10-26 05:56:06,095 INFO L714 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2020-10-26 05:56:06,095 INFO L594 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2020-10-26 05:56:06,095 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:56:06,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 162 transitions. [2020-10-26 05:56:06,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-10-26 05:56:06,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:56:06,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:56:06,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:06,101 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:06,102 INFO L794 eck$LassoCheckResult]: Stem: 391#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(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 298#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~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;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 299#L309 assume 0 == ~r1~0; 292#L310 assume ~id1~0 >= 0; 293#L311 assume 0 == ~st1~0; 348#L312 assume ~send1~0 == ~id1~0; 349#L313 assume 0 == ~mode1~0 % 256; 388#L314 assume ~id2~0 >= 0; 335#L315 assume 0 == ~st2~0; 336#L316 assume ~send2~0 == ~id2~0; 371#L317 assume 0 == ~mode2~0 % 256; 304#L318 assume ~id3~0 >= 0; 305#L319 assume 0 == ~st3~0; 365#L320 assume ~send3~0 == ~id3~0; 290#L321 assume 0 == ~mode3~0 % 256; 291#L322 assume ~id4~0 >= 0; 346#L323 assume 0 == ~st4~0; 347#L324 assume ~send4~0 == ~id4~0; 387#L325 assume 0 == ~mode4~0 % 256; 332#L326 assume ~id5~0 >= 0; 333#L327 assume 0 == ~st5~0; 370#L328 assume ~send5~0 == ~id5~0; 302#L329 assume 0 == ~mode5~0 % 256; 303#L330 assume ~id6~0 >= 0; 364#L331 assume 0 == ~st6~0; 288#L332 assume ~send6~0 == ~id6~0; 289#L333 assume 0 == ~mode6~0 % 256; 344#L334 assume ~id7~0 >= 0; 345#L335 assume 0 == ~st7~0; 386#L336 assume ~send7~0 == ~id7~0; 330#L337 assume 0 == ~mode7~0 % 256; 331#L338 assume ~id1~0 != ~id2~0; 369#L339 assume ~id1~0 != ~id3~0; 300#L340 assume ~id1~0 != ~id4~0; 301#L341 assume ~id1~0 != ~id5~0; 363#L342 assume ~id1~0 != ~id6~0; 286#L343 assume ~id1~0 != ~id7~0; 287#L344 assume ~id2~0 != ~id3~0; 342#L345 assume ~id2~0 != ~id4~0; 343#L346 assume ~id2~0 != ~id5~0; 385#L347 assume ~id2~0 != ~id6~0; 327#L348 assume ~id2~0 != ~id7~0; 328#L349 assume ~id3~0 != ~id4~0; 368#L350 assume ~id3~0 != ~id5~0; 321#L351 assume ~id3~0 != ~id6~0; 322#L352 assume ~id3~0 != ~id7~0; 362#L353 assume ~id4~0 != ~id5~0; 284#L354 assume ~id4~0 != ~id6~0; 285#L355 assume ~id4~0 != ~id7~0; 340#L356 assume ~id5~0 != ~id6~0; 341#L357 assume ~id5~0 != ~id7~0; 383#L358 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 353#L309-1 init_#res := init_~tmp~0; 354#L510 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 355#L69 assume !(0 == assume_abort_if_not_~cond); 374#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 382#L594-2 [2020-10-26 05:56:06,102 INFO L796 eck$LassoCheckResult]: Loop: 382#L594-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 392#L132 assume !(0 != ~mode1~0 % 256); 376#L146 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 375#L146-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 315#L132-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 318#L158 assume !(0 != ~mode2~0 % 256); 320#L171 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 366#L171-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 312#L158-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 313#L183 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 276#L186 assume !(node3_~m3~0 != ~nomsg~0); 277#L186-1 ~mode3~0 := 0; 309#L183-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 279#L208 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 280#L211 assume !(node4_~m4~0 != ~nomsg~0); 379#L211-1 ~mode4~0 := 0; 307#L208-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 308#L233 assume !(0 != ~mode5~0 % 256); 356#L246 assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite11 := ~p5_new~0; 323#L246-2 ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 324#L233-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 396#L258 assume !(0 != ~mode6~0 % 256); 310#L271 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite12 := ~send6~0; 311#L271-2 ~p6_new~0 := (if node6_#t~ite12 % 256 <= 127 then node6_#t~ite12 % 256 else node6_#t~ite12 % 256 - 256);havoc node6_#t~ite12;~mode6~0 := 1; 334#L258-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 394#L283 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 390#L286 assume !(node7_~m7~0 != ~nomsg~0); 358#L286-1 ~mode7~0 := 0; 283#L283-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 373#L518 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1 := 0; 296#L518-1 check_#res := check_~tmp~1; 337#L538 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 338#L630 assume !(0 == assert_~arg % 256); 381#L625 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 382#L594-2 [2020-10-26 05:56:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:06,103 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 1 times [2020-10-26 05:56:06,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:06,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833581537] [2020-10-26 05:56:06,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:06,156 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:06,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:06,333 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:56:06,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1218792294, now seen corresponding path program 1 times [2020-10-26 05:56:06,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:06,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946556317] [2020-10-26 05:56:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:06,504 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:56:06,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946556317] [2020-10-26 05:56:06,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:56:06,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:56:06,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22452438] [2020-10-26 05:56:06,506 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:56:06,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:56:06,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:56:06,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:56:06,510 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. cyclomatic complexity: 41 Second operand 5 states. [2020-10-26 05:56:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:56:06,581 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2020-10-26 05:56:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 05:56:06,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 164 transitions. [2020-10-26 05:56:06,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-10-26 05:56:06,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 122 states and 159 transitions. [2020-10-26 05:56:06,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2020-10-26 05:56:06,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2020-10-26 05:56:06,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 159 transitions. [2020-10-26 05:56:06,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:56:06,606 INFO L691 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2020-10-26 05:56:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 159 transitions. [2020-10-26 05:56:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-10-26 05:56:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-26 05:56:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2020-10-26 05:56:06,621 INFO L714 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2020-10-26 05:56:06,621 INFO L594 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2020-10-26 05:56:06,622 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:56:06,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 159 transitions. [2020-10-26 05:56:06,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-10-26 05:56:06,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:56:06,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:56:06,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:06,632 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:06,633 INFO L794 eck$LassoCheckResult]: Stem: 650#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(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 556#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~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;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 557#L309 assume 0 == ~r1~0; 551#L310 assume ~id1~0 >= 0; 552#L311 assume 0 == ~st1~0; 607#L312 assume ~send1~0 == ~id1~0; 608#L313 assume 0 == ~mode1~0 % 256; 647#L314 assume ~id2~0 >= 0; 593#L315 assume 0 == ~st2~0; 594#L316 assume ~send2~0 == ~id2~0; 630#L317 assume 0 == ~mode2~0 % 256; 562#L318 assume ~id3~0 >= 0; 563#L319 assume 0 == ~st3~0; 624#L320 assume ~send3~0 == ~id3~0; 549#L321 assume 0 == ~mode3~0 % 256; 550#L322 assume ~id4~0 >= 0; 605#L323 assume 0 == ~st4~0; 606#L324 assume ~send4~0 == ~id4~0; 646#L325 assume 0 == ~mode4~0 % 256; 590#L326 assume ~id5~0 >= 0; 591#L327 assume 0 == ~st5~0; 629#L328 assume ~send5~0 == ~id5~0; 560#L329 assume 0 == ~mode5~0 % 256; 561#L330 assume ~id6~0 >= 0; 623#L331 assume 0 == ~st6~0; 547#L332 assume ~send6~0 == ~id6~0; 548#L333 assume 0 == ~mode6~0 % 256; 603#L334 assume ~id7~0 >= 0; 604#L335 assume 0 == ~st7~0; 645#L336 assume ~send7~0 == ~id7~0; 588#L337 assume 0 == ~mode7~0 % 256; 589#L338 assume ~id1~0 != ~id2~0; 628#L339 assume ~id1~0 != ~id3~0; 558#L340 assume ~id1~0 != ~id4~0; 559#L341 assume ~id1~0 != ~id5~0; 622#L342 assume ~id1~0 != ~id6~0; 545#L343 assume ~id1~0 != ~id7~0; 546#L344 assume ~id2~0 != ~id3~0; 601#L345 assume ~id2~0 != ~id4~0; 602#L346 assume ~id2~0 != ~id5~0; 644#L347 assume ~id2~0 != ~id6~0; 585#L348 assume ~id2~0 != ~id7~0; 586#L349 assume ~id3~0 != ~id4~0; 627#L350 assume ~id3~0 != ~id5~0; 579#L351 assume ~id3~0 != ~id6~0; 580#L352 assume ~id3~0 != ~id7~0; 621#L353 assume ~id4~0 != ~id5~0; 543#L354 assume ~id4~0 != ~id6~0; 544#L355 assume ~id4~0 != ~id7~0; 599#L356 assume ~id5~0 != ~id6~0; 600#L357 assume ~id5~0 != ~id7~0; 642#L358 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 612#L309-1 init_#res := init_~tmp~0; 613#L510 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 614#L69 assume !(0 == assume_abort_if_not_~cond); 633#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 641#L594-2 [2020-10-26 05:56:06,634 INFO L796 eck$LassoCheckResult]: Loop: 641#L594-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 651#L132 assume !(0 != ~mode1~0 % 256); 635#L146 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 634#L146-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 573#L132-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 576#L158 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 577#L161 assume !(node2_~m2~0 != ~nomsg~0); 583#L161-1 ~mode2~0 := 0; 570#L158-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 571#L183 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 535#L186 assume !(node3_~m3~0 != ~nomsg~0); 536#L186-1 ~mode3~0 := 0; 567#L183-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 538#L208 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 539#L211 assume !(node4_~m4~0 != ~nomsg~0); 638#L211-1 ~mode4~0 := 0; 565#L208-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 566#L233 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 656#L236 assume !(node5_~m5~0 != ~nomsg~0); 619#L236-1 ~mode5~0 := 0; 582#L233-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 655#L258 assume !(0 != ~mode6~0 % 256); 568#L271 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite12 := ~send6~0; 569#L271-2 ~p6_new~0 := (if node6_#t~ite12 % 256 <= 127 then node6_#t~ite12 % 256 else node6_#t~ite12 % 256 - 256);havoc node6_#t~ite12;~mode6~0 := 1; 592#L258-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 653#L283 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 649#L286 assume !(node7_~m7~0 != ~nomsg~0); 617#L286-1 ~mode7~0 := 0; 542#L283-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 632#L518 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 564#L519 assume ~r1~0 >= 7; 555#L523 assume ~r1~0 < 7;check_~tmp~1 := 1; 598#L518-1 check_#res := check_~tmp~1; 595#L538 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 596#L630 assume !(0 == assert_~arg % 256); 640#L625 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 641#L594-2 [2020-10-26 05:56:06,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:06,637 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 2 times [2020-10-26 05:56:06,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:06,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615130843] [2020-10-26 05:56:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:06,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:06,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:06,749 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:56:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash 200977376, now seen corresponding path program 1 times [2020-10-26 05:56:06,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:06,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098435864] [2020-10-26 05:56:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:06,781 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:56:06,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098435864] [2020-10-26 05:56:06,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:56:06,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:56:06,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203060145] [2020-10-26 05:56:06,782 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:56:06,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:56:06,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:56:06,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:56:06,784 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. cyclomatic complexity: 38 Second operand 3 states. [2020-10-26 05:56:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:56:06,815 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2020-10-26 05:56:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:56:06,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 251 transitions. [2020-10-26 05:56:06,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2020-10-26 05:56:06,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 251 transitions. [2020-10-26 05:56:06,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2020-10-26 05:56:06,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2020-10-26 05:56:06,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 251 transitions. [2020-10-26 05:56:06,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:56:06,823 INFO L691 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2020-10-26 05:56:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 251 transitions. [2020-10-26 05:56:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2020-10-26 05:56:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-10-26 05:56:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2020-10-26 05:56:06,834 INFO L714 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2020-10-26 05:56:06,834 INFO L594 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2020-10-26 05:56:06,835 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:56:06,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 251 transitions. [2020-10-26 05:56:06,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2020-10-26 05:56:06,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:56:06,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:56:06,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:06,838 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:56:06,839 INFO L794 eck$LassoCheckResult]: Stem: 962#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(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 866#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~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;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 867#L309 assume 0 == ~r1~0; 861#L310 assume ~id1~0 >= 0; 862#L311 assume 0 == ~st1~0; 919#L312 assume ~send1~0 == ~id1~0; 920#L313 assume 0 == ~mode1~0 % 256; 959#L314 assume ~id2~0 >= 0; 904#L315 assume 0 == ~st2~0; 905#L316 assume ~send2~0 == ~id2~0; 941#L317 assume 0 == ~mode2~0 % 256; 872#L318 assume ~id3~0 >= 0; 873#L319 assume 0 == ~st3~0; 935#L320 assume ~send3~0 == ~id3~0; 859#L321 assume 0 == ~mode3~0 % 256; 860#L322 assume ~id4~0 >= 0; 916#L323 assume 0 == ~st4~0; 917#L324 assume ~send4~0 == ~id4~0; 958#L325 assume 0 == ~mode4~0 % 256; 902#L326 assume ~id5~0 >= 0; 903#L327 assume 0 == ~st5~0; 940#L328 assume ~send5~0 == ~id5~0; 870#L329 assume 0 == ~mode5~0 % 256; 871#L330 assume ~id6~0 >= 0; 934#L331 assume 0 == ~st6~0; 857#L332 assume ~send6~0 == ~id6~0; 858#L333 assume 0 == ~mode6~0 % 256; 914#L334 assume ~id7~0 >= 0; 915#L335 assume 0 == ~st7~0; 957#L336 assume ~send7~0 == ~id7~0; 899#L337 assume 0 == ~mode7~0 % 256; 900#L338 assume ~id1~0 != ~id2~0; 939#L339 assume ~id1~0 != ~id3~0; 868#L340 assume ~id1~0 != ~id4~0; 869#L341 assume ~id1~0 != ~id5~0; 933#L342 assume ~id1~0 != ~id6~0; 855#L343 assume ~id1~0 != ~id7~0; 856#L344 assume ~id2~0 != ~id3~0; 912#L345 assume ~id2~0 != ~id4~0; 913#L346 assume ~id2~0 != ~id5~0; 956#L347 assume ~id2~0 != ~id6~0; 897#L348 assume ~id2~0 != ~id7~0; 898#L349 assume ~id3~0 != ~id4~0; 938#L350 assume ~id3~0 != ~id5~0; 892#L351 assume ~id3~0 != ~id6~0; 893#L352 assume ~id3~0 != ~id7~0; 932#L353 assume ~id4~0 != ~id5~0; 853#L354 assume ~id4~0 != ~id6~0; 854#L355 assume ~id4~0 != ~id7~0; 910#L356 assume ~id5~0 != ~id6~0; 911#L357 assume ~id5~0 != ~id7~0; 955#L358 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 923#L309-1 init_#res := init_~tmp~0; 924#L510 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 925#L69 assume !(0 == assume_abort_if_not_~cond); 944#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 969#L594-2 [2020-10-26 05:56:06,839 INFO L796 eck$LassoCheckResult]: Loop: 969#L594-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1022#L132 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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 885#L136 assume !(node1_~m1~0 != ~nomsg~0); 883#L136-1 ~mode1~0 := 0; 884#L132-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1019#L158 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1016#L161 assume !(node2_~m2~0 != ~nomsg~0); 1014#L161-1 ~mode2~0 := 0; 1012#L158-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1011#L183 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1008#L186 assume !(node3_~m3~0 != ~nomsg~0); 1006#L186-1 ~mode3~0 := 0; 1004#L183-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1003#L208 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1000#L211 assume !(node4_~m4~0 != ~nomsg~0); 998#L211-1 ~mode4~0 := 0; 996#L208-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 995#L233 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 992#L236 assume !(node5_~m5~0 != ~nomsg~0); 990#L236-1 ~mode5~0 := 0; 988#L233-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 987#L258 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 984#L261 assume !(node6_~m6~0 != ~nomsg~0); 982#L261-1 ~mode6~0 := 0; 980#L258-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 979#L283 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 977#L286 assume !(node7_~m7~0 != ~nomsg~0); 974#L286-1 ~mode7~0 := 0; 972#L283-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 971#L518 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 970#L519 assume !(~r1~0 >= 7); 864#L522 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; 865#L523 assume ~r1~0 < 7;check_~tmp~1 := 1; 1026#L518-1 check_#res := check_~tmp~1; 1025#L538 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1024#L630 assume !(0 == assert_~arg % 256); 1023#L625 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 969#L594-2 [2020-10-26 05:56:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 3 times [2020-10-26 05:56:06,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:06,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405571352] [2020-10-26 05:56:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:06,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:06,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:06,946 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:56:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:06,949 INFO L82 PathProgramCache]: Analyzing trace with hash -984441711, now seen corresponding path program 1 times [2020-10-26 05:56:06,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:06,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508930216] [2020-10-26 05:56:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:06,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:56:06,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:56:06,996 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:56:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1657790752, now seen corresponding path program 1 times [2020-10-26 05:56:06,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:56:06,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395880774] [2020-10-26 05:56:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:56:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:07,117 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:56:07,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395880774] [2020-10-26 05:56:07,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:56:07,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:56:07,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958222020] [2020-10-26 05:56:07,935 WARN L193 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 178 [2020-10-26 05:56:08,595 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 151 [2020-10-26 05:56:08,608 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:56:08,609 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:56:08,609 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:56:08,610 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:56:08,610 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 05:56:08,610 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:08,610 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:56:08,610 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:56:08,611 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2020-10-26 05:56:08,611 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:56:08,611 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:56:08,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:08,740 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:56:08,748 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:56:08,753 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:56:08,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:08,771 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:56:08,795 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:56:08,799 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:56:08,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:08,810 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:56:08,815 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:56:08,824 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:56:08,828 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:56:08,836 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:56:08,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:08,845 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:56:08,854 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:56:08,858 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:56:08,865 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:56:08,873 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:56:08,876 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:56:08,883 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:56:08,892 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:56:08,900 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:56:08,907 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:56:08,911 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:56:08,916 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:56:08,922 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:56:08,926 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:56:08,931 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:56:08,934 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:56:08,941 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:56:08,947 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:56:08,952 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:56:08,955 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:56:08,959 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:56:09,273 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-26 05:56:10,076 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-26 05:56:10,457 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:56:10,459 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:56:10,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 05:56:10,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 05:56:10,529 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 05:56:10,530 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p1_old~0=-8, ~nomsg~0=-8, ULTIMATE.start_node4_~m4~0=-8, ~p6_new~0=-8, ULTIMATE.start_node7_~m7~0=-8, ~p7_new~0=-8, ULTIMATE.start_node5_~m5~0=-8, ~p3_old~0=-8, ~p5_new~0=-8, ~p2_old~0=-8, ~p4_old~0=-8, ~p5_old~0=-8, ULTIMATE.start_node2_~m2~0=-8, ~p7_old~0=-8, ~p1_new~0=-8, ~p2_new~0=-8, ~p3_new~0=-8, ~p4_new~0=-8, ~p6_old~0=-8, ULTIMATE.start_node1_~m1~0=-8, ULTIMATE.start_node6_~m6~0=-8, ULTIMATE.start_node3_~m3~0=-8} Honda state: {~p1_old~0=-8, ~nomsg~0=-8, ULTIMATE.start_node4_~m4~0=-8, ~p6_new~0=-8, ULTIMATE.start_node7_~m7~0=-8, ~p7_new~0=-8, ULTIMATE.start_node5_~m5~0=-8, ~p3_old~0=-8, ~p5_new~0=-8, ~p2_old~0=-8, ~p4_old~0=-8, ~p5_old~0=-8, ULTIMATE.start_node2_~m2~0=-8, ~p7_old~0=-8, ~p1_new~0=-8, ~p2_new~0=-8, ~p3_new~0=-8, ~p4_new~0=-8, ~p6_old~0=-8, ULTIMATE.start_node1_~m1~0=-8, ULTIMATE.start_node6_~m6~0=-8, ULTIMATE.start_node3_~m3~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-10-26 05:56:10,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 05:56:10,611 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:10,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 05:56:10,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 05:56:10,850 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 05:56:10,852 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:56:10,852 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:56:10,852 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:56:10,852 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:56:10,852 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 05:56:10,852 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:10,852 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:56:10,852 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:56:10,852 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2020-10-26 05:56:10,853 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:56:10,853 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:56:10,859 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:56:10,869 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:56:10,873 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:56:10,881 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:56:10,884 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:56:10,915 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:56:11,016 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:56:11,021 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:56:11,025 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:56:11,032 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:56:11,036 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:56:11,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:11,052 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:56:11,063 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:56:11,068 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:56:11,073 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:56:11,076 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:56:11,080 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:56:11,088 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:56:11,091 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:56:11,099 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:56:11,104 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:56:11,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:56:11,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:56:11,119 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:56:11,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:56:11,131 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:56:11,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:56:11,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:56:11,143 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:56:11,152 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:56:11,156 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:56:11,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:56:11,171 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:56:11,175 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:56:11,178 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:56:11,589 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-26 05:56:12,328 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-26 05:56:12,558 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:56:12,564 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:12,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:12,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:12,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:12,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:12,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:12,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:12,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:12,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:12,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:12,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:12,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:12,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:12,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:12,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:12,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:56:12,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:56:12,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:12,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:12,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:12,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:12,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:12,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:12,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:12,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:12,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:12,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:56:12,694 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:12,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:12,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:12,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:12,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:12,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:12,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:12,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:12,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:56:12,740 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:12,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:12,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:12,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:12,743 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 05:56:12,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:12,747 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-26 05:56:12,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:12,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:56:12,799 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:12,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:12,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:12,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:12,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:12,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:12,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:12,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:12,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:12,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:12,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:12,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:12,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:12,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:12,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:12,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:12,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:12,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:12,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:12,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:12,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:12,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:12,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:12,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:56:12,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:56:12,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:12,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:12,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:12,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:12,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:12,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:12,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:12,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:12,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:12,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:12,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:12,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:12,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:12,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:12,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:12,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:56:12,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:56:12,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:13,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:13,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:13,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:13,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:13,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:56:13,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:56:13,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:56:13,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:13,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:13,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:13,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:13,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:13,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:13,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:13,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:13,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:13,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:13,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:13,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:13,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:13,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:13,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:13,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:13,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:13,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:13,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:13,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:13,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:56:13,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:56:13,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:13,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:13,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:13,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:13,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:13,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:13,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:13,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:13,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:13,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:13,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:13,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:13,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:13,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:13,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:13,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:13,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:13,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:13,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:13,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:13,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:13,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:56:13,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:56:13,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:13,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:13,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:13,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:13,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:13,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:13,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:13,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:13,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:13,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:13,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:13,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:13,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:13,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:13,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:13,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:13,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:56:13,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:56:13,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:56:13,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:56:13,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:56:13,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:56:13,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:56:13,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:56:13,323 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 05:56:13,330 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 05:56:13,330 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:56:13,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 05:56:13,338 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 05:56:13,338 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 05:56:13,339 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 27 Supporting invariants [] Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:56:13,379 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 05:56:13,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:56:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:13,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 05:56:13,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:56:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:56:13,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 05:56:13,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:56:13,658 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:56:13,664 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:56:13,665 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 251 transitions. cyclomatic complexity: 70 Second operand 3 states. [2020-10-26 05:56:13,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 182 states and 251 transitions. cyclomatic complexity: 70. Second operand 3 states. Result 307 states and 446 transitions. Complement of second has 4 states. [2020-10-26 05:56:13,734 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:56:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 05:56:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-10-26 05:56:13,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 37 letters. [2020-10-26 05:56:13,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:56:13,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 93 letters. Loop has 37 letters. [2020-10-26 05:56:13,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:56:13,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 74 letters. [2020-10-26 05:56:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:56:13,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 446 transitions. [2020-10-26 05:56:13,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:56:13,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 0 states and 0 transitions. [2020-10-26 05:56:13,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:56:13,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:56:13,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:56:13,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:56:13,746 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:56:13,746 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:56:13,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:56:13,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:56:13,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:56:13,747 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-10-26 05:56:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:56:13,748 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-26 05:56:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 05:56:13,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-26 05:56:13,748 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:56:13,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 05:56:13,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:56:13,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:56:13,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:56:13,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:56:13,749 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:56:13,749 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:56:13,749 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:56:13,749 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:56:13,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 05:56:13,750 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:56:13,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 05:56:13,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:56:13 BoogieIcfgContainer [2020-10-26 05:56:13,756 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:56:13,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:56:13,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:56:13,757 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:56:13,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:56:05" (3/4) ... [2020-10-26 05:56:13,761 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 05:56:13,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:56:13,763 INFO L168 Benchmark]: Toolchain (without parser) took 10363.26 ms. Allocated memory was 46.1 MB in the beginning and 151.0 MB in the end (delta: 104.9 MB). Free memory was 23.0 MB in the beginning and 54.4 MB in the end (delta: -31.3 MB). Peak memory consumption was 72.0 MB. Max. memory is 16.1 GB. [2020-10-26 05:56:13,764 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 46.1 MB. Free memory is still 27.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:56:13,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.04 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 22.4 MB in the beginning and 29.2 MB in the end (delta: -6.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 05:56:13,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.50 ms. Allocated memory is still 58.7 MB. Free memory was 29.2 MB in the beginning and 26.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 05:56:13,766 INFO L168 Benchmark]: Boogie Preprocessor took 93.59 ms. Allocated memory is still 58.7 MB. Free memory was 26.4 MB in the beginning and 41.0 MB in the end (delta: -14.6 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. [2020-10-26 05:56:13,767 INFO L168 Benchmark]: RCFGBuilder took 917.49 ms. Allocated memory is still 58.7 MB. Free memory was 41.0 MB in the beginning and 25.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. [2020-10-26 05:56:13,768 INFO L168 Benchmark]: BuchiAutomizer took 8602.38 ms. Allocated memory was 58.7 MB in the beginning and 151.0 MB in the end (delta: 92.3 MB). Free memory was 25.6 MB in the beginning and 54.4 MB in the end (delta: -28.8 MB). Peak memory consumption was 63.3 MB. Max. memory is 16.1 GB. [2020-10-26 05:56:13,769 INFO L168 Benchmark]: Witness Printer took 4.46 ms. Allocated memory is still 151.0 MB. Free memory is still 54.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:56:13,773 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 46.1 MB. Free memory is still 27.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 653.04 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 22.4 MB in the beginning and 29.2 MB in the end (delta: -6.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 76.50 ms. Allocated memory is still 58.7 MB. Free memory was 29.2 MB in the beginning and 26.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 93.59 ms. Allocated memory is still 58.7 MB. Free memory was 26.4 MB in the beginning and 41.0 MB in the end (delta: -14.6 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. * RCFGBuilder took 917.49 ms. Allocated memory is still 58.7 MB. Free memory was 41.0 MB in the beginning and 25.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 8602.38 ms. Allocated memory was 58.7 MB in the beginning and 151.0 MB in the end (delta: 92.3 MB). Free memory was 25.6 MB in the beginning and 54.4 MB in the end (delta: -28.8 MB). Peak memory consumption was 63.3 MB. Max. memory is 16.1 GB. * Witness Printer took 4.46 ms. Allocated memory is still 151.0 MB. Free memory is still 54.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 27 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 8.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 7.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 182 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 779 SDtfs, 253 SDslu, 1316 SDs, 0 SdLazy, 36 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital212 mio100 ax139 hnf108 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq230 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...