./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.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.8.ufo.BOUNDED-16.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 7a74e0655b0ab0c7036089605d9d5ac12c18c462 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:12:18,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:12:18,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:12:18,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:12:18,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:12:18,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:12:18,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:12:18,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:12:18,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:12:18,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:12:18,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:12:18,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:12:18,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:12:18,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:12:18,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:12:18,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:12:18,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:12:18,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:12:18,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:12:18,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:12:18,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:12:18,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:12:18,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:12:18,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:12:18,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:12:18,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:12:18,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:12:18,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:12:18,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:12:18,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:12:18,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:12:18,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:12:18,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:12:18,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:12:18,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:12:18,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:12:18,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:12:18,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:12:18,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:12:18,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:12:18,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:12:18,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:12:18,975 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:12:18,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:12:18,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:12:18,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:12:18,978 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:12:18,978 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:12:18,978 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:12:18,979 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:12:18,979 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:12:18,979 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:12:18,979 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:12:18,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:12:18,980 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:12:18,980 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:12:18,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:12:18,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:12:18,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:12:18,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:12:18,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:12:18,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:12:18,982 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:12:18,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:12:18,982 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:12:18,983 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:12:18,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:12:18,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:12:18,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:12:18,984 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:12:18,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:12:18,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:12:18,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:12:18,985 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:12:18,986 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:12:18,986 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 7a74e0655b0ab0c7036089605d9d5ac12c18c462 [2020-10-20 08:12:19,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:12:19,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:12:19,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:12:19,206 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:12:19,206 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:12:19,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.pals.c [2020-10-20 08:12:19,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b3047f6/4c058993f8df4243b156f261cd38c2b0/FLAG07966e46b [2020-10-20 08:12:19,848 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:12:19,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.pals.c [2020-10-20 08:12:19,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b3047f6/4c058993f8df4243b156f261cd38c2b0/FLAG07966e46b [2020-10-20 08:12:20,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b3047f6/4c058993f8df4243b156f261cd38c2b0 [2020-10-20 08:12:20,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:12:20,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:12:20,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:12:20,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:12:20,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:12:20,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3208ed8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20, skipping insertion in model container [2020-10-20 08:12:20,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:12:20,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:12:20,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:12:20,575 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:12:20,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:12:20,686 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:12:20,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20 WrapperNode [2020-10-20 08:12:20,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:12:20,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:12:20,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:12:20,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:12:20,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:12:20,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:12:20,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:12:20,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:12:20,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (1/1) ... [2020-10-20 08:12:20,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:12:20,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:12:20,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:12:20,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:12:20,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (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-20 08:12:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:12:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:12:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:12:20,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:12:21,713 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:12:21,713 INFO L298 CfgBuilder]: Removed 31 assume(true) statements. [2020-10-20 08:12:21,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:12:21 BoogieIcfgContainer [2020-10-20 08:12:21,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:12:21,716 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:12:21,716 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:12:21,720 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:12:21,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:12:21,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:12:20" (1/3) ... [2020-10-20 08:12:21,723 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c1df61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:12:21, skipping insertion in model container [2020-10-20 08:12:21,723 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:12:21,723 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:20" (2/3) ... [2020-10-20 08:12:21,723 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c1df61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:12:21, skipping insertion in model container [2020-10-20 08:12:21,723 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:12:21,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:12:21" (3/3) ... [2020-10-20 08:12:21,725 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals.c [2020-10-20 08:12:21,777 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:12:21,777 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:12:21,778 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:12:21,778 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:12:21,779 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:12:21,779 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:12:21,779 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:12:21,779 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:12:21,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states. [2020-10-20 08:12:21,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-10-20 08:12:21,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:12:21,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:12:21,850 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:21,851 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, 1] [2020-10-20 08:12:21,851 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:12:21,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states. [2020-10-20 08:12:21,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-10-20 08:12:21,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:12:21,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:12:21,862 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:21,862 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, 1] [2020-10-20 08:12:21,872 INFO L794 eck$LassoCheckResult]: Stem: 114#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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 13#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 64#L342true assume !(0 == ~r1~0);init_~tmp~0 := 0; 66#L342-1true init_#res := init_~tmp~0; 65#L587true main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;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; 77#L69true assume !(0 == assume_abort_if_not_~cond); 149#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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 105#L677-2true [2020-10-20 08:12:21,874 INFO L796 eck$LassoCheckResult]: Loop: 105#L677-2true assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 29#L139true assume !(0 != ~mode1~0 % 256); 19#L153true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 17#L153-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; 12#L139-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 103#L165true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 81#L168true assume !(node2_~m2~0 != ~nomsg~0); 79#L168-1true ~mode2~0 := 0; 116#L165-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 82#L190true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 88#L193true assume !(node3_~m3~0 != ~nomsg~0); 87#L193-1true ~mode3~0 := 0; 78#L190-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 92#L215true assume !(0 != ~mode4~0 % 256); 135#L228true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 134#L228-2true ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 86#L215-2true havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 58#L240true assume !(0 != ~mode5~0 % 256); 112#L253true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 108#L253-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; 74#L240-2true havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 47#L265true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 50#L268true assume !(node6_~m6~0 != ~nomsg~0); 49#L268-1true ~mode6~0 := 0; 44#L265-2true havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 52#L290true assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 21#L293true assume !(node7_~m7~0 != ~nomsg~0); 40#L293-1true ~mode7~0 := 0; 48#L290-2true havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 39#L315true assume !(0 != ~mode8~0 % 256); 71#L328true assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite14 := ~send8~0; 73#L328-2true ~p8_new~0 := (if node8_#t~ite14 % 256 <= 127 then node8_#t~ite14 % 256 else node8_#t~ite14 % 256 - 256);havoc node8_#t~ite14;~mode8~0 := 1; 20#L315-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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 70#L595true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; 72#L595-1true check_#res := check_~tmp~1; 35#L615true main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 80#L716true assume !(0 == assert_~arg % 256); 51#L711true main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 105#L677-2true [2020-10-20 08:12:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2144605008, now seen corresponding path program 1 times [2020-10-20 08:12:21,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:21,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912385326] [2020-10-20 08:12:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:22,216 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-20 08:12:22,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912385326] [2020-10-20 08:12:22,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:12:22,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:12:22,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356382024] [2020-10-20 08:12:22,226 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:12:22,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash -571392031, now seen corresponding path program 1 times [2020-10-20 08:12:22,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:22,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695701259] [2020-10-20 08:12:22,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:22,481 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-20 08:12:22,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695701259] [2020-10-20 08:12:22,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:12:22,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:12:22,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557538557] [2020-10-20 08:12:22,486 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:12:22,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:12:22,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:12:22,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:12:22,504 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 5 states. [2020-10-20 08:12:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:12:22,660 INFO L93 Difference]: Finished difference Result 149 states and 254 transitions. [2020-10-20 08:12:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:12:22,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 254 transitions. [2020-10-20 08:12:22,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-20 08:12:22,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 141 states and 186 transitions. [2020-10-20 08:12:22,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-10-20 08:12:22,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-10-20 08:12:22,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 186 transitions. [2020-10-20 08:12:22,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:12:22,681 INFO L691 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-10-20 08:12:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 186 transitions. [2020-10-20 08:12:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-20 08:12:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-20 08:12:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2020-10-20 08:12:22,738 INFO L714 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-10-20 08:12:22,738 INFO L594 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-10-20 08:12:22,738 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:12:22,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 186 transitions. [2020-10-20 08:12:22,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-20 08:12:22,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:12:22,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:12:22,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:22,745 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, 1] [2020-10-20 08:12:22,745 INFO L794 eck$LassoCheckResult]: Stem: 449#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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 337#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 338#L342 assume 0 == ~r1~0; 332#L343 assume ~id1~0 >= 0; 333#L344 assume 0 == ~st1~0; 385#L345 assume ~send1~0 == ~id1~0; 386#L346 assume 0 == ~mode1~0 % 256; 444#L347 assume ~id2~0 >= 0; 377#L348 assume 0 == ~st2~0; 378#L349 assume ~send2~0 == ~id2~0; 423#L350 assume 0 == ~mode2~0 % 256; 362#L351 assume ~id3~0 >= 0; 363#L352 assume 0 == ~st3~0; 417#L353 assume ~send3~0 == ~id3~0; 327#L354 assume 0 == ~mode3~0 % 256; 328#L355 assume ~id4~0 >= 0; 383#L356 assume 0 == ~st4~0; 384#L357 assume ~send4~0 == ~id4~0; 443#L358 assume 0 == ~mode4~0 % 256; 374#L359 assume ~id5~0 >= 0; 375#L360 assume 0 == ~st5~0; 422#L361 assume ~send5~0 == ~id5~0; 357#L362 assume 0 == ~mode5~0 % 256; 358#L363 assume ~id6~0 >= 0; 416#L364 assume 0 == ~st6~0; 325#L365 assume ~send6~0 == ~id6~0; 326#L366 assume 0 == ~mode6~0 % 256; 408#L367 assume ~id7~0 >= 0; 409#L368 assume 0 == ~st7~0; 442#L369 assume ~send7~0 == ~id7~0; 370#L370 assume 0 == ~mode7~0 % 256; 371#L371 assume ~id8~0 >= 0; 421#L372 assume 0 == ~st8~0; 355#L373 assume ~send8~0 == ~id8~0; 356#L374 assume 0 == ~mode8~0 % 256; 415#L375 assume ~id1~0 != ~id2~0; 323#L376 assume ~id1~0 != ~id3~0; 324#L377 assume ~id1~0 != ~id4~0; 406#L378 assume ~id1~0 != ~id5~0; 407#L379 assume ~id1~0 != ~id6~0; 441#L380 assume ~id1~0 != ~id7~0; 368#L381 assume ~id1~0 != ~id8~0; 369#L382 assume ~id2~0 != ~id3~0; 437#L383 assume ~id2~0 != ~id4~0; 351#L384 assume ~id2~0 != ~id5~0; 352#L385 assume ~id2~0 != ~id6~0; 414#L386 assume ~id2~0 != ~id7~0; 318#L387 assume ~id2~0 != ~id8~0; 319#L388 assume ~id3~0 != ~id4~0; 404#L389 assume ~id3~0 != ~id5~0; 405#L390 assume ~id3~0 != ~id6~0; 439#L391 assume ~id3~0 != ~id7~0; 364#L392 assume ~id3~0 != ~id8~0; 365#L393 assume ~id4~0 != ~id5~0; 435#L394 assume ~id4~0 != ~id6~0; 349#L395 assume ~id4~0 != ~id7~0; 350#L396 assume ~id4~0 != ~id8~0; 413#L397 assume ~id5~0 != ~id6~0; 316#L398 assume ~id5~0 != ~id7~0; 317#L399 assume ~id5~0 != ~id8~0; 402#L400 assume ~id6~0 != ~id7~0; 403#L401 assume ~id6~0 != ~id8~0; 438#L402 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 420#L342-1 init_#res := init_~tmp~0; 418#L587 main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;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; 419#L69 assume !(0 == assume_abort_if_not_~cond); 427#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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 400#L677-2 [2020-10-20 08:12:22,746 INFO L796 eck$LassoCheckResult]: Loop: 400#L677-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 366#L139 assume !(0 != ~mode1~0 % 256); 344#L153 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 343#L153-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; 334#L139-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 335#L165 assume !(0 != ~mode2~0 % 256); 445#L178 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite8 := ~p2_new~0; 453#L178-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; 430#L165-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 432#L190 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 433#L193 assume !(node3_~m3~0 != ~nomsg~0); 315#L193-1 ~mode3~0 := 0; 428#L190-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 429#L215 assume !(0 != ~mode4~0 % 256); 440#L228 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 452#L228-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 425#L215-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 411#L240 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 392#L243 assume !(node5_~m5~0 != ~nomsg~0); 390#L243-1 ~mode5~0 := 0; 391#L240-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 394#L265 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 395#L268 assume !(node6_~m6~0 != ~nomsg~0); 397#L268-1 ~mode6~0 := 0; 388#L265-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 389#L290 assume !(0 != ~mode7~0 % 256); 401#L303 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite13 := ~send7~0; 426#L303-2 ~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; 382#L290-2 havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 380#L315 assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 339#L318 assume !(node8_~m8~0 != ~nomsg~0); 341#L318-1 ~mode8~0 := 0; 342#L315-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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 345#L595 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; 330#L595-1 check_#res := check_~tmp~1; 372#L615 main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 373#L716 assume !(0 == assert_~arg % 256); 399#L711 main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 400#L677-2 [2020-10-20 08:12:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:22,747 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 1 times [2020-10-20 08:12:22,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:22,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230458970] [2020-10-20 08:12:22,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:22,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:22,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:22,962 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:12:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:22,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2010715039, now seen corresponding path program 1 times [2020-10-20 08:12:22,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:22,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693159734] [2020-10-20 08:12:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:23,067 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-20 08:12:23,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693159734] [2020-10-20 08:12:23,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:12:23,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:12:23,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598892107] [2020-10-20 08:12:23,069 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:12:23,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:12:23,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:12:23,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:12:23,070 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. cyclomatic complexity: 46 Second operand 5 states. [2020-10-20 08:12:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:12:23,130 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2020-10-20 08:12:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:12:23,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 188 transitions. [2020-10-20 08:12:23,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-20 08:12:23,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 141 states and 183 transitions. [2020-10-20 08:12:23,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-10-20 08:12:23,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-10-20 08:12:23,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 183 transitions. [2020-10-20 08:12:23,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:12:23,138 INFO L691 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-10-20 08:12:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 183 transitions. [2020-10-20 08:12:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-20 08:12:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-20 08:12:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2020-10-20 08:12:23,148 INFO L714 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-10-20 08:12:23,148 INFO L594 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-10-20 08:12:23,148 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:12:23,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 183 transitions. [2020-10-20 08:12:23,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-20 08:12:23,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:12:23,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:12:23,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:23,153 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, 1, 1, 1] [2020-10-20 08:12:23,154 INFO L794 eck$LassoCheckResult]: Stem: 746#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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 633#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 634#L342 assume 0 == ~r1~0; 628#L343 assume ~id1~0 >= 0; 629#L344 assume 0 == ~st1~0; 682#L345 assume ~send1~0 == ~id1~0; 683#L346 assume 0 == ~mode1~0 % 256; 741#L347 assume ~id2~0 >= 0; 674#L348 assume 0 == ~st2~0; 675#L349 assume ~send2~0 == ~id2~0; 720#L350 assume 0 == ~mode2~0 % 256; 658#L351 assume ~id3~0 >= 0; 659#L352 assume 0 == ~st3~0; 714#L353 assume ~send3~0 == ~id3~0; 624#L354 assume 0 == ~mode3~0 % 256; 625#L355 assume ~id4~0 >= 0; 680#L356 assume 0 == ~st4~0; 681#L357 assume ~send4~0 == ~id4~0; 740#L358 assume 0 == ~mode4~0 % 256; 670#L359 assume ~id5~0 >= 0; 671#L360 assume 0 == ~st5~0; 719#L361 assume ~send5~0 == ~id5~0; 656#L362 assume 0 == ~mode5~0 % 256; 657#L363 assume ~id6~0 >= 0; 713#L364 assume 0 == ~st6~0; 622#L365 assume ~send6~0 == ~id6~0; 623#L366 assume 0 == ~mode6~0 % 256; 705#L367 assume ~id7~0 >= 0; 706#L368 assume 0 == ~st7~0; 739#L369 assume ~send7~0 == ~id7~0; 666#L370 assume 0 == ~mode7~0 % 256; 667#L371 assume ~id8~0 >= 0; 718#L372 assume 0 == ~st8~0; 651#L373 assume ~send8~0 == ~id8~0; 652#L374 assume 0 == ~mode8~0 % 256; 712#L375 assume ~id1~0 != ~id2~0; 620#L376 assume ~id1~0 != ~id3~0; 621#L377 assume ~id1~0 != ~id4~0; 703#L378 assume ~id1~0 != ~id5~0; 704#L379 assume ~id1~0 != ~id6~0; 738#L380 assume ~id1~0 != ~id7~0; 664#L381 assume ~id1~0 != ~id8~0; 665#L382 assume ~id2~0 != ~id3~0; 734#L383 assume ~id2~0 != ~id4~0; 649#L384 assume ~id2~0 != ~id5~0; 650#L385 assume ~id2~0 != ~id6~0; 711#L386 assume ~id2~0 != ~id7~0; 615#L387 assume ~id2~0 != ~id8~0; 616#L388 assume ~id3~0 != ~id4~0; 701#L389 assume ~id3~0 != ~id5~0; 702#L390 assume ~id3~0 != ~id6~0; 736#L391 assume ~id3~0 != ~id7~0; 660#L392 assume ~id3~0 != ~id8~0; 661#L393 assume ~id4~0 != ~id5~0; 732#L394 assume ~id4~0 != ~id6~0; 645#L395 assume ~id4~0 != ~id7~0; 646#L396 assume ~id4~0 != ~id8~0; 710#L397 assume ~id5~0 != ~id6~0; 611#L398 assume ~id5~0 != ~id7~0; 612#L399 assume ~id5~0 != ~id8~0; 699#L400 assume ~id6~0 != ~id7~0; 700#L401 assume ~id6~0 != ~id8~0; 735#L402 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 717#L342-1 init_#res := init_~tmp~0; 715#L587 main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;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; 716#L69 assume !(0 == assume_abort_if_not_~cond); 724#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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 697#L677-2 [2020-10-20 08:12:23,154 INFO L796 eck$LassoCheckResult]: Loop: 697#L677-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 662#L139 assume !(0 != ~mode1~0 % 256); 640#L153 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 639#L153-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; 630#L139-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 631#L165 assume !(0 != ~mode2~0 % 256); 742#L178 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite8 := ~p2_new~0; 750#L178-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; 727#L165-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 729#L190 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 730#L193 assume !(node3_~m3~0 != ~nomsg~0); 614#L193-1 ~mode3~0 := 0; 725#L190-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 726#L215 assume !(0 != ~mode4~0 % 256); 737#L228 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 749#L228-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 722#L215-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 708#L240 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 689#L243 assume !(node5_~m5~0 != ~nomsg~0); 687#L243-1 ~mode5~0 := 0; 688#L240-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 691#L265 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 692#L268 assume !(node6_~m6~0 != ~nomsg~0); 694#L268-1 ~mode6~0 := 0; 685#L265-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 686#L290 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 642#L293 assume !(node7_~m7~0 != ~nomsg~0); 643#L293-1 ~mode7~0 := 0; 679#L290-2 havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 677#L315 assume !(0 != ~mode8~0 % 256); 678#L328 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite14 := ~send8~0; 721#L328-2 ~p8_new~0 := (if node8_#t~ite14 % 256 <= 127 then node8_#t~ite14 % 256 else node8_#t~ite14 % 256 - 256);havoc node8_#t~ite14;~mode8~0 := 1; 638#L315-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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 641#L595 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 632#L596 assume ~r1~0 >= 8; 627#L600 assume ~r1~0 < 8;check_~tmp~1 := 1; 673#L595-1 check_#res := check_~tmp~1; 668#L615 main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 669#L716 assume !(0 == assert_~arg % 256); 696#L711 main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 697#L677-2 [2020-10-20 08:12:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 2 times [2020-10-20 08:12:23,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:23,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214810486] [2020-10-20 08:12:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:23,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:23,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:23,279 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:12:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2097801169, now seen corresponding path program 1 times [2020-10-20 08:12:23,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:23,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296360707] [2020-10-20 08:12:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:23,345 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-20 08:12:23,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296360707] [2020-10-20 08:12:23,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:12:23,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:12:23,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024357945] [2020-10-20 08:12:23,346 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:12:23,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:12:23,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:12:23,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:12:23,348 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. cyclomatic complexity: 43 Second operand 3 states. [2020-10-20 08:12:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:12:23,388 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2020-10-20 08:12:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:12:23,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 288 transitions. [2020-10-20 08:12:23,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2020-10-20 08:12:23,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 288 transitions. [2020-10-20 08:12:23,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2020-10-20 08:12:23,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2020-10-20 08:12:23,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 288 transitions. [2020-10-20 08:12:23,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:12:23,404 INFO L691 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-10-20 08:12:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 288 transitions. [2020-10-20 08:12:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-20 08:12:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-20 08:12:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2020-10-20 08:12:23,422 INFO L714 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-10-20 08:12:23,422 INFO L594 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-10-20 08:12:23,422 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:12:23,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 288 transitions. [2020-10-20 08:12:23,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2020-10-20 08:12:23,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:12:23,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:12:23,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:23,430 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, 1, 1, 1, 1] [2020-10-20 08:12:23,431 INFO L794 eck$LassoCheckResult]: Stem: 1103#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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 988#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 989#L342 assume 0 == ~r1~0; 982#L343 assume ~id1~0 >= 0; 983#L344 assume 0 == ~st1~0; 1039#L345 assume ~send1~0 == ~id1~0; 1040#L346 assume 0 == ~mode1~0 % 256; 1098#L347 assume ~id2~0 >= 0; 1029#L348 assume 0 == ~st2~0; 1030#L349 assume ~send2~0 == ~id2~0; 1077#L350 assume 0 == ~mode2~0 % 256; 1015#L351 assume ~id3~0 >= 0; 1016#L352 assume 0 == ~st3~0; 1071#L353 assume ~send3~0 == ~id3~0; 980#L354 assume 0 == ~mode3~0 % 256; 981#L355 assume ~id4~0 >= 0; 1037#L356 assume 0 == ~st4~0; 1038#L357 assume ~send4~0 == ~id4~0; 1097#L358 assume 0 == ~mode4~0 % 256; 1025#L359 assume ~id5~0 >= 0; 1026#L360 assume 0 == ~st5~0; 1076#L361 assume ~send5~0 == ~id5~0; 1010#L362 assume 0 == ~mode5~0 % 256; 1011#L363 assume ~id6~0 >= 0; 1070#L364 assume 0 == ~st6~0; 978#L365 assume ~send6~0 == ~id6~0; 979#L366 assume 0 == ~mode6~0 % 256; 1062#L367 assume ~id7~0 >= 0; 1063#L368 assume 0 == ~st7~0; 1096#L369 assume ~send7~0 == ~id7~0; 1023#L370 assume 0 == ~mode7~0 % 256; 1024#L371 assume ~id8~0 >= 0; 1075#L372 assume 0 == ~st8~0; 1008#L373 assume ~send8~0 == ~id8~0; 1009#L374 assume 0 == ~mode8~0 % 256; 1069#L375 assume ~id1~0 != ~id2~0; 973#L376 assume ~id1~0 != ~id3~0; 974#L377 assume ~id1~0 != ~id4~0; 1060#L378 assume ~id1~0 != ~id5~0; 1061#L379 assume ~id1~0 != ~id6~0; 1094#L380 assume ~id1~0 != ~id7~0; 1021#L381 assume ~id1~0 != ~id8~0; 1022#L382 assume ~id2~0 != ~id3~0; 1090#L383 assume ~id2~0 != ~id4~0; 1004#L384 assume ~id2~0 != ~id5~0; 1005#L385 assume ~id2~0 != ~id6~0; 1068#L386 assume ~id2~0 != ~id7~0; 971#L387 assume ~id2~0 != ~id8~0; 972#L388 assume ~id3~0 != ~id4~0; 1058#L389 assume ~id3~0 != ~id5~0; 1059#L390 assume ~id3~0 != ~id6~0; 1093#L391 assume ~id3~0 != ~id7~0; 1017#L392 assume ~id3~0 != ~id8~0; 1018#L393 assume ~id4~0 != ~id5~0; 1089#L394 assume ~id4~0 != ~id6~0; 1002#L395 assume ~id4~0 != ~id7~0; 1003#L396 assume ~id4~0 != ~id8~0; 1067#L397 assume ~id5~0 != ~id6~0; 967#L398 assume ~id5~0 != ~id7~0; 968#L399 assume ~id5~0 != ~id8~0; 1056#L400 assume ~id6~0 != ~id7~0; 1057#L401 assume ~id6~0 != ~id8~0; 1092#L402 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 1074#L342-1 init_#res := init_~tmp~0; 1072#L587 main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;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; 1073#L69 assume !(0 == assume_abort_if_not_~cond); 1081#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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 1110#L677-2 [2020-10-20 08:12:23,431 INFO L796 eck$LassoCheckResult]: Loop: 1110#L677-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1171#L139 assume !(0 != ~mode1~0 % 256); 1170#L153 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 1169#L153-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; 1104#L139-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1168#L165 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1165#L168 assume !(node2_~m2~0 != ~nomsg~0); 1163#L168-1 ~mode2~0 := 0; 1161#L165-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1160#L190 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1157#L193 assume !(node3_~m3~0 != ~nomsg~0); 1155#L193-1 ~mode3~0 := 0; 1153#L190-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1152#L215 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1149#L218 assume !(node4_~m4~0 != ~nomsg~0); 1147#L218-1 ~mode4~0 := 0; 1145#L215-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1144#L240 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1142#L243 assume !(node5_~m5~0 != ~nomsg~0); 1139#L243-1 ~mode5~0 := 0; 1137#L240-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1136#L265 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1134#L268 assume !(node6_~m6~0 != ~nomsg~0); 1131#L268-1 ~mode6~0 := 0; 1129#L265-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 1128#L290 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1126#L293 assume !(node7_~m7~0 != ~nomsg~0); 1123#L293-1 ~mode7~0 := 0; 1121#L290-2 havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 1120#L315 assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 1118#L318 assume !(node8_~m8~0 != ~nomsg~0); 1115#L318-1 ~mode8~0 := 0; 1113#L315-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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1112#L595 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 1111#L596 assume !(~r1~0 >= 8); 984#L599 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 985#L600 assume ~r1~0 < 8;check_~tmp~1 := 1; 1175#L595-1 check_#res := check_~tmp~1; 1174#L615 main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1173#L716 assume !(0 == assert_~arg % 256); 1172#L711 main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 1110#L677-2 [2020-10-20 08:12:23,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:23,432 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 3 times [2020-10-20 08:12:23,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:23,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785750116] [2020-10-20 08:12:23,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:23,486 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:23,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:23,551 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:12:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:23,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1336028871, now seen corresponding path program 1 times [2020-10-20 08:12:23,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:23,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189000518] [2020-10-20 08:12:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:23,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:23,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:23,604 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:12:23,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:23,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2138425722, now seen corresponding path program 1 times [2020-10-20 08:12:23,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:23,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812254424] [2020-10-20 08:12:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:23,727 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-20 08:12:23,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812254424] [2020-10-20 08:12:23,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:12:23,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:12:23,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781601307] [2020-10-20 08:12:24,854 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 201 DAG size of output: 196 [2020-10-20 08:12:25,465 WARN L193 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 166 [2020-10-20 08:12:25,485 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:12:25,486 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:12:25,486 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:12:25,486 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:12:25,486 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:12:25,487 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:25,487 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:12:25,487 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:12:25,487 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.ufo.BOUNDED-16.pals.c_Iteration4_Loop [2020-10-20 08:12:25,493 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:12:25,494 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:12:25,541 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-20 08:12:25,561 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-20 08:12:25,564 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-20 08:12:25,566 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-20 08:12:25,571 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-20 08:12:25,577 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-20 08:12:25,579 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-20 08:12:25,581 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-20 08:12:25,582 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-20 08:12:25,589 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-20 08:12:25,593 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-20 08:12:25,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:25,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:25,604 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-20 08:12:25,607 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-20 08:12:25,621 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-20 08:12:25,633 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-20 08:12:25,636 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-20 08:12:25,638 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-20 08:12:25,641 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-20 08:12:25,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-20 08:12:25,654 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-20 08:12:25,657 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-20 08:12:25,662 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-20 08:12:25,670 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-20 08:12:25,676 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-20 08:12:25,904 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-20 08:12:25,906 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-20 08:12:25,908 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-20 08:12:25,912 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-20 08:12:25,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-20 08:12:25,917 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-20 08:12:25,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-20 08:12:25,924 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-20 08:12:25,928 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-20 08:12:25,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-20 08:12:25,942 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-20 08:12:25,946 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-20 08:12:25,948 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-20 08:12:25,950 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-20 08:12:25,960 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-20 08:12:26,571 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-20 08:12:29,723 WARN L193 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 135 DAG size of output: 131 [2020-10-20 08:12:29,846 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:12:29,847 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) [2020-10-20 08:12:29,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:12:29,861 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:29,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:12:29,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:12:30,082 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:12:30,084 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:12:30,084 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:12:30,084 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:12:30,084 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:12:30,085 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:12:30,085 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:30,085 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:12:30,085 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:12:30,085 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.ufo.BOUNDED-16.pals.c_Iteration4_Loop [2020-10-20 08:12:30,085 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:12:30,085 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:12:30,102 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-20 08:12:30,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:30,149 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-20 08:12:30,153 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-20 08:12:30,155 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-20 08:12:30,158 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-20 08:12:30,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-20 08:12:30,166 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-20 08:12:30,169 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-20 08:12:30,172 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-20 08:12:30,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-20 08:12:30,181 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-20 08:12:30,185 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-20 08:12:30,187 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-20 08:12:30,189 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-20 08:12:30,195 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-20 08:12:30,198 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-20 08:12:30,201 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-20 08:12:30,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:30,205 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-20 08:12:30,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:30,216 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-20 08:12:30,218 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-20 08:12:30,224 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-20 08:12:30,234 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-20 08:12:30,239 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-20 08:12:30,242 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-20 08:12:30,245 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-20 08:12:30,252 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-20 08:12:30,255 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-20 08:12:30,257 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-20 08:12:30,260 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-20 08:12:30,268 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-20 08:12:30,271 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-20 08:12:30,276 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-20 08:12:30,282 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-20 08:12:30,285 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-20 08:12:30,522 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-20 08:12:30,523 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-20 08:12:30,525 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-20 08:12:30,528 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-20 08:12:31,210 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-20 08:12:34,238 WARN L193 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 135 DAG size of output: 131 [2020-10-20 08:12:34,269 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:12:34,275 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:12:34,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:34,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,294 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 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-20 08:12:34,327 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-20 08:12:34,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,336 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-20 08:12:34,363 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-20 08:12:34,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:12:34,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:12:34,377 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-20 08:12:34,419 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-20 08:12:34,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,423 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:34,447 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-20 08:12:34,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,452 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:34,475 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-20 08:12:34,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,490 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:34,517 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-20 08:12:34,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,522 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-20 08:12:34,546 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-20 08:12:34,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,550 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-20 08:12:34,575 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-20 08:12:34,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:12:34,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:12:34,583 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-20 08:12:34,608 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-20 08:12:34,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,613 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-20 08:12:34,635 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-20 08:12:34,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:12:34,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:12:34,642 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-20 08:12:34,665 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-20 08:12:34,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:12:34,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:12:34,674 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-20 08:12:34,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:12:34,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,713 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-20 08:12:34,721 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-20 08:12:34,756 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-20 08:12:34,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,761 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-20 08:12:34,784 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-20 08:12:34,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,791 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-20 08:12:34,826 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-20 08:12:34,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:12:34,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:12:34,834 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-20 08:12:34,861 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-20 08:12:34,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:12:34,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:12:34,870 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-20 08:12:34,905 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-20 08:12:34,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,915 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-20 08:12:34,942 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-20 08:12:34,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:34,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:34,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:34,946 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-20 08:12:34,970 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-20 08:12:34,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:34,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:34,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:34,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:34,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:12:34,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:12:34,977 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-20 08:12:35,002 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-20 08:12:35,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:35,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:35,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:35,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:35,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:35,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:35,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:35,008 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:35,032 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-20 08:12:35,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:35,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:35,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:35,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:35,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:35,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:35,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:35,041 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 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:35,062 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-20 08:12:35,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:12:35,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:12:35,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:12:35,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:12:35,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:12:35,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:12:35,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:12:35,067 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:12:35,077 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:12:35,077 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:12:35,083 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:12:35,083 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:12:35,083 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:12:35,084 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 31 Supporting invariants [] Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:35,134 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:12:35,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:35,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:12:35,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:12:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:35,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:12:35,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:12:35,379 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-20 08:12:35,384 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-20 08:12:35,385 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 80 Second operand 3 states. [2020-10-20 08:12:35,454 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 80. Second operand 3 states. Result 350 states and 509 transitions. Complement of second has 4 states. [2020-10-20 08:12:35,454 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-20 08:12:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:12:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-10-20 08:12:35,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 67 letters. Loop has 41 letters. [2020-10-20 08:12:35,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:12:35,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 108 letters. Loop has 41 letters. [2020-10-20 08:12:35,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:12:35,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 67 letters. Loop has 82 letters. [2020-10-20 08:12:35,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:12:35,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 509 transitions. [2020-10-20 08:12:35,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:12:35,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 0 states and 0 transitions. [2020-10-20 08:12:35,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:12:35,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:12:35,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:12:35,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:12:35,467 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:12:35,467 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:12:35,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:12:35,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:12:35,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:12:35,468 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-10-20 08:12:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:12:35,468 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-20 08:12:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 08:12:35,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-20 08:12:35,468 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:12:35,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 08:12:35,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:12:35,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:12:35,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:12:35,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:12:35,469 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:12:35,469 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:12:35,469 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:12:35,469 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:12:35,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:12:35,469 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:12:35,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:12:35,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:12:35 BoogieIcfgContainer [2020-10-20 08:12:35,476 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:12:35,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:12:35,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:12:35,477 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:12:35,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:12:21" (3/4) ... [2020-10-20 08:12:35,481 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:12:35,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:12:35,483 INFO L168 Benchmark]: Toolchain (without parser) took 15342.14 ms. Allocated memory was 37.2 MB in the beginning and 129.5 MB in the end (delta: 92.3 MB). Free memory was 17.7 MB in the beginning and 84.5 MB in the end (delta: -66.7 MB). Peak memory consumption was 25.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:12:35,483 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 34.1 MB. Free memory was 10.6 MB in the beginning and 10.5 MB in the end (delta: 47.8 kB). Peak memory consumption was 47.8 kB. Max. memory is 14.3 GB. [2020-10-20 08:12:35,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.44 ms. Allocated memory was 37.2 MB in the beginning and 45.6 MB in the end (delta: 8.4 MB). Free memory was 16.9 MB in the beginning and 19.2 MB in the end (delta: -2.4 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:12:35,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.31 ms. Allocated memory was 45.6 MB in the beginning and 46.7 MB in the end (delta: 1.0 MB). Free memory was 19.2 MB in the beginning and 28.5 MB in the end (delta: -9.3 MB). Peak memory consumption was 6.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:12:35,485 INFO L168 Benchmark]: Boogie Preprocessor took 47.92 ms. Allocated memory is still 46.7 MB. Free memory was 28.5 MB in the beginning and 25.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:12:35,486 INFO L168 Benchmark]: RCFGBuilder took 896.50 ms. Allocated memory was 46.7 MB in the beginning and 50.3 MB in the end (delta: 3.7 MB). Free memory was 25.7 MB in the beginning and 22.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:12:35,487 INFO L168 Benchmark]: BuchiAutomizer took 13760.02 ms. Allocated memory was 50.3 MB in the beginning and 129.5 MB in the end (delta: 79.2 MB). Free memory was 22.1 MB in the beginning and 84.5 MB in the end (delta: -62.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:12:35,487 INFO L168 Benchmark]: Witness Printer took 4.37 ms. Allocated memory is still 129.5 MB. Free memory is still 84.5 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 08:12:35,492 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 34.1 MB. Free memory was 10.6 MB in the beginning and 10.5 MB in the end (delta: 47.8 kB). Peak memory consumption was 47.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 540.44 ms. Allocated memory was 37.2 MB in the beginning and 45.6 MB in the end (delta: 8.4 MB). Free memory was 16.9 MB in the beginning and 19.2 MB in the end (delta: -2.4 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 82.31 ms. Allocated memory was 45.6 MB in the beginning and 46.7 MB in the end (delta: 1.0 MB). Free memory was 19.2 MB in the beginning and 28.5 MB in the end (delta: -9.3 MB). Peak memory consumption was 6.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 47.92 ms. Allocated memory is still 46.7 MB. Free memory was 28.5 MB in the beginning and 25.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 896.50 ms. Allocated memory was 46.7 MB in the beginning and 50.3 MB in the end (delta: 3.7 MB). Free memory was 25.7 MB in the beginning and 22.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 13760.02 ms. Allocated memory was 50.3 MB in the beginning and 129.5 MB in the end (delta: 79.2 MB). Free memory was 22.1 MB in the beginning and 84.5 MB in the end (delta: -62.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 14.3 GB. * Witness Printer took 4.37 ms. Allocated memory is still 129.5 MB. Free memory is still 84.5 MB. There was no memory consumed. Max. memory is 14.3 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 + 31 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 13.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 12.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 209 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 895 SDtfs, 290 SDslu, 1519 SDs, 0 SdLazy, 36 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital234 mio100 ax141 hnf109 lsp40 ukn83 mio100 lsp100 div125 bol100 ite100 ukn100 eq200 hnf78 smp100 dnf734 smp49 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...