./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99419aa1056efe69cea82e3472ae56b95e15b260 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 05:49:43,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:49:43,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:49:43,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:49:43,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:49:43,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:49:43,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:49:43,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:49:43,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:49:43,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:49:43,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:49:43,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:49:43,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:49:43,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:49:43,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:49:43,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:49:43,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:49:43,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:49:43,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:49:43,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:49:43,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:49:43,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:49:43,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:49:43,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:49:43,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:49:43,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:49:43,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:49:43,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:49:43,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:49:43,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:49:43,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:49:43,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:49:43,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:49:43,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:49:43,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:49:43,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:49:43,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:49:43,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:49:43,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:49:43,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:49:43,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:49:43,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 05:49:43,539 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:49:43,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:49:43,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:49:43,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:49:43,543 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:49:43,543 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:49:43,543 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:49:43,544 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:49:43,544 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:49:43,544 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:49:43,545 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:49:43,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:49:43,546 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:49:43,547 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:49:43,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:49:43,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:49:43,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:49:43,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:49:43,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:49:43,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:49:43,548 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:49:43,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:49:43,549 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:49:43,549 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:49:43,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:49:43,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:49:43,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:49:43,551 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:49:43,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:49:43,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:49:43,551 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:49:43,552 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:49:43,553 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:49:43,554 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99419aa1056efe69cea82e3472ae56b95e15b260 [2020-10-26 05:49:43,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:49:43,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:49:44,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:49:44,006 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:49:44,009 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:49:44,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2020-10-26 05:49:44,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62feea04/d8ac293aa8d74931b7336a3466e813c7/FLAG3cb676550 [2020-10-26 05:49:44,797 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:49:44,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2020-10-26 05:49:44,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62feea04/d8ac293aa8d74931b7336a3466e813c7/FLAG3cb676550 [2020-10-26 05:49:45,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62feea04/d8ac293aa8d74931b7336a3466e813c7 [2020-10-26 05:49:45,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:49:45,083 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:49:45,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:49:45,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:49:45,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:49:45,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e54758b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45, skipping insertion in model container [2020-10-26 05:49:45,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:49:45,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:49:45,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:49:45,479 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:49:45,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:49:45,575 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:49:45,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45 WrapperNode [2020-10-26 05:49:45,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:49:45,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:49:45,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:49:45,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:49:45,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:49:45,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:49:45,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:49:45,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:49:45,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (1/1) ... [2020-10-26 05:49:45,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:49:45,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:49:45,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:49:45,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:49:45,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:49:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:49:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:49:45,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:49:46,702 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:49:46,703 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-26 05:49:46,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:49:46 BoogieIcfgContainer [2020-10-26 05:49:46,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:49:46,707 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:49:46,707 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:49:46,711 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:49:46,712 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:49:46,712 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:49:45" (1/3) ... [2020-10-26 05:49:46,714 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d13de5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:49:46, skipping insertion in model container [2020-10-26 05:49:46,714 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:49:46,714 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:49:45" (2/3) ... [2020-10-26 05:49:46,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d13de5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:49:46, skipping insertion in model container [2020-10-26 05:49:46,715 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:49:46,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:49:46" (3/3) ... [2020-10-26 05:49:46,717 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2020-10-26 05:49:46,767 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:49:46,767 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:49:46,768 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:49:46,768 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:49:46,768 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:49:46,768 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:49:46,768 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:49:46,768 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:49:46,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2020-10-26 05:49:46,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2020-10-26 05:49:46,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:49:46,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:49:46,830 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] [2020-10-26 05:49:46,830 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:49:46,831 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:49:46,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2020-10-26 05:49:46,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2020-10-26 05:49:46,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:49:46,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:49:46,848 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] [2020-10-26 05:49:46,848 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:49:46,858 INFO L794 eck$LassoCheckResult]: Stem: 88#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(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 10#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~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~ret40, main_#t~ret41, main_#t~post42, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep13~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep31~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep32~0 := main_#t~nondet18;havoc main_#t~nondet18;~id1~0 := main_#t~nondet19;havoc main_#t~nondet19;~r1~0 := main_#t~nondet20;havoc main_#t~nondet20;~st1~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl1~0 := main_#t~nondet22;havoc main_#t~nondet22;~m1~0 := main_#t~nondet23;havoc main_#t~nondet23;~max1~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode1~0 := main_#t~nondet25;havoc main_#t~nondet25;~id2~0 := main_#t~nondet26;havoc main_#t~nondet26;~r2~0 := main_#t~nondet27;havoc main_#t~nondet27;~st2~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl2~0 := main_#t~nondet29;havoc main_#t~nondet29;~m2~0 := main_#t~nondet30;havoc main_#t~nondet30;~max2~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode2~0 := main_#t~nondet32;havoc main_#t~nondet32;~id3~0 := main_#t~nondet33;havoc main_#t~nondet33;~r3~0 := main_#t~nondet34;havoc main_#t~nondet34;~st3~0 := main_#t~nondet35;havoc main_#t~nondet35;~nl3~0 := main_#t~nondet36;havoc main_#t~nondet36;~m3~0 := main_#t~nondet37;havoc main_#t~nondet37;~max3~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode3~0 := main_#t~nondet39;havoc main_#t~nondet39;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 40#L276true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 46#L279-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 89#L289true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 76#L292-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 126#L302true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 106#L305-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 30#L315true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 12#L318-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 57#L328true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 54#L331-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 97#L341true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 85#L344-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 5#L354true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 7#L354-1true init_#res := init_~tmp___5~0; 18#L439true main_#t~ret40 := init_#res;main_~i2~0 := main_#t~ret40;havoc main_#t~ret40; 9#L533true assume !(0 == main_~i2~0); 121#L533-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 113#L547-2true [2020-10-26 05:49:46,859 INFO L796 eck$LassoCheckResult]: Loop: 113#L547-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8; 34#L122true assume !(0 != ~mode1~0 % 256); 21#L147true assume !(~r1~0 < 2); 19#L147-1true ~mode1~0 := 1; 49#L122-2true havoc node2_#t~ite9, node2_#t~ite10; 81#L165true assume !(0 != ~mode2~0 % 256); 68#L190true assume !(~r2~0 < 2); 66#L190-1true ~mode2~0 := 1; 92#L165-2true havoc node3_#t~ite11, node3_#t~ite12; 3#L208true assume !(0 != ~mode3~0 % 256); 118#L233true assume !(~r3~0 < 2); 114#L233-1true ~mode3~0 := 1; 15#L208-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 41#L447true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 25#L447-1true check_#res := check_~tmp~1; 109#L495true main_#t~ret41 := check_#res;main_~c1~0 := main_#t~ret41;havoc main_#t~ret41;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 8#L577true assume !(0 == assert_~arg % 256); 104#L572true main_#t~post42 := main_~i2~0;main_~i2~0 := 1 + main_#t~post42;havoc main_#t~post42; 113#L547-2true [2020-10-26 05:49:46,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:49:46,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 1 times [2020-10-26 05:49:46,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:49:46,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031811185] [2020-10-26 05:49:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:49:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:49:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:49:47,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031811185] [2020-10-26 05:49:47,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:49:47,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:49:47,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409629133] [2020-10-26 05:49:47,215 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:49:47,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:49:47,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2071749231, now seen corresponding path program 1 times [2020-10-26 05:49:47,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:49:47,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523809262] [2020-10-26 05:49:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:49:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:49:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:49:47,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523809262] [2020-10-26 05:49:47,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:49:47,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:49:47,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449740096] [2020-10-26 05:49:47,331 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:49:47,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:49:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:49:47,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:49:47,356 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 5 states. [2020-10-26 05:49:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:49:47,529 INFO L93 Difference]: Finished difference Result 128 states and 214 transitions. [2020-10-26 05:49:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 05:49:47,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 214 transitions. [2020-10-26 05:49:47,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-10-26 05:49:47,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 119 states and 198 transitions. [2020-10-26 05:49:47,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-10-26 05:49:47,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-10-26 05:49:47,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 198 transitions. [2020-10-26 05:49:47,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:49:47,549 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 198 transitions. [2020-10-26 05:49:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 198 transitions. [2020-10-26 05:49:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-26 05:49:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-26 05:49:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 198 transitions. [2020-10-26 05:49:47,586 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 198 transitions. [2020-10-26 05:49:47,586 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 198 transitions. [2020-10-26 05:49:47,586 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:49:47,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 198 transitions. [2020-10-26 05:49:47,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-10-26 05:49:47,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:49:47,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:49:47,591 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] [2020-10-26 05:49:47,591 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] [2020-10-26 05:49:47,591 INFO L794 eck$LassoCheckResult]: Stem: 381#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(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 286#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~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~ret40, main_#t~ret41, main_#t~post42, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep13~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep31~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep32~0 := main_#t~nondet18;havoc main_#t~nondet18;~id1~0 := main_#t~nondet19;havoc main_#t~nondet19;~r1~0 := main_#t~nondet20;havoc main_#t~nondet20;~st1~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl1~0 := main_#t~nondet22;havoc main_#t~nondet22;~m1~0 := main_#t~nondet23;havoc main_#t~nondet23;~max1~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode1~0 := main_#t~nondet25;havoc main_#t~nondet25;~id2~0 := main_#t~nondet26;havoc main_#t~nondet26;~r2~0 := main_#t~nondet27;havoc main_#t~nondet27;~st2~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl2~0 := main_#t~nondet29;havoc main_#t~nondet29;~m2~0 := main_#t~nondet30;havoc main_#t~nondet30;~max2~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode2~0 := main_#t~nondet32;havoc main_#t~nondet32;~id3~0 := main_#t~nondet33;havoc main_#t~nondet33;~r3~0 := main_#t~nondet34;havoc main_#t~nondet34;~st3~0 := main_#t~nondet35;havoc main_#t~nondet35;~nl3~0 := main_#t~nondet36;havoc main_#t~nondet36;~m3~0 := main_#t~nondet37;havoc main_#t~nondet37;~max3~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode3~0 := main_#t~nondet39;havoc main_#t~nondet39;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 287#L276 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 339#L279-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 346#L289 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 300#L292-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 376#L302 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 363#L305-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 324#L315 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 290#L318-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 291#L328 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 280#L331-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 358#L341 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 329#L344-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 277#L354 assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 276#L354-1 init_#res := init_~tmp___5~0; 283#L439 main_#t~ret40 := init_#res;main_~i2~0 := main_#t~ret40;havoc main_#t~ret40; 284#L533 assume !(0 == main_~i2~0); 285#L533-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 385#L547-2 [2020-10-26 05:49:47,591 INFO L796 eck$LassoCheckResult]: Loop: 385#L547-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8; 330#L122 assume !(0 != ~mode1~0 % 256); 308#L147 assume !(~r1~0 < 2); 303#L147-1 ~mode1~0 := 1; 304#L122-2 havoc node2_#t~ite9, node2_#t~ite10; 351#L165 assume !(0 != ~mode2~0 % 256); 372#L190 assume !(~r2~0 < 2); 306#L190-1 ~mode2~0 := 1; 371#L165-2 havoc node3_#t~ite11, node3_#t~ite12; 271#L208 assume !(0 != ~mode3~0 % 256); 272#L233 assume !(~r3~0 < 2); 323#L233-1 ~mode3~0 := 1; 297#L208-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 298#L447 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 341#L448 assume ~st1~0 + ~nl1~0 <= 1; 370#L449 assume ~st2~0 + ~nl2~0 <= 1; 301#L450 assume ~st3~0 + ~nl3~0 <= 1; 302#L451 assume ~r1~0 >= 2; 347#L455 assume ~r1~0 < 2; 348#L460 assume ~r1~0 >= 2; 293#L465 assume ~r1~0 < 2;check_~tmp~1 := 1; 316#L447-1 check_#res := check_~tmp~1; 317#L495 main_#t~ret41 := check_#res;main_~c1~0 := main_#t~ret41;havoc main_#t~ret41;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 281#L577 assume !(0 == assert_~arg % 256); 282#L572 main_#t~post42 := main_~i2~0;main_~i2~0 := 1 + main_#t~post42;havoc main_#t~post42; 385#L547-2 [2020-10-26 05:49:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:49:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 2 times [2020-10-26 05:49:47,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:49:47,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649453952] [2020-10-26 05:49:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:49:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:49:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:49:47,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649453952] [2020-10-26 05:49:47,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:49:47,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:49:47,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116877540] [2020-10-26 05:49:47,748 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:49:47,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:49:47,750 INFO L82 PathProgramCache]: Analyzing trace with hash -980587232, now seen corresponding path program 1 times [2020-10-26 05:49:47,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:49:47,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669190050] [2020-10-26 05:49:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:49:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:49:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:49:47,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669190050] [2020-10-26 05:49:47,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:49:47,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:49:47,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916412330] [2020-10-26 05:49:47,809 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:49:47,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:49:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:49:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:49:47,811 INFO L87 Difference]: Start difference. First operand 119 states and 198 transitions. cyclomatic complexity: 80 Second operand 5 states. [2020-10-26 05:49:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:49:47,909 INFO L93 Difference]: Finished difference Result 190 states and 308 transitions. [2020-10-26 05:49:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 05:49:47,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 308 transitions. [2020-10-26 05:49:47,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-10-26 05:49:47,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 187 states and 285 transitions. [2020-10-26 05:49:47,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2020-10-26 05:49:47,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2020-10-26 05:49:47,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 285 transitions. [2020-10-26 05:49:47,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:49:47,919 INFO L691 BuchiCegarLoop]: Abstraction has 187 states and 285 transitions. [2020-10-26 05:49:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 285 transitions. [2020-10-26 05:49:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 119. [2020-10-26 05:49:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-26 05:49:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2020-10-26 05:49:47,931 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 177 transitions. [2020-10-26 05:49:47,931 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 177 transitions. [2020-10-26 05:49:47,931 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:49:47,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 177 transitions. [2020-10-26 05:49:47,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-10-26 05:49:47,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:49:47,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:49:47,935 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] [2020-10-26 05:49:47,935 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] [2020-10-26 05:49:47,935 INFO L794 eck$LassoCheckResult]: Stem: 703#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(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 608#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~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~ret40, main_#t~ret41, main_#t~post42, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep13~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep31~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep32~0 := main_#t~nondet18;havoc main_#t~nondet18;~id1~0 := main_#t~nondet19;havoc main_#t~nondet19;~r1~0 := main_#t~nondet20;havoc main_#t~nondet20;~st1~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl1~0 := main_#t~nondet22;havoc main_#t~nondet22;~m1~0 := main_#t~nondet23;havoc main_#t~nondet23;~max1~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode1~0 := main_#t~nondet25;havoc main_#t~nondet25;~id2~0 := main_#t~nondet26;havoc main_#t~nondet26;~r2~0 := main_#t~nondet27;havoc main_#t~nondet27;~st2~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl2~0 := main_#t~nondet29;havoc main_#t~nondet29;~m2~0 := main_#t~nondet30;havoc main_#t~nondet30;~max2~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode2~0 := main_#t~nondet32;havoc main_#t~nondet32;~id3~0 := main_#t~nondet33;havoc main_#t~nondet33;~r3~0 := main_#t~nondet34;havoc main_#t~nondet34;~st3~0 := main_#t~nondet35;havoc main_#t~nondet35;~nl3~0 := main_#t~nondet36;havoc main_#t~nondet36;~m3~0 := main_#t~nondet37;havoc main_#t~nondet37;~max3~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode3~0 := main_#t~nondet39;havoc main_#t~nondet39;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 609#L276 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 662#L279-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 668#L289 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 622#L292-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 698#L302 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 685#L305-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 646#L315 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 612#L318-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 613#L328 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 601#L331-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 680#L341 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 653#L344-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 598#L354 assume ~id1~0 != ~id2~0; 599#L355 assume ~id1~0 != ~id3~0; 648#L356 assume ~id2~0 != ~id3~0; 649#L357 assume ~id1~0 >= 0; 697#L358 assume ~id2~0 >= 0; 644#L359 assume ~id3~0 >= 0; 645#L360 assume 0 == ~r1~0; 682#L361 assume 0 == ~r2~0; 636#L362 assume 0 == ~r3~0; 637#L363 assume ~max1~0 == ~id1~0; 676#L364 assume ~max2~0 == ~id2~0; 596#L365 assume ~max3~0 == ~id3~0; 597#L366 assume 0 == ~st1~0; 674#L367 assume 0 == ~st2~0; 675#L368 assume 0 == ~st3~0; 696#L369 assume 0 == ~nl1~0; 640#L370 assume 0 == ~nl2~0; 641#L371 assume 0 == ~nl3~0; 681#L372 assume 0 == ~mode1~0 % 256; 632#L373 assume 0 == ~mode2~0 % 256; 633#L374 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 604#L354-1 init_#res := init_~tmp___5~0; 605#L439 main_#t~ret40 := init_#res;main_~i2~0 := main_#t~ret40;havoc main_#t~ret40; 606#L533 assume !(0 == main_~i2~0); 607#L533-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 707#L547-2 [2020-10-26 05:49:47,936 INFO L796 eck$LassoCheckResult]: Loop: 707#L547-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8; 650#L122 assume !(0 != ~mode1~0 % 256); 630#L147 assume !(~r1~0 < 2); 625#L147-1 ~mode1~0 := 1; 626#L122-2 havoc node2_#t~ite9, node2_#t~ite10; 673#L165 assume !(0 != ~mode2~0 % 256); 694#L190 assume !(~r2~0 < 2); 628#L190-1 ~mode2~0 := 1; 693#L165-2 havoc node3_#t~ite11, node3_#t~ite12; 593#L208 assume !(0 != ~mode3~0 % 256); 594#L233 assume !(~r3~0 < 2); 643#L233-1 ~mode3~0 := 1; 619#L208-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 620#L447 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 661#L448 assume ~st1~0 + ~nl1~0 <= 1; 692#L449 assume ~st2~0 + ~nl2~0 <= 1; 623#L450 assume ~st3~0 + ~nl3~0 <= 1; 624#L451 assume ~r1~0 >= 2; 669#L455 assume ~r1~0 < 2; 670#L460 assume ~r1~0 >= 2; 615#L465 assume ~r1~0 < 2;check_~tmp~1 := 1; 638#L447-1 check_#res := check_~tmp~1; 639#L495 main_#t~ret41 := check_#res;main_~c1~0 := main_#t~ret41;havoc main_#t~ret41;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 602#L577 assume !(0 == assert_~arg % 256); 603#L572 main_#t~post42 := main_~i2~0;main_~i2~0 := 1 + main_#t~post42;havoc main_#t~post42; 707#L547-2 [2020-10-26 05:49:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:49:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 1 times [2020-10-26 05:49:47,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:49:47,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809530509] [2020-10-26 05:49:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:49:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:49:48,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:49:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:49:48,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:49:48,271 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:49:48,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:49:48,272 INFO L82 PathProgramCache]: Analyzing trace with hash -980587232, now seen corresponding path program 2 times [2020-10-26 05:49:48,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:49:48,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18455043] [2020-10-26 05:49:48,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:49:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:49:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:49:48,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18455043] [2020-10-26 05:49:48,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:49:48,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:49:48,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362903838] [2020-10-26 05:49:48,316 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:49:48,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:49:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:49:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:49:48,318 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. cyclomatic complexity: 59 Second operand 3 states. [2020-10-26 05:49:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:49:48,387 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2020-10-26 05:49:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:49:48,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 254 transitions. [2020-10-26 05:49:48,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2020-10-26 05:49:48,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 254 transitions. [2020-10-26 05:49:48,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2020-10-26 05:49:48,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2020-10-26 05:49:48,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 254 transitions. [2020-10-26 05:49:48,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:49:48,395 INFO L691 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2020-10-26 05:49:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 254 transitions. [2020-10-26 05:49:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-26 05:49:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-26 05:49:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2020-10-26 05:49:48,406 INFO L714 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2020-10-26 05:49:48,407 INFO L594 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2020-10-26 05:49:48,407 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:49:48,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 254 transitions. [2020-10-26 05:49:48,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2020-10-26 05:49:48,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:49:48,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:49:48,411 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] [2020-10-26 05:49:48,411 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] [2020-10-26 05:49:48,411 INFO L794 eck$LassoCheckResult]: Stem: 1004#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(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 904#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~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~ret40, main_#t~ret41, main_#t~post42, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep13~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep31~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep32~0 := main_#t~nondet18;havoc main_#t~nondet18;~id1~0 := main_#t~nondet19;havoc main_#t~nondet19;~r1~0 := main_#t~nondet20;havoc main_#t~nondet20;~st1~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl1~0 := main_#t~nondet22;havoc main_#t~nondet22;~m1~0 := main_#t~nondet23;havoc main_#t~nondet23;~max1~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode1~0 := main_#t~nondet25;havoc main_#t~nondet25;~id2~0 := main_#t~nondet26;havoc main_#t~nondet26;~r2~0 := main_#t~nondet27;havoc main_#t~nondet27;~st2~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl2~0 := main_#t~nondet29;havoc main_#t~nondet29;~m2~0 := main_#t~nondet30;havoc main_#t~nondet30;~max2~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode2~0 := main_#t~nondet32;havoc main_#t~nondet32;~id3~0 := main_#t~nondet33;havoc main_#t~nondet33;~r3~0 := main_#t~nondet34;havoc main_#t~nondet34;~st3~0 := main_#t~nondet35;havoc main_#t~nondet35;~nl3~0 := main_#t~nondet36;havoc main_#t~nondet36;~m3~0 := main_#t~nondet37;havoc main_#t~nondet37;~max3~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode3~0 := main_#t~nondet39;havoc main_#t~nondet39;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 905#L276 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 960#L279-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 966#L289 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 918#L292-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 999#L302 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 983#L305-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 943#L315 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 908#L318-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 909#L328 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 897#L331-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 978#L341 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 951#L344-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 894#L354 assume ~id1~0 != ~id2~0; 895#L355 assume ~id1~0 != ~id3~0; 946#L356 assume ~id2~0 != ~id3~0; 947#L357 assume ~id1~0 >= 0; 998#L358 assume ~id2~0 >= 0; 941#L359 assume ~id3~0 >= 0; 942#L360 assume 0 == ~r1~0; 980#L361 assume 0 == ~r2~0; 932#L362 assume 0 == ~r3~0; 933#L363 assume ~max1~0 == ~id1~0; 974#L364 assume ~max2~0 == ~id2~0; 892#L365 assume ~max3~0 == ~id3~0; 893#L366 assume 0 == ~st1~0; 972#L367 assume 0 == ~st2~0; 973#L368 assume 0 == ~st3~0; 997#L369 assume 0 == ~nl1~0; 937#L370 assume 0 == ~nl2~0; 938#L371 assume 0 == ~nl3~0; 979#L372 assume 0 == ~mode1~0 % 256; 928#L373 assume 0 == ~mode2~0 % 256; 929#L374 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 900#L354-1 init_#res := init_~tmp___5~0; 901#L439 main_#t~ret40 := init_#res;main_~i2~0 := main_#t~ret40;havoc main_#t~ret40; 902#L533 assume !(0 == main_~i2~0); 903#L533-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 1019#L547-2 [2020-10-26 05:49:48,412 INFO L796 eck$LassoCheckResult]: Loop: 1019#L547-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8; 1025#L122 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); 949#L124 assume !(0 != ~ep21~0 % 256); 987#L124-1 assume !(0 != ~ep31~0 % 256); 910#L131 assume !(2 == ~r1~0); 911#L138 ~mode1~0 := 0; 922#L122-2 havoc node2_#t~ite9, node2_#t~ite10; 1052#L165 assume !(0 != ~mode2~0 % 256); 1048#L190 assume !(~r2~0 < 2); 1046#L190-1 ~mode2~0 := 1; 1044#L165-2 havoc node3_#t~ite11, node3_#t~ite12; 1043#L208 assume !(0 != ~mode3~0 % 256); 1035#L233 assume !(~r3~0 < 2); 1030#L233-1 ~mode3~0 := 1; 1027#L208-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1026#L447 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1024#L448 assume ~st1~0 + ~nl1~0 <= 1; 1022#L449 assume ~st2~0 + ~nl2~0 <= 1; 1021#L450 assume ~st3~0 + ~nl3~0 <= 1; 1020#L451 assume !(~r1~0 >= 2); 1005#L454 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1006#L455 assume ~r1~0 < 2; 1059#L460 assume !(~r1~0 >= 2); 913#L464 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 914#L465 assume ~r1~0 < 2;check_~tmp~1 := 1; 1040#L447-1 check_#res := check_~tmp~1; 1037#L495 main_#t~ret41 := check_#res;main_~c1~0 := main_#t~ret41;havoc main_#t~ret41;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1031#L577 assume !(0 == assert_~arg % 256); 1028#L572 main_#t~post42 := main_~i2~0;main_~i2~0 := 1 + main_#t~post42;havoc main_#t~post42; 1019#L547-2 [2020-10-26 05:49:48,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:49:48,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 2 times [2020-10-26 05:49:48,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:49:48,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562890310] [2020-10-26 05:49:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:49:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:49:48,464 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:49:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:49:48,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:49:48,539 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:49:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:49:48,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1099389211, now seen corresponding path program 1 times [2020-10-26 05:49:48,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:49:48,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391682399] [2020-10-26 05:49:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:49:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:49:48,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:49:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:49:48,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:49:48,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:49:48,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:49:48,628 INFO L82 PathProgramCache]: Analyzing trace with hash -951041978, now seen corresponding path program 1 times [2020-10-26 05:49:48,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:49:48,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768388138] [2020-10-26 05:49:48,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:49:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:49:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:49:48,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768388138] [2020-10-26 05:49:48,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:49:48,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:49:48,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429773583] [2020-10-26 05:49:49,162 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 109 [2020-10-26 05:49:49,574 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2020-10-26 05:49:49,588 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:49:49,589 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:49:49,589 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:49:49,589 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:49:49,590 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 05:49:49,590 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:49,590 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:49:49,590 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:49:49,590 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-10-26 05:49:49,591 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:49:49,591 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:49:49,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,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-26 05:49:49,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-26 05:49:49,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-26 05:49:49,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,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-26 05:49:49,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,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-26 05:49:49,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:49,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,328 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:49:50,329 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:50,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 05:49:50,354 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:50,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 05:49:50,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 05:49:50,515 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 05:49:50,518 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:49:50,518 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:49:50,518 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:49:50,519 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:49:50,519 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 05:49:50,519 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:50,519 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:49:50,519 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:49:50,519 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-10-26 05:49:50,519 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:49:50,519 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:49:50,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-26 05:49:50,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,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-26 05:49:50,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,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-26 05:49:50,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,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-26 05:49:50,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:50,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-26 05:49:50,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:49:51,274 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:49:51,279 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,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 [2020-10-26 05:49:51,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:49:51,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:49:51,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:49:51,295 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) [2020-10-26 05:49:51,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:49:51,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:49:51,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,350 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) [2020-10-26 05:49:51,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:49:51,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:49:51,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:49:51,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,395 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) [2020-10-26 05:49:51,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:49:51,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:49:51,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:49:51,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:49:51,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:49:51,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:49:51,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:49:51,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:49:51,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:49:51,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:49:51,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:49:51,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:49:51,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:49:51,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:49:51,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:49:51,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,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-26 05:49:51,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:49:51,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:49:51,617 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) [2020-10-26 05:49:51,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:49:51,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:49:51,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:49:51,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:49:51,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:49:51,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:49:51,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:49:51,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,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-26 05:49:51,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:49:51,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:49:51,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 05:49:51,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:49:51,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:49:51,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:49:51,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:49:51,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:49:51,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:49:51,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:49:51,753 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 05:49:51,760 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 05:49:51,760 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:49:51,765 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 05:49:51,765 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 05:49:51,765 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 05:49:51,766 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2020-10-26 05:49:51,787 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 05:49:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:49:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:49:51,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 05:49:51,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:49:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:49:51,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 05:49:51,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:49:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:49:52,054 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 05:49:52,055 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 254 transitions. cyclomatic complexity: 84 Second operand 3 states. [2020-10-26 05:49:52,145 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 254 transitions. cyclomatic complexity: 84. Second operand 3 states. Result 290 states and 439 transitions. Complement of second has 4 states. [2020-10-26 05:49:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-26 05:49:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 05:49:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2020-10-26 05:49:52,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 177 transitions. Stem has 39 letters. Loop has 29 letters. [2020-10-26 05:49:52,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:49:52,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 177 transitions. Stem has 68 letters. Loop has 29 letters. [2020-10-26 05:49:52,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:49:52,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 177 transitions. Stem has 39 letters. Loop has 58 letters. [2020-10-26 05:49:52,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:49:52,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 439 transitions. [2020-10-26 05:49:52,162 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:49:52,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 0 states and 0 transitions. [2020-10-26 05:49:52,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:49:52,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:49:52,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:49:52,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:49:52,163 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:49:52,163 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:49:52,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:49:52,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:49:52,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:49:52,164 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-10-26 05:49:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:49:52,164 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-26 05:49:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 05:49:52,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-26 05:49:52,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:49:52,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 05:49:52,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:49:52,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:49:52,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:49:52,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:49:52,166 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:49:52,166 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:49:52,166 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:49:52,166 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:49:52,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 05:49:52,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:49:52,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 05:49:52,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:49:52 BoogieIcfgContainer [2020-10-26 05:49:52,173 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:49:52,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:49:52,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:49:52,174 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:49:52,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:49:46" (3/4) ... [2020-10-26 05:49:52,178 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 05:49:52,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:49:52,180 INFO L168 Benchmark]: Toolchain (without parser) took 7113.40 ms. Allocated memory was 44.0 MB in the beginning and 119.5 MB in the end (delta: 75.5 MB). Free memory was 20.3 MB in the beginning and 73.2 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 16.1 GB. [2020-10-26 05:49:52,181 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 44.0 MB. Free memory is still 23.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:49:52,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.72 ms. Allocated memory is still 54.5 MB. Free memory was 39.1 MB in the beginning and 37.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:49:52,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.75 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 34.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:49:52,183 INFO L168 Benchmark]: Boogie Preprocessor took 91.23 ms. Allocated memory is still 54.5 MB. Free memory was 34.4 MB in the beginning and 32.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:49:52,184 INFO L168 Benchmark]: RCFGBuilder took 976.97 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 32.1 MB in the beginning and 38.7 MB in the end (delta: -6.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 16.1 GB. [2020-10-26 05:49:52,185 INFO L168 Benchmark]: BuchiAutomizer took 5466.37 ms. Allocated memory was 67.1 MB in the beginning and 119.5 MB in the end (delta: 52.4 MB). Free memory was 38.4 MB in the beginning and 73.2 MB in the end (delta: -34.8 MB). Peak memory consumption was 17.2 MB. Max. memory is 16.1 GB. [2020-10-26 05:49:52,186 INFO L168 Benchmark]: Witness Printer took 4.84 ms. Allocated memory is still 119.5 MB. Free memory is still 73.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:49:52,190 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.25 ms. Allocated memory is still 44.0 MB. Free memory is still 23.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 489.72 ms. Allocated memory is still 54.5 MB. Free memory was 39.1 MB in the beginning and 37.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 58.75 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 34.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 91.23 ms. Allocated memory is still 54.5 MB. Free memory was 34.4 MB in the beginning and 32.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 976.97 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 32.1 MB in the beginning and 38.7 MB in the end (delta: -6.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 5466.37 ms. Allocated memory was 67.1 MB in the beginning and 119.5 MB in the end (delta: 52.4 MB). Free memory was 38.4 MB in the beginning and 73.2 MB in the end (delta: -34.8 MB). Peak memory consumption was 17.2 MB. Max. memory is 16.1 GB. * Witness Printer took 4.84 ms. Allocated memory is still 119.5 MB. Free memory is still 73.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 68 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 171 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 753 SDtfs, 354 SDslu, 1433 SDs, 0 SdLazy, 54 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital160 mio100 ax122 hnf104 lsp18 ukn100 mio100 lsp100 div168 bol100 ite100 ukn100 eq153 hnf75 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...