./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d1516397c9e3fe5ce9ef1c287c66a5cdc207f67 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:12:16,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:12:16,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:12:16,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:12:16,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:12:16,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:12:16,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:12:16,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:12:16,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:12:16,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:12:16,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:12:16,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:12:16,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:12:16,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:12:16,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:12:16,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:12:16,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:12:16,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:12:16,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:12:16,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:12:16,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:12:16,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:12:16,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:12:16,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:12:16,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:12:16,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:12:16,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:12:16,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:12:16,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:12:16,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:12:16,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:12:16,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:12:16,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:12:16,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:12:16,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:12:16,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:12:16,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:12:16,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:12:16,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:12:16,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:12:16,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:12:16,395 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:12:16,419 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:12:16,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:12:16,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:12:16,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:12:16,421 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:12:16,422 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:12:16,422 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:12:16,422 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:12:16,422 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:12:16,423 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:12:16,423 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:12:16,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:12:16,423 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:12:16,424 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:12:16,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:12:16,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:12:16,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:12:16,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:12:16,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:12:16,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:12:16,425 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:12:16,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:12:16,426 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:12:16,426 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:12:16,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:12:16,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:12:16,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:12:16,427 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:12:16,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:12:16,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:12:16,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:12:16,428 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:12:16,429 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:12:16,429 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d1516397c9e3fe5ce9ef1c287c66a5cdc207f67 [2020-10-20 08:12:16,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:12:16,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:12:16,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:12:16,661 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:12:16,662 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:12:16,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2020-10-20 08:12:16,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2848fd5/8db345f7e7c34286b5301e4689c25fb0/FLAG86846389c [2020-10-20 08:12:17,386 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:12:17,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2020-10-20 08:12:17,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2848fd5/8db345f7e7c34286b5301e4689c25fb0/FLAG86846389c [2020-10-20 08:12:17,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2848fd5/8db345f7e7c34286b5301e4689c25fb0 [2020-10-20 08:12:17,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:12:17,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:12:17,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:12:17,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:12:17,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:12:17,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:12:17" (1/1) ... [2020-10-20 08:12:17,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510ee7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:17, skipping insertion in model container [2020-10-20 08:12:17,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:12:17" (1/1) ... [2020-10-20 08:12:17,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:12:17,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:12:18,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:12:18,207 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:12:18,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:12:18,305 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:12:18,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18 WrapperNode [2020-10-20 08:12:18,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:12:18,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:12:18,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:12:18,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:12:18,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (1/1) ... [2020-10-20 08:12:18,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (1/1) ... [2020-10-20 08:12:18,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:12:18,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:12:18,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:12:18,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:12:18,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (1/1) ... [2020-10-20 08:12:18,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (1/1) ... [2020-10-20 08:12:18,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (1/1) ... [2020-10-20 08:12:18,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (1/1) ... [2020-10-20 08:12:18,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (1/1) ... [2020-10-20 08:12:18,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (1/1) ... [2020-10-20 08:12:18,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (1/1) ... [2020-10-20 08:12:18,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:12:18,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:12:18,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:12:18,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:12:18,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:12:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:12:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:12:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:12:19,381 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:12:19,381 INFO L298 CfgBuilder]: Removed 31 assume(true) statements. [2020-10-20 08:12:19,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:12:19 BoogieIcfgContainer [2020-10-20 08:12:19,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:12:19,384 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:12:19,385 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:12:19,389 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:12:19,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:12:19,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:12:17" (1/3) ... [2020-10-20 08:12:19,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@796adef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:12:19, skipping insertion in model container [2020-10-20 08:12:19,392 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:12:19,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:12:18" (2/3) ... [2020-10-20 08:12:19,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@796adef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:12:19, skipping insertion in model container [2020-10-20 08:12:19,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:12:19,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:12:19" (3/3) ... [2020-10-20 08:12:19,395 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2020-10-20 08:12:19,459 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:12:19,460 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:12:19,460 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:12:19,460 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:12:19,461 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:12:19,461 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:12:19,461 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:12:19,461 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:12:19,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states. [2020-10-20 08:12:19,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-10-20 08:12:19,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:12:19,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:12:19,529 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:19,530 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:19,530 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:12:19,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states. [2020-10-20 08:12:19,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-10-20 08:12:19,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:12:19,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:12:19,541 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:19,542 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:19,551 INFO L794 eck$LassoCheckResult]: Stem: 105#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(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 13#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 97#L344true assume !(0 == ~r1~0);init_~tmp~0 := 0; 100#L344-1true init_#res := init_~tmp~0; 99#L589true main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 71#L69true assume !(0 == assume_abort_if_not_~cond); 149#L68true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 145#L679-2true [2020-10-20 08:12:19,553 INFO L796 eck$LassoCheckResult]: Loop: 145#L679-2true assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 28#L139true assume !(0 != ~mode1~0 % 256); 41#L155true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 49#L155-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 12#L139-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 135#L167true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 137#L170true assume !(node2_~m2~0 != ~nomsg~0); 118#L170-1true ~mode2~0 := 0; 134#L167-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 138#L192true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 129#L195true assume !(node3_~m3~0 != ~nomsg~0); 127#L195-1true ~mode3~0 := 0; 116#L192-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 130#L217true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 101#L220true assume !(node4_~m4~0 != ~nomsg~0); 98#L220-1true ~mode4~0 := 0; 126#L217-2true havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 102#L242true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 104#L245true assume !(node5_~m5~0 != ~nomsg~0); 74#L245-1true ~mode5~0 := 0; 96#L242-2true havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 106#L267true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 89#L270true assume !(node6_~m6~0 != ~nomsg~0); 85#L270-1true ~mode6~0 := 0; 72#L267-2true havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 90#L292true assume !(0 != ~mode7~0 % 256); 128#L305true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite13 := ~send7~0; 131#L305-2true ~p7_new~0 := (if node7_#t~ite13 % 256 <= 127 then node7_#t~ite13 % 256 else node7_#t~ite13 % 256 - 256);havoc node7_#t~ite13;~mode7~0 := 1; 83#L292-2true havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 67#L317true assume !(0 != ~mode8~0 % 256); 119#L330true assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite14 := ~send8~0; 107#L330-2true ~p8_new~0 := (if node8_#t~ite14 % 256 <= 127 then node8_#t~ite14 % 256 else node8_#t~ite14 % 256 - 256);havoc node8_#t~ite14;~mode8~0 := 1; 68#L317-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 117#L597true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; 103#L597-1true check_#res := check_~tmp~1; 64#L617true main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 110#L718true assume !(0 == assert_~arg % 256); 76#L713true main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 145#L679-2true [2020-10-20 08:12:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2144605008, now seen corresponding path program 1 times [2020-10-20 08:12:19,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:19,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609061554] [2020-10-20 08:12:19,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:12:19,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609061554] [2020-10-20 08:12:19,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:12:19,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:12:19,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413725956] [2020-10-20 08:12:19,832 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:12:19,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1842952597, now seen corresponding path program 1 times [2020-10-20 08:12:19,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:19,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711558050] [2020-10-20 08:12:19,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:12:20,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711558050] [2020-10-20 08:12:20,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:12:20,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:12:20,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89382662] [2020-10-20 08:12:20,042 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:12:20,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:12:20,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:12:20,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:12:20,060 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 5 states. [2020-10-20 08:12:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:12:20,224 INFO L93 Difference]: Finished difference Result 149 states and 254 transitions. [2020-10-20 08:12:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:12:20,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 254 transitions. [2020-10-20 08:12:20,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-20 08:12:20,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 141 states and 186 transitions. [2020-10-20 08:12:20,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-10-20 08:12:20,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-10-20 08:12:20,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 186 transitions. [2020-10-20 08:12:20,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:12:20,243 INFO L691 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-10-20 08:12:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 186 transitions. [2020-10-20 08:12:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-20 08:12:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-20 08:12:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2020-10-20 08:12:20,279 INFO L714 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-10-20 08:12:20,279 INFO L594 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-10-20 08:12:20,280 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:12:20,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 186 transitions. [2020-10-20 08:12:20,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-20 08:12:20,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:12:20,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:12:20,285 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:20,286 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:20,287 INFO L794 eck$LassoCheckResult]: Stem: 446#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(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 338#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 339#L344 assume 0 == ~r1~0; 382#L345 assume ~id1~0 >= 0; 383#L346 assume 0 == ~st1~0; 437#L347 assume ~send1~0 == ~id1~0; 372#L348 assume 0 == ~mode1~0 % 256; 373#L349 assume ~id2~0 >= 0; 415#L350 assume 0 == ~st2~0; 354#L351 assume ~send2~0 == ~id2~0; 355#L352 assume 0 == ~mode2~0 % 256; 406#L353 assume ~id3~0 >= 0; 324#L354 assume 0 == ~st3~0; 325#L355 assume ~send3~0 == ~id3~0; 377#L356 assume 0 == ~mode3~0 % 256; 378#L357 assume ~id4~0 >= 0; 436#L358 assume 0 == ~st4~0; 370#L359 assume ~send4~0 == ~id4~0; 371#L360 assume 0 == ~mode4~0 % 256; 413#L361 assume ~id5~0 >= 0; 352#L362 assume 0 == ~st5~0; 353#L363 assume ~send5~0 == ~id5~0; 405#L364 assume 0 == ~mode5~0 % 256; 322#L365 assume ~id6~0 >= 0; 323#L366 assume 0 == ~st6~0; 398#L367 assume ~send6~0 == ~id6~0; 399#L368 assume 0 == ~mode6~0 % 256; 435#L369 assume ~id7~0 >= 0; 368#L370 assume 0 == ~st7~0; 369#L371 assume ~send7~0 == ~id7~0; 410#L372 assume 0 == ~mode7~0 % 256; 350#L373 assume ~id8~0 >= 0; 351#L374 assume 0 == ~st8~0; 403#L375 assume ~send8~0 == ~id8~0; 318#L376 assume 0 == ~mode8~0 % 256; 319#L377 assume ~id1~0 != ~id2~0; 396#L378 assume ~id1~0 != ~id3~0; 397#L379 assume ~id1~0 != ~id4~0; 434#L380 assume ~id1~0 != ~id5~0; 366#L381 assume ~id1~0 != ~id6~0; 367#L382 assume ~id1~0 != ~id7~0; 428#L383 assume ~id1~0 != ~id8~0; 346#L384 assume ~id2~0 != ~id3~0; 347#L385 assume ~id2~0 != ~id4~0; 402#L386 assume ~id2~0 != ~id5~0; 316#L387 assume ~id2~0 != ~id6~0; 317#L388 assume ~id2~0 != ~id7~0; 394#L389 assume ~id2~0 != ~id8~0; 395#L390 assume ~id3~0 != ~id4~0; 433#L391 assume ~id3~0 != ~id5~0; 361#L392 assume ~id3~0 != ~id6~0; 362#L393 assume ~id3~0 != ~id7~0; 426#L394 assume ~id3~0 != ~id8~0; 344#L395 assume ~id4~0 != ~id5~0; 345#L396 assume ~id4~0 != ~id6~0; 401#L397 assume ~id4~0 != ~id7~0; 314#L398 assume ~id4~0 != ~id8~0; 315#L399 assume ~id5~0 != ~id6~0; 392#L400 assume ~id5~0 != ~id7~0; 393#L401 assume ~id5~0 != ~id8~0; 432#L402 assume ~id6~0 != ~id7~0; 357#L403 assume ~id6~0 != ~id8~0; 358#L404 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 443#L344-1 init_#res := init_~tmp~0; 441#L589 main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 422#L69 assume !(0 == assume_abort_if_not_~cond); 423#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 430#L679-2 [2020-10-20 08:12:20,287 INFO L796 eck$LassoCheckResult]: Loop: 430#L679-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 363#L139 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 364#L143 assume !(node1_~m1~0 != ~nomsg~0); 349#L143-1 ~mode1~0 := 0; 334#L139-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 335#L167 assume !(0 != ~mode2~0 % 256); 356#L180 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite8 := ~p2_new~0; 342#L180-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 343#L167-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 452#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 451#L195 assume !(node3_~m3~0 != ~nomsg~0); 387#L195-1 ~mode3~0 := 0; 360#L192-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 449#L217 assume !(0 != ~mode4~0 % 256); 320#L230 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 321#L230-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 340#L217-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 444#L242 assume !(0 != ~mode5~0 % 256); 336#L255 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 337#L255-2 ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 427#L242-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 440#L267 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 438#L270 assume !(node6_~m6~0 != ~nomsg~0); 327#L270-1 ~mode6~0 := 0; 424#L267-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 425#L292 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 404#L295 assume !(node7_~m7~0 != ~nomsg~0); 332#L295-1 ~mode7~0 := 0; 400#L292-2 havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 416#L317 assume !(0 != ~mode8~0 % 256); 417#L330 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite14 := ~send8~0; 448#L330-2 ~p8_new~0 := (if node8_#t~ite14 % 256 <= 127 then node8_#t~ite14 % 256 else node8_#t~ite14 % 256 - 256);havoc node8_#t~ite14;~mode8~0 := 1; 409#L317-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 418#L597 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; 380#L597-1 check_#res := check_~tmp~1; 411#L617 main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 412#L718 assume !(0 == assert_~arg % 256); 429#L713 main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 430#L679-2 [2020-10-20 08:12:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 1 times [2020-10-20 08:12:20,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:20,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932367069] [2020-10-20 08:12:20,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:20,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:20,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:20,542 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:12:20,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash -466130273, now seen corresponding path program 1 times [2020-10-20 08:12:20,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:20,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395272720] [2020-10-20 08:12:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:12:20,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395272720] [2020-10-20 08:12:20,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:12:20,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:12:20,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389015112] [2020-10-20 08:12:20,691 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:12:20,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:12:20,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:12:20,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:12:20,693 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. cyclomatic complexity: 46 Second operand 5 states. [2020-10-20 08:12:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:12:20,760 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2020-10-20 08:12:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:12:20,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 188 transitions. [2020-10-20 08:12:20,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-20 08:12:20,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 141 states and 183 transitions. [2020-10-20 08:12:20,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-10-20 08:12:20,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-10-20 08:12:20,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 183 transitions. [2020-10-20 08:12:20,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:12:20,771 INFO L691 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-10-20 08:12:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 183 transitions. [2020-10-20 08:12:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-20 08:12:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-20 08:12:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2020-10-20 08:12:20,782 INFO L714 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-10-20 08:12:20,782 INFO L594 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-10-20 08:12:20,782 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:12:20,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 183 transitions. [2020-10-20 08:12:20,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-10-20 08:12:20,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:12:20,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:12:20,787 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:20,787 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:20,787 INFO L794 eck$LassoCheckResult]: Stem: 743#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(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 635#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 636#L344 assume 0 == ~r1~0; 678#L345 assume ~id1~0 >= 0; 679#L346 assume 0 == ~st1~0; 734#L347 assume ~send1~0 == ~id1~0; 669#L348 assume 0 == ~mode1~0 % 256; 670#L349 assume ~id2~0 >= 0; 712#L350 assume 0 == ~st2~0; 652#L351 assume ~send2~0 == ~id2~0; 653#L352 assume 0 == ~mode2~0 % 256; 702#L353 assume ~id3~0 >= 0; 621#L354 assume 0 == ~st3~0; 622#L355 assume ~send3~0 == ~id3~0; 674#L356 assume 0 == ~mode3~0 % 256; 675#L357 assume ~id4~0 >= 0; 733#L358 assume 0 == ~st4~0; 667#L359 assume ~send4~0 == ~id4~0; 668#L360 assume 0 == ~mode4~0 % 256; 709#L361 assume ~id5~0 >= 0; 649#L362 assume 0 == ~st5~0; 650#L363 assume ~send5~0 == ~id5~0; 701#L364 assume 0 == ~mode5~0 % 256; 619#L365 assume ~id6~0 >= 0; 620#L366 assume 0 == ~st6~0; 694#L367 assume ~send6~0 == ~id6~0; 695#L368 assume 0 == ~mode6~0 % 256; 732#L369 assume ~id7~0 >= 0; 665#L370 assume 0 == ~st7~0; 666#L371 assume ~send7~0 == ~id7~0; 706#L372 assume 0 == ~mode7~0 % 256; 647#L373 assume ~id8~0 >= 0; 648#L374 assume 0 == ~st8~0; 699#L375 assume ~send8~0 == ~id8~0; 615#L376 assume 0 == ~mode8~0 % 256; 616#L377 assume ~id1~0 != ~id2~0; 692#L378 assume ~id1~0 != ~id3~0; 693#L379 assume ~id1~0 != ~id4~0; 731#L380 assume ~id1~0 != ~id5~0; 663#L381 assume ~id1~0 != ~id6~0; 664#L382 assume ~id1~0 != ~id7~0; 725#L383 assume ~id1~0 != ~id8~0; 645#L384 assume ~id2~0 != ~id3~0; 646#L385 assume ~id2~0 != ~id4~0; 698#L386 assume ~id2~0 != ~id5~0; 613#L387 assume ~id2~0 != ~id6~0; 614#L388 assume ~id2~0 != ~id7~0; 690#L389 assume ~id2~0 != ~id8~0; 691#L390 assume ~id3~0 != ~id4~0; 730#L391 assume ~id3~0 != ~id5~0; 656#L392 assume ~id3~0 != ~id6~0; 657#L393 assume ~id3~0 != ~id7~0; 721#L394 assume ~id3~0 != ~id8~0; 641#L395 assume ~id4~0 != ~id5~0; 642#L396 assume ~id4~0 != ~id6~0; 696#L397 assume ~id4~0 != ~id7~0; 611#L398 assume ~id4~0 != ~id8~0; 612#L399 assume ~id5~0 != ~id6~0; 688#L400 assume ~id5~0 != ~id7~0; 689#L401 assume ~id5~0 != ~id8~0; 729#L402 assume ~id6~0 != ~id7~0; 654#L403 assume ~id6~0 != ~id8~0; 655#L404 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 739#L344-1 init_#res := init_~tmp~0; 738#L589 main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 719#L69 assume !(0 == assume_abort_if_not_~cond); 720#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 727#L679-2 [2020-10-20 08:12:20,804 INFO L796 eck$LassoCheckResult]: Loop: 727#L679-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 658#L139 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 659#L143 assume !(node1_~m1~0 != ~nomsg~0); 644#L143-1 ~mode1~0 := 0; 631#L139-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 632#L167 assume !(0 != ~mode2~0 % 256); 651#L180 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite8 := ~p2_new~0; 639#L180-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 640#L167-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 749#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 748#L195 assume !(node3_~m3~0 != ~nomsg~0); 683#L195-1 ~mode3~0 := 0; 662#L192-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 746#L217 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 740#L220 assume !(node4_~m4~0 != ~nomsg~0); 686#L220-1 ~mode4~0 := 0; 637#L217-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 741#L242 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 742#L245 assume !(node5_~m5~0 != ~nomsg~0); 673#L245-1 ~mode5~0 := 0; 724#L242-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 737#L267 assume !(0 != ~mode6~0 % 256); 744#L280 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite12 := ~send6~0; 751#L280-2 ~p6_new~0 := (if node6_#t~ite12 % 256 <= 127 then node6_#t~ite12 % 256 else node6_#t~ite12 % 256 - 256);havoc node6_#t~ite12;~mode6~0 := 1; 722#L267-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 723#L292 assume !(0 != ~mode7~0 % 256); 736#L305 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite13 := ~send7~0; 747#L305-2 ~p7_new~0 := (if node7_#t~ite13 % 256 <= 127 then node7_#t~ite13 % 256 else node7_#t~ite13 % 256 - 256);havoc node7_#t~ite13;~mode7~0 := 1; 697#L292-2 havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 713#L317 assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 704#L320 assume !(node8_~m8~0 != ~nomsg~0); 626#L320-1 ~mode8~0 := 0; 705#L317-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 715#L597 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 703#L598 assume ~r1~0 >= 8; 677#L602 assume ~r1~0 < 8;check_~tmp~1 := 1; 711#L597-1 check_#res := check_~tmp~1; 707#L617 main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 708#L718 assume !(0 == assert_~arg % 256); 726#L713 main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 727#L679-2 [2020-10-20 08:12:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 2 times [2020-10-20 08:12:20,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:20,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128840468] [2020-10-20 08:12:20,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:20,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:20,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:20,895 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:12:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1651606983, now seen corresponding path program 1 times [2020-10-20 08:12:20,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:20,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940334140] [2020-10-20 08:12:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:12:20,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940334140] [2020-10-20 08:12:20,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:12:20,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:12:20,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814967268] [2020-10-20 08:12:20,948 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:12:20,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:12:20,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:12:20,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:12:20,949 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. cyclomatic complexity: 43 Second operand 3 states. [2020-10-20 08:12:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:12:20,987 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2020-10-20 08:12:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:12:20,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 288 transitions. [2020-10-20 08:12:20,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2020-10-20 08:12:20,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 288 transitions. [2020-10-20 08:12:20,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2020-10-20 08:12:20,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2020-10-20 08:12:20,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 288 transitions. [2020-10-20 08:12:21,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:12:21,002 INFO L691 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-10-20 08:12:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 288 transitions. [2020-10-20 08:12:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-20 08:12:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-20 08:12:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2020-10-20 08:12:21,024 INFO L714 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-10-20 08:12:21,024 INFO L594 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-10-20 08:12:21,025 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:12:21,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 288 transitions. [2020-10-20 08:12:21,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2020-10-20 08:12:21,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:12:21,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:12:21,033 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:21,036 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:12:21,037 INFO L794 eck$LassoCheckResult]: Stem: 1101#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(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 989#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~ret48, main_#t~ret49, main_#t~post50, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id1~0 := main_#t~nondet16;havoc main_#t~nondet16;~st1~0 := main_#t~nondet17;havoc main_#t~nondet17;~send1~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~send2~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~id6~0 := main_#t~nondet36;havoc main_#t~nondet36;~st6~0 := main_#t~nondet37;havoc main_#t~nondet37;~send6~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode6~0 := main_#t~nondet39;havoc main_#t~nondet39;~id7~0 := main_#t~nondet40;havoc main_#t~nondet40;~st7~0 := main_#t~nondet41;havoc main_#t~nondet41;~send7~0 := main_#t~nondet42;havoc main_#t~nondet42;~mode7~0 := main_#t~nondet43;havoc main_#t~nondet43;~id8~0 := main_#t~nondet44;havoc main_#t~nondet44;~st8~0 := main_#t~nondet45;havoc main_#t~nondet45;~send8~0 := main_#t~nondet46;havoc main_#t~nondet46;~mode8~0 := main_#t~nondet47;havoc main_#t~nondet47;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 990#L344 assume 0 == ~r1~0; 1032#L345 assume ~id1~0 >= 0; 1033#L346 assume 0 == ~st1~0; 1091#L347 assume ~send1~0 == ~id1~0; 1025#L348 assume 0 == ~mode1~0 % 256; 1026#L349 assume ~id2~0 >= 0; 1067#L350 assume 0 == ~st2~0; 1007#L351 assume ~send2~0 == ~id2~0; 1008#L352 assume 0 == ~mode2~0 % 256; 1058#L353 assume ~id3~0 >= 0; 977#L354 assume 0 == ~st3~0; 978#L355 assume ~send3~0 == ~id3~0; 1030#L356 assume 0 == ~mode3~0 % 256; 1031#L357 assume ~id4~0 >= 0; 1090#L358 assume 0 == ~st4~0; 1023#L359 assume ~send4~0 == ~id4~0; 1024#L360 assume 0 == ~mode4~0 % 256; 1064#L361 assume ~id5~0 >= 0; 1005#L362 assume 0 == ~st5~0; 1006#L363 assume ~send5~0 == ~id5~0; 1056#L364 assume 0 == ~mode5~0 % 256; 973#L365 assume ~id6~0 >= 0; 974#L366 assume 0 == ~st6~0; 1050#L367 assume ~send6~0 == ~id6~0; 1051#L368 assume 0 == ~mode6~0 % 256; 1089#L369 assume ~id7~0 >= 0; 1021#L370 assume 0 == ~st7~0; 1022#L371 assume ~send7~0 == ~id7~0; 1063#L372 assume 0 == ~mode7~0 % 256; 1003#L373 assume ~id8~0 >= 0; 1004#L374 assume 0 == ~st8~0; 1055#L375 assume ~send8~0 == ~id8~0; 971#L376 assume 0 == ~mode8~0 % 256; 972#L377 assume ~id1~0 != ~id2~0; 1048#L378 assume ~id1~0 != ~id3~0; 1049#L379 assume ~id1~0 != ~id4~0; 1088#L380 assume ~id1~0 != ~id5~0; 1019#L381 assume ~id1~0 != ~id6~0; 1020#L382 assume ~id1~0 != ~id7~0; 1081#L383 assume ~id1~0 != ~id8~0; 999#L384 assume ~id2~0 != ~id3~0; 1000#L385 assume ~id2~0 != ~id4~0; 1054#L386 assume ~id2~0 != ~id5~0; 969#L387 assume ~id2~0 != ~id6~0; 970#L388 assume ~id2~0 != ~id7~0; 1046#L389 assume ~id2~0 != ~id8~0; 1047#L390 assume ~id3~0 != ~id4~0; 1087#L391 assume ~id3~0 != ~id5~0; 1012#L392 assume ~id3~0 != ~id6~0; 1013#L393 assume ~id3~0 != ~id7~0; 1078#L394 assume ~id3~0 != ~id8~0; 997#L395 assume ~id4~0 != ~id5~0; 998#L396 assume ~id4~0 != ~id6~0; 1052#L397 assume ~id4~0 != ~id7~0; 967#L398 assume ~id4~0 != ~id8~0; 968#L399 assume ~id5~0 != ~id6~0; 1044#L400 assume ~id5~0 != ~id7~0; 1045#L401 assume ~id5~0 != ~id8~0; 1086#L402 assume ~id6~0 != ~id7~0; 1010#L403 assume ~id6~0 != ~id8~0; 1011#L404 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 1096#L344-1 init_#res := init_~tmp~0; 1095#L589 main_#t~ret48 := init_#res;main_~i2~0 := main_#t~ret48;havoc main_#t~ret48;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 1076#L69 assume !(0 == assume_abort_if_not_~cond); 1077#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 1084#L679-2 [2020-10-20 08:12:21,038 INFO L796 eck$LassoCheckResult]: Loop: 1084#L679-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1014#L139 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 1015#L143 assume !(node1_~m1~0 != ~nomsg~0); 1002#L143-1 ~mode1~0 := 0; 987#L139-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 988#L167 assume !(0 != ~mode2~0 % 256); 1009#L180 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite8 := ~p2_new~0; 995#L180-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 996#L167-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1108#L192 assume !(0 != ~mode3~0 % 256); 1027#L205 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite9 := ~p3_new~0; 1017#L205-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 1018#L192-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1104#L217 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1097#L220 assume !(node4_~m4~0 != ~nomsg~0); 1042#L220-1 ~mode4~0 := 0; 993#L217-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1098#L242 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1099#L245 assume !(node5_~m5~0 != ~nomsg~0); 1029#L245-1 ~mode5~0 := 0; 1082#L242-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1094#L267 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1092#L270 assume !(node6_~m6~0 != ~nomsg~0); 980#L270-1 ~mode6~0 := 0; 1079#L267-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 1080#L292 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1057#L295 assume !(node7_~m7~0 != ~nomsg~0); 985#L295-1 ~mode7~0 := 0; 1053#L292-2 havoc node8_#t~ite14, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 1070#L317 assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 1061#L320 assume !(node8_~m8~0 != ~nomsg~0); 982#L320-1 ~mode8~0 := 0; 1062#L317-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1072#L597 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 1111#L598 assume !(~r1~0 >= 8); 1034#L601 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 1035#L602 assume ~r1~0 < 8;check_~tmp~1 := 1; 1100#L597-1 check_#res := check_~tmp~1; 1065#L617 main_#t~ret49 := check_#res;main_~c1~0 := main_#t~ret49;havoc main_#t~ret49;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1066#L718 assume !(0 == assert_~arg % 256); 1083#L713 main_#t~post50 := main_~i2~0;main_~i2~0 := 1 + main_#t~post50;havoc main_#t~post50; 1084#L679-2 [2020-10-20 08:12:21,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:21,043 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 3 times [2020-10-20 08:12:21,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:21,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645931086] [2020-10-20 08:12:21,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:21,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:21,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:21,144 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:12:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash 902551047, now seen corresponding path program 1 times [2020-10-20 08:12:21,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:21,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692775015] [2020-10-20 08:12:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:21,159 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:12:21,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:12:21,178 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:12:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:12:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash 82038344, now seen corresponding path program 1 times [2020-10-20 08:12:21,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:12:21,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121728941] [2020-10-20 08:12:21,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:12:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:12:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:12:21,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121728941] [2020-10-20 08:12:21,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:12:21,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:12:21,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30001347] [2020-10-20 08:12:22,715 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 215 DAG size of output: 210 [2020-10-20 08:12:23,634 WARN L193 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 187 [2020-10-20 08:12:23,655 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:12:23,656 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:12:23,656 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:12:23,656 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:12:23,657 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:12:23,657 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:23,657 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:12:23,657 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:12:23,658 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.1.ufo.BOUNDED-16.pals.c_Iteration4_Loop [2020-10-20 08:12:23,658 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:12:23,658 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:12:23,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:23,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:23,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:23,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,021 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2020-10-20 08:12:24,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:24,663 WARN L193 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-10-20 08:12:25,040 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-20 08:12:51,116 WARN L193 SmtUtils]: Spent 26.01 s on a formula simplification. DAG size of input: 288 DAG size of output: 178 [2020-10-20 08:12:51,535 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:12:51,536 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:12:51,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:12:51,550 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:12:51,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:12:51,629 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:51,842 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:12:51,845 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:12:51,846 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:12:51,846 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:12:51,846 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:12:51,846 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:12:51,846 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:12:51,847 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:12:51,847 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:12:51,847 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.1.ufo.BOUNDED-16.pals.c_Iteration4_Loop [2020-10-20 08:12:51,847 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:12:51,847 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:12:51,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:51,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,286 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2020-10-20 08:12:52,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:52,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:12:53,042 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-10-20 08:12:53,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-20 08:13:19,847 WARN L193 SmtUtils]: Spent 26.38 s on a formula simplification. DAG size of input: 288 DAG size of output: 178 [2020-10-20 08:13:20,140 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:13:20,146 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:20,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:20,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:20,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:20,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:20,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:20,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:20,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:20,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:13:20,171 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-20 08:13:20,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:20,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:20,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:20,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:20,234 INFO L204 nArgumentSynthesizer]: 34 loop disjuncts [2020-10-20 08:13:20,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:20,798 INFO L401 nArgumentSynthesizer]: We have 68 Motzkin's Theorem applications. [2020-10-20 08:13:20,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:13:21,551 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-20 08:13:21,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:21,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:21,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:21,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:21,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:21,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:13:21,611 INFO L402 nArgumentSynthesizer]: A total of 2 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-20 08:13:21,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:21,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:21,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:21,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:21,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:21,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:21,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:21,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:21,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:13:21,655 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-20 08:13:21,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:21,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:21,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:21,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:21,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:21,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:21,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:21,694 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-20 08:13:21,696 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-20 08:13:21,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:21,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:21,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:21,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:21,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:21,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:21,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:21,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:13:21,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:21,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:21,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:21,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:21,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:21,818 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:13:21,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:21,822 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:13:21,822 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-20 08:13:21,833 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) [2020-10-20 08:13:21,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:21,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:21,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:21,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:21,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:21,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:21,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:21,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:21,908 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-20 08:13:21,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:22,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:22,005 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-20 08:13:22,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:13:22,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:13:22,098 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) [2020-10-20 08:13:22,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:22,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:22,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,194 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) [2020-10-20 08:13:22,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:13:22,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:22,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:13:22,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:13:22,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:22,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:22,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:22,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:22,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:22,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:22,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:22,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:22,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:22,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:22,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:13:22,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:13:22,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:22,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:13:22,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:13:22,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:22,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:22,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:22,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:22,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:13:22,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:22,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:22,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:22,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:13:22,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:13:22,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:13:22,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:13:22,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:13:22,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:13:22,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:13:22,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:13:22,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:13:22,874 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:13:22,875 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:13:22,919 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:13:22,919 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:13:22,919 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:13:22,920 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 31 Supporting invariants [] [2020-10-20 08:13:22,949 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:13:22,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:13:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:13:23,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:13:23,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:13:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:13:23,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:13:23,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:13:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:13:23,156 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 08:13:23,157 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 80 Second operand 3 states. [2020-10-20 08:13:23,295 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 80. Second operand 3 states. Result 350 states and 509 transitions. Complement of second has 4 states. [2020-10-20 08:13:23,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:13:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:13:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-10-20 08:13:23,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 67 letters. Loop has 41 letters. [2020-10-20 08:13:23,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:13:23,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 108 letters. Loop has 41 letters. [2020-10-20 08:13:23,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:13:23,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 67 letters. Loop has 82 letters. [2020-10-20 08:13:23,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:13:23,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 509 transitions. [2020-10-20 08:13:23,308 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:13:23,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 0 states and 0 transitions. [2020-10-20 08:13:23,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:13:23,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:13:23,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:13:23,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:13:23,309 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:13:23,310 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:13:23,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:13:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:13:23,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:13:23,311 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-10-20 08:13:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:13:23,311 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-20 08:13:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 08:13:23,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-20 08:13:23,312 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:13:23,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 08:13:23,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:13:23,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:13:23,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:13:23,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:13:23,313 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:13:23,313 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:13:23,313 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:13:23,313 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:13:23,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:13:23,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:13:23,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:13:23,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:13:23 BoogieIcfgContainer [2020-10-20 08:13:23,321 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:13:23,322 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:13:23,322 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:13:23,322 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:13:23,323 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:12:19" (3/4) ... [2020-10-20 08:13:23,327 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:13:23,327 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:13:23,329 INFO L168 Benchmark]: Toolchain (without parser) took 65607.28 ms. Allocated memory was 36.7 MB in the beginning and 197.1 MB in the end (delta: 160.4 MB). Free memory was 11.0 MB in the beginning and 39.6 MB in the end (delta: -28.7 MB). Peak memory consumption was 131.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:13:23,330 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 29.4 MB. Free memory was 15.3 MB in the beginning and 15.2 MB in the end (delta: 41.9 kB). Peak memory consumption was 41.9 kB. Max. memory is 14.3 GB. [2020-10-20 08:13:23,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.95 ms. Allocated memory was 36.7 MB in the beginning and 40.9 MB in the end (delta: 4.2 MB). Free memory was 10.1 MB in the beginning and 20.8 MB in the end (delta: -10.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:13:23,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.48 ms. Allocated memory is still 40.9 MB. Free memory was 20.8 MB in the beginning and 17.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:13:23,332 INFO L168 Benchmark]: Boogie Preprocessor took 55.65 ms. Allocated memory is still 40.9 MB. Free memory was 17.5 MB in the beginning and 14.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:13:23,333 INFO L168 Benchmark]: RCFGBuilder took 949.72 ms. Allocated memory was 40.9 MB in the beginning and 44.6 MB in the end (delta: 3.7 MB). Free memory was 14.6 MB in the beginning and 10.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:13:23,334 INFO L168 Benchmark]: BuchiAutomizer took 63937.08 ms. Allocated memory was 44.6 MB in the beginning and 197.1 MB in the end (delta: 152.6 MB). Free memory was 9.7 MB in the beginning and 42.6 MB in the end (delta: -32.9 MB). Peak memory consumption was 119.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:13:23,334 INFO L168 Benchmark]: Witness Printer took 5.21 ms. Allocated memory is still 197.1 MB. Free memory was 42.6 MB in the beginning and 39.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:13:23,338 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.27 ms. Allocated memory is still 29.4 MB. Free memory was 15.3 MB in the beginning and 15.2 MB in the end (delta: 41.9 kB). Peak memory consumption was 41.9 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 578.95 ms. Allocated memory was 36.7 MB in the beginning and 40.9 MB in the end (delta: 4.2 MB). Free memory was 10.1 MB in the beginning and 20.8 MB in the end (delta: -10.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 71.48 ms. Allocated memory is still 40.9 MB. Free memory was 20.8 MB in the beginning and 17.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 55.65 ms. Allocated memory is still 40.9 MB. Free memory was 17.5 MB in the beginning and 14.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 949.72 ms. Allocated memory was 40.9 MB in the beginning and 44.6 MB in the end (delta: 3.7 MB). Free memory was 14.6 MB in the beginning and 10.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 63937.08 ms. Allocated memory was 44.6 MB in the beginning and 197.1 MB in the end (delta: 152.6 MB). Free memory was 9.7 MB in the beginning and 42.6 MB in the end (delta: -32.9 MB). Peak memory consumption was 119.6 MB. Max. memory is 14.3 GB. * Witness Printer took 5.21 ms. Allocated memory is still 197.1 MB. Free memory was 42.6 MB in the beginning and 39.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 31 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 63.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 62.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 209 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 895 SDtfs, 290 SDslu, 1519 SDs, 0 SdLazy, 36 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital288 mio100 ax133 hnf107 lsp48 ukn75 mio100 lsp100 div141 bol100 ite100 ukn100 eq184 hnf75 smp100 dnf11772 smp23 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 1348ms VariablesStem: 0 VariablesLoop: 45 DisjunctsStem: 1 DisjunctsLoop: 34 SupportingInvariants: 0 MotzkinApplications: 68 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...