./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/toy1.cil.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 f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 16:31:32,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:31:32,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:31:32,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:31:32,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:31:32,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:31:32,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:31:32,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:31:32,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:31:32,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:31:32,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:31:32,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:31:32,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:31:32,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:31:32,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:31:32,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:31:32,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:31:32,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:31:32,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:31:32,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:31:32,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:31:32,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:31:32,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:31:32,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:31:32,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:31:32,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:31:32,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:31:32,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:31:32,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:31:32,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:31:32,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:31:32,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:31:32,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:31:32,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:31:32,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:31:32,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:31:32,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:31:32,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:31:32,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:31:32,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:31:32,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:31:32,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 16:31:32,462 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:31:32,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:31:32,463 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:31:32,463 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:31:32,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:31:32,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:31:32,465 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:31:32,465 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:31:32,465 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:31:32,465 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:31:32,466 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:31:32,466 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:31:32,466 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:31:32,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:31:32,466 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:31:32,466 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:31:32,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:31:32,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:31:32,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:31:32,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:31:32,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:31:32,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:31:32,467 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:31:32,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:31:32,468 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:31:32,468 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:31:32,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:31:32,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:31:32,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:31:32,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:31:32,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:31:32,469 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:31:32,470 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:31:32,470 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 [2021-08-27 16:31:32,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:31:32,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:31:32,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:31:32,741 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:31:32,742 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:31:32,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2021-08-27 16:31:32,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313ee3136/60df32dfed09438d83e80d7d9967f52e/FLAG98237ec60 [2021-08-27 16:31:33,184 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:31:33,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2021-08-27 16:31:33,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313ee3136/60df32dfed09438d83e80d7d9967f52e/FLAG98237ec60 [2021-08-27 16:31:33,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313ee3136/60df32dfed09438d83e80d7d9967f52e [2021-08-27 16:31:33,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:31:33,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:31:33,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:31:33,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:31:33,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:31:33,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416f75a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33, skipping insertion in model container [2021-08-27 16:31:33,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:31:33,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:31:33,359 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c[393,406] [2021-08-27 16:31:33,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:31:33,440 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:31:33,459 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c[393,406] [2021-08-27 16:31:33,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:31:33,527 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:31:33,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33 WrapperNode [2021-08-27 16:31:33,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:31:33,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:31:33,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:31:33,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:31:33,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:31:33,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:31:33,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:31:33,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:31:33,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:31:33,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:31:33,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:31:33,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:31:33,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (1/1) ... [2021-08-27 16:31:33,586 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:33,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:33,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:33,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 16:31:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:31:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:31:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:31:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:31:34,009 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:31:34,010 INFO L299 CfgBuilder]: Removed 28 assume(true) statements. [2021-08-27 16:31:34,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:31:34 BoogieIcfgContainer [2021-08-27 16:31:34,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:31:34,012 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:31:34,012 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:31:34,013 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:31:34,014 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:31:34,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:31:33" (1/3) ... [2021-08-27 16:31:34,014 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@536b7dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:31:34, skipping insertion in model container [2021-08-27 16:31:34,014 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:31:34,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:33" (2/3) ... [2021-08-27 16:31:34,015 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@536b7dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:31:34, skipping insertion in model container [2021-08-27 16:31:34,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:31:34,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:31:34" (3/3) ... [2021-08-27 16:31:34,015 INFO L389 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2021-08-27 16:31:34,063 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:31:34,063 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:31:34,063 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:31:34,063 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:31:34,063 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:31:34,063 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:31:34,063 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:31:34,063 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:31:34,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.8650793650793651) internal successors, (235), 126 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-08-27 16:31:34,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:34,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:34,115 INFO L842 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] [2021-08-27 16:31:34,115 INFO L843 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] [2021-08-27 16:31:34,115 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:31:34,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.8650793650793651) internal successors, (235), 126 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-08-27 16:31:34,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:34,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:34,123 INFO L842 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] [2021-08-27 16:31:34,123 INFO L843 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] [2021-08-27 16:31:34,127 INFO L791 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 40#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 103#L408true assume !(1 == ~c_req_up~0); 89#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 122#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 120#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 63#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 115#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 45#L439-1true assume !(0 == ~e_f~0); 8#L444-1true assume !(0 == ~e_g~0); 98#L449-1true assume !(0 == ~e_e~0); 54#L454-1true assume !(0 == ~e_c~0); 107#L459-1true assume !(0 == ~e_wl~0); 27#L464-1true assume !(1 == ~wl_pc~0); 44#L476true assume !(2 == ~wl_pc~0); 26#L477true assume !(1 == ~c1_pc~0); 19#L487true assume !(1 == ~c2_pc~0); 92#L496true assume !(1 == ~wb_pc~0); 31#L505true assume !(1 == ~e_c~0); 36#L514-1true assume !(1 == ~e_e~0); 129#L519-1true assume !(1 == ~e_f~0); 41#L524-1true assume !(1 == ~e_g~0); 127#L529-1true assume !(1 == ~e_c~0); 3#L534-1true assume !(1 == ~e_wl~0); 7#L676-1true [2021-08-27 16:31:34,128 INFO L793 eck$LassoCheckResult]: Loop: 7#L676-1true assume !false; 34#L546true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 72#L381true assume !true; 121#L397true start_simulation_~kernel_st~0 := 2; 43#L552true assume !(1 == ~c_req_up~0); 62#L552-2true start_simulation_~kernel_st~0 := 3; 16#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 18#L564-2true assume 0 == ~e_g~0;~e_g~0 := 1; 9#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 126#L574-1true assume !(0 == ~e_c~0); 14#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 97#L584-1true assume 1 == ~wl_pc~0; 49#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 109#L597true assume !(1 == ~c1_pc~0); 29#L607true assume !(1 == ~c2_pc~0); 101#L616true assume !(1 == ~wb_pc~0); 117#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 61#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 53#L639-1true assume 1 == ~e_f~0;~e_f~0 := 2; 112#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 79#L649-1true assume !(1 == ~e_c~0); 42#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 24#L659-1true assume 0 == ~wl_st~0; 7#L676-1true [2021-08-27 16:31:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2021-08-27 16:31:34,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621487685] [2021-08-27 16:31:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:34,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:34,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621487685] [2021-08-27 16:31:34,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621487685] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:34,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:34,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:34,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766769547] [2021-08-27 16:31:34,316 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:34,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,318 INFO L82 PathProgramCache]: Analyzing trace with hash 476885301, now seen corresponding path program 1 times [2021-08-27 16:31:34,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177209582] [2021-08-27 16:31:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:34,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:34,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177209582] [2021-08-27 16:31:34,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177209582] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:34,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:34,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:31:34,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756284123] [2021-08-27 16:31:34,351 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:34,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:34,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 16:31:34,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 16:31:34,368 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.8650793650793651) internal successors, (235), 126 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:34,387 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2021-08-27 16:31:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 16:31:34,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 221 transitions. [2021-08-27 16:31:34,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-27 16:31:34,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 121 states and 215 transitions. [2021-08-27 16:31:34,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-08-27 16:31:34,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-08-27 16:31:34,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 215 transitions. [2021-08-27 16:31:34,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:31:34,401 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2021-08-27 16:31:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 215 transitions. [2021-08-27 16:31:34,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-08-27 16:31:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.7768595041322315) internal successors, (215), 120 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2021-08-27 16:31:34,425 INFO L704 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2021-08-27 16:31:34,425 INFO L587 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2021-08-27 16:31:34,425 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:31:34,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 215 transitions. [2021-08-27 16:31:34,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-27 16:31:34,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:34,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:34,430 INFO L842 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] [2021-08-27 16:31:34,430 INFO L843 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] [2021-08-27 16:31:34,431 INFO L791 eck$LassoCheckResult]: Stem: 380#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 334#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 335#L408 assume !(1 == ~c_req_up~0); 297#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 375#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 382#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 360#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 361#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 343#L439-1 assume !(0 == ~e_f~0); 270#L444-1 assume !(0 == ~e_g~0); 271#L449-1 assume !(0 == ~e_e~0); 354#L454-1 assume !(0 == ~e_c~0); 355#L459-1 assume !(0 == ~e_wl~0); 309#L464-1 assume !(1 == ~wl_pc~0); 310#L476 assume !(2 == ~wl_pc~0); 307#L477 assume !(1 == ~c1_pc~0); 293#L487 assume !(1 == ~c2_pc~0); 295#L496 assume !(1 == ~wb_pc~0); 321#L505 assume !(1 == ~e_c~0); 322#L514-1 assume !(1 == ~e_e~0); 328#L519-1 assume !(1 == ~e_f~0); 336#L524-1 assume !(1 == ~e_g~0); 337#L529-1 assume !(1 == ~e_c~0); 263#L534-1 assume !(1 == ~e_wl~0); 264#L676-1 [2021-08-27 16:31:34,434 INFO L793 eck$LassoCheckResult]: Loop: 264#L676-1 assume !false; 269#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 291#L381 assume !false; 329#L299 assume !(0 == ~wl_st~0); 330#L303 assume !(0 == ~c1_st~0); 381#L306 assume !(0 == ~c2_st~0); 377#L309 assume !(0 == ~wb_st~0); 378#L312 assume !(0 == ~r_st~0); 383#L397 start_simulation_~kernel_st~0 := 2; 339#L552 assume !(1 == ~c_req_up~0); 340#L552-2 start_simulation_~kernel_st~0 := 3; 288#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 289#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 272#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 273#L574-1 assume !(0 == ~e_c~0); 283#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 284#L584-1 assume !(1 == ~wl_pc~0); 345#L596 assume !(2 == ~wl_pc~0); 347#L597 assume !(1 == ~c1_pc~0); 315#L607 assume !(1 == ~c2_pc~0); 316#L616 assume !(1 == ~wb_pc~0); 367#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 359#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 352#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 353#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 369#L649-1 assume !(1 == ~e_c~0); 338#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 303#L659-1 assume 0 == ~wl_st~0; 264#L676-1 [2021-08-27 16:31:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2021-08-27 16:31:34,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31522629] [2021-08-27 16:31:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:34,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:34,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31522629] [2021-08-27 16:31:34,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31522629] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:34,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:34,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:34,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731540031] [2021-08-27 16:31:34,489 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,491 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 1 times [2021-08-27 16:31:34,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46618232] [2021-08-27 16:31:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:34,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:34,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46618232] [2021-08-27 16:31:34,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46618232] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:34,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:34,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:34,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929427193] [2021-08-27 16:31:34,536 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:34,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:34,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:34,538 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. cyclomatic complexity: 95 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:34,553 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2021-08-27 16:31:34,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:34,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 214 transitions. [2021-08-27 16:31:34,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-27 16:31:34,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 214 transitions. [2021-08-27 16:31:34,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-08-27 16:31:34,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-08-27 16:31:34,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 214 transitions. [2021-08-27 16:31:34,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:31:34,560 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2021-08-27 16:31:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 214 transitions. [2021-08-27 16:31:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-08-27 16:31:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.7685950413223142) internal successors, (214), 120 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 214 transitions. [2021-08-27 16:31:34,571 INFO L704 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2021-08-27 16:31:34,571 INFO L587 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2021-08-27 16:31:34,571 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:31:34,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 214 transitions. [2021-08-27 16:31:34,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-27 16:31:34,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:34,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:34,574 INFO L842 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] [2021-08-27 16:31:34,574 INFO L843 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] [2021-08-27 16:31:34,574 INFO L791 eck$LassoCheckResult]: Stem: 629#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 583#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 584#L408 assume !(1 == ~c_req_up~0); 546#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 624#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 631#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 609#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 610#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 592#L439-1 assume !(0 == ~e_f~0); 519#L444-1 assume !(0 == ~e_g~0); 520#L449-1 assume !(0 == ~e_e~0); 603#L454-1 assume !(0 == ~e_c~0); 604#L459-1 assume !(0 == ~e_wl~0); 558#L464-1 assume !(1 == ~wl_pc~0); 559#L476 assume !(2 == ~wl_pc~0); 556#L477 assume !(1 == ~c1_pc~0); 542#L487 assume !(1 == ~c2_pc~0); 544#L496 assume !(1 == ~wb_pc~0); 570#L505 assume !(1 == ~e_c~0); 571#L514-1 assume !(1 == ~e_e~0); 577#L519-1 assume !(1 == ~e_f~0); 585#L524-1 assume !(1 == ~e_g~0); 586#L529-1 assume !(1 == ~e_c~0); 512#L534-1 assume !(1 == ~e_wl~0); 513#L676-1 [2021-08-27 16:31:34,575 INFO L793 eck$LassoCheckResult]: Loop: 513#L676-1 assume !false; 518#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 540#L381 assume !false; 578#L299 assume !(0 == ~wl_st~0); 579#L303 assume !(0 == ~c1_st~0); 630#L306 assume !(0 == ~c2_st~0); 626#L309 assume !(0 == ~wb_st~0); 627#L312 assume !(0 == ~r_st~0); 632#L397 start_simulation_~kernel_st~0 := 2; 588#L552 assume !(1 == ~c_req_up~0); 589#L552-2 start_simulation_~kernel_st~0 := 3; 537#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 538#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 521#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 522#L574-1 assume !(0 == ~e_c~0); 532#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 533#L584-1 assume !(1 == ~wl_pc~0); 594#L596 assume !(2 == ~wl_pc~0); 596#L597 assume !(1 == ~c1_pc~0); 564#L607 assume !(1 == ~c2_pc~0); 565#L616 assume !(1 == ~wb_pc~0); 616#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 608#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 601#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 602#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 618#L649-1 assume !(1 == ~e_c~0); 587#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 552#L659-1 assume 0 == ~wl_st~0; 513#L676-1 [2021-08-27 16:31:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2021-08-27 16:31:34,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450403847] [2021-08-27 16:31:34,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:34,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:34,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450403847] [2021-08-27 16:31:34,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450403847] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:34,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:34,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:34,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678930880] [2021-08-27 16:31:34,616 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,616 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 2 times [2021-08-27 16:31:34,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403191924] [2021-08-27 16:31:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:34,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:34,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403191924] [2021-08-27 16:31:34,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403191924] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:34,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:34,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:34,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533292763] [2021-08-27 16:31:34,654 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:34,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:34,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:34,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:34,654 INFO L87 Difference]: Start difference. First operand 121 states and 214 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:34,674 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2021-08-27 16:31:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:34,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 213 transitions. [2021-08-27 16:31:34,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-27 16:31:34,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 213 transitions. [2021-08-27 16:31:34,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-08-27 16:31:34,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-08-27 16:31:34,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 213 transitions. [2021-08-27 16:31:34,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:31:34,677 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2021-08-27 16:31:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 213 transitions. [2021-08-27 16:31:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-08-27 16:31:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.7603305785123966) internal successors, (213), 120 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2021-08-27 16:31:34,680 INFO L704 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2021-08-27 16:31:34,680 INFO L587 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2021-08-27 16:31:34,680 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:31:34,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 213 transitions. [2021-08-27 16:31:34,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-27 16:31:34,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:34,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:34,682 INFO L842 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] [2021-08-27 16:31:34,682 INFO L843 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] [2021-08-27 16:31:34,682 INFO L791 eck$LassoCheckResult]: Stem: 878#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 832#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 833#L408 assume !(1 == ~c_req_up~0); 795#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 873#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 880#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 858#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 859#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 841#L439-1 assume !(0 == ~e_f~0); 768#L444-1 assume !(0 == ~e_g~0); 769#L449-1 assume !(0 == ~e_e~0); 852#L454-1 assume !(0 == ~e_c~0); 853#L459-1 assume !(0 == ~e_wl~0); 807#L464-1 assume !(1 == ~wl_pc~0); 808#L476 assume !(2 == ~wl_pc~0); 805#L477 assume !(1 == ~c1_pc~0); 791#L487 assume !(1 == ~c2_pc~0); 793#L496 assume !(1 == ~wb_pc~0); 819#L505 assume !(1 == ~e_c~0); 820#L514-1 assume !(1 == ~e_e~0); 826#L519-1 assume !(1 == ~e_f~0); 834#L524-1 assume !(1 == ~e_g~0); 835#L529-1 assume !(1 == ~e_c~0); 761#L534-1 assume !(1 == ~e_wl~0); 762#L676-1 [2021-08-27 16:31:34,682 INFO L793 eck$LassoCheckResult]: Loop: 762#L676-1 assume !false; 767#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 789#L381 assume !false; 827#L299 assume !(0 == ~wl_st~0); 828#L303 assume !(0 == ~c1_st~0); 879#L306 assume !(0 == ~c2_st~0); 875#L309 assume !(0 == ~wb_st~0); 876#L312 assume !(0 == ~r_st~0); 881#L397 start_simulation_~kernel_st~0 := 2; 837#L552 assume !(1 == ~c_req_up~0); 838#L552-2 start_simulation_~kernel_st~0 := 3; 786#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 787#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 770#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 771#L574-1 assume !(0 == ~e_c~0); 781#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 782#L584-1 assume !(1 == ~wl_pc~0); 843#L596 assume !(2 == ~wl_pc~0); 845#L597 assume !(1 == ~c1_pc~0); 813#L607 assume !(1 == ~c2_pc~0); 814#L616 assume !(1 == ~wb_pc~0); 865#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 857#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 850#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 851#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 867#L649-1 assume !(1 == ~e_c~0); 836#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 801#L659-1 assume 0 == ~wl_st~0; 762#L676-1 [2021-08-27 16:31:34,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2021-08-27 16:31:34,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408591911] [2021-08-27 16:31:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:34,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:34,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408591911] [2021-08-27 16:31:34,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408591911] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:34,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:34,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:34,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812444644] [2021-08-27 16:31:34,702 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:34,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 3 times [2021-08-27 16:31:34,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820151014] [2021-08-27 16:31:34,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:34,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:34,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820151014] [2021-08-27 16:31:34,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820151014] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:34,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:34,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:34,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457257178] [2021-08-27 16:31:34,716 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:34,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:34,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:34,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:34,717 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:34,724 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2021-08-27 16:31:34,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:34,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 212 transitions. [2021-08-27 16:31:34,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-27 16:31:34,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 212 transitions. [2021-08-27 16:31:34,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-08-27 16:31:34,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-08-27 16:31:34,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 212 transitions. [2021-08-27 16:31:34,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:31:34,727 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2021-08-27 16:31:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 212 transitions. [2021-08-27 16:31:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-08-27 16:31:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 120 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2021-08-27 16:31:34,730 INFO L704 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2021-08-27 16:31:34,730 INFO L587 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2021-08-27 16:31:34,730 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 16:31:34,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 212 transitions. [2021-08-27 16:31:34,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-27 16:31:34,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:34,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:34,732 INFO L842 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] [2021-08-27 16:31:34,732 INFO L843 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] [2021-08-27 16:31:34,732 INFO L791 eck$LassoCheckResult]: Stem: 1127#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1081#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1082#L408 assume !(1 == ~c_req_up~0); 1044#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1122#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1129#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1107#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1108#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1090#L439-1 assume !(0 == ~e_f~0); 1017#L444-1 assume !(0 == ~e_g~0); 1018#L449-1 assume !(0 == ~e_e~0); 1101#L454-1 assume !(0 == ~e_c~0); 1102#L459-1 assume !(0 == ~e_wl~0); 1056#L464-1 assume !(1 == ~wl_pc~0); 1057#L476 assume !(2 == ~wl_pc~0); 1054#L477 assume !(1 == ~c1_pc~0); 1040#L487 assume !(1 == ~c2_pc~0); 1042#L496 assume !(1 == ~wb_pc~0); 1068#L505 assume !(1 == ~e_c~0); 1069#L514-1 assume !(1 == ~e_e~0); 1075#L519-1 assume !(1 == ~e_f~0); 1083#L524-1 assume !(1 == ~e_g~0); 1084#L529-1 assume !(1 == ~e_c~0); 1010#L534-1 assume !(1 == ~e_wl~0); 1011#L676-1 [2021-08-27 16:31:34,732 INFO L793 eck$LassoCheckResult]: Loop: 1011#L676-1 assume !false; 1016#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1038#L381 assume !false; 1076#L299 assume !(0 == ~wl_st~0); 1077#L303 assume !(0 == ~c1_st~0); 1128#L306 assume !(0 == ~c2_st~0); 1124#L309 assume !(0 == ~wb_st~0); 1125#L312 assume !(0 == ~r_st~0); 1130#L397 start_simulation_~kernel_st~0 := 2; 1086#L552 assume !(1 == ~c_req_up~0); 1087#L552-2 start_simulation_~kernel_st~0 := 3; 1035#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1036#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1019#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1020#L574-1 assume !(0 == ~e_c~0); 1030#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1031#L584-1 assume !(1 == ~wl_pc~0); 1092#L596 assume !(2 == ~wl_pc~0); 1094#L597 assume !(1 == ~c1_pc~0); 1062#L607 assume !(1 == ~c2_pc~0); 1063#L616 assume !(1 == ~wb_pc~0); 1114#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1106#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1099#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1100#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1116#L649-1 assume !(1 == ~e_c~0); 1085#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1050#L659-1 assume 0 == ~wl_st~0; 1011#L676-1 [2021-08-27 16:31:34,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2021-08-27 16:31:34,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561799915] [2021-08-27 16:31:34,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:34,751 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:34,778 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:34,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,782 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 4 times [2021-08-27 16:31:34,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373584796] [2021-08-27 16:31:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:34,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:34,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373584796] [2021-08-27 16:31:34,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373584796] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:34,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:34,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:34,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032133608] [2021-08-27 16:31:34,811 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:34,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:34,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:34,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:34,812 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:34,841 INFO L93 Difference]: Finished difference Result 153 states and 272 transitions. [2021-08-27 16:31:34,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:34,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 272 transitions. [2021-08-27 16:31:34,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2021-08-27 16:31:34,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 272 transitions. [2021-08-27 16:31:34,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2021-08-27 16:31:34,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2021-08-27 16:31:34,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 272 transitions. [2021-08-27 16:31:34,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:31:34,848 INFO L681 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2021-08-27 16:31:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 272 transitions. [2021-08-27 16:31:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-08-27 16:31:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 153 states have (on average 1.7777777777777777) internal successors, (272), 152 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 272 transitions. [2021-08-27 16:31:34,862 INFO L704 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2021-08-27 16:31:34,862 INFO L587 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2021-08-27 16:31:34,862 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 16:31:34,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 272 transitions. [2021-08-27 16:31:34,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2021-08-27 16:31:34,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:34,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:34,864 INFO L842 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] [2021-08-27 16:31:34,865 INFO L843 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] [2021-08-27 16:31:34,865 INFO L791 eck$LassoCheckResult]: Stem: 1409#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1361#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1362#L408 assume !(1 == ~c_req_up~0); 1324#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1403#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1413#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1388#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1389#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1370#L439-1 assume !(0 == ~e_f~0); 1297#L444-1 assume !(0 == ~e_g~0); 1298#L449-1 assume !(0 == ~e_e~0); 1381#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1382#L459-1 assume !(0 == ~e_wl~0); 1336#L464-1 assume !(1 == ~wl_pc~0); 1337#L476 assume !(2 == ~wl_pc~0); 1334#L477 assume !(1 == ~c1_pc~0); 1320#L487 assume !(1 == ~c2_pc~0); 1322#L496 assume !(1 == ~wb_pc~0); 1348#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 1349#L514-1 assume !(1 == ~e_e~0); 1355#L519-1 assume !(1 == ~e_f~0); 1364#L524-1 assume !(1 == ~e_g~0); 1365#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1290#L534-1 assume !(1 == ~e_wl~0); 1291#L676-1 [2021-08-27 16:31:34,866 INFO L793 eck$LassoCheckResult]: Loop: 1291#L676-1 assume !false; 1296#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1318#L381 assume !false; 1356#L299 assume !(0 == ~wl_st~0); 1357#L303 assume !(0 == ~c1_st~0); 1412#L306 assume !(0 == ~c2_st~0); 1405#L309 assume !(0 == ~wb_st~0); 1406#L312 assume !(0 == ~r_st~0); 1414#L397 start_simulation_~kernel_st~0 := 2; 1366#L552 assume !(1 == ~c_req_up~0); 1367#L552-2 start_simulation_~kernel_st~0 := 3; 1315#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1316#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1299#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1300#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1415#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1442#L584-1 assume 1 == ~wl_pc~0; 1440#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1438#L597 assume !(1 == ~c1_pc~0); 1436#L607 assume !(1 == ~c2_pc~0); 1433#L616 assume !(1 == ~wb_pc~0); 1410#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1411#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1432#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1431#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1396#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1363#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1330#L659-1 assume 0 == ~wl_st~0; 1291#L676-1 [2021-08-27 16:31:34,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,866 INFO L82 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2021-08-27 16:31:34,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554238865] [2021-08-27 16:31:34,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:34,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:34,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554238865] [2021-08-27 16:31:34,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554238865] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:34,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:34,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:31:34,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885615827] [2021-08-27 16:31:34,904 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1254823475, now seen corresponding path program 1 times [2021-08-27 16:31:34,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:34,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219784120] [2021-08-27 16:31:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:34,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:34,914 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:34,925 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:35,199 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:35,199 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:35,199 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:35,200 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:35,200 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:31:35,200 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:35,200 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:35,200 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:35,200 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration6_Loop [2021-08-27 16:31:35,200 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:35,200 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:35,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,465 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:35,466 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:31:35,474 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:35,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:35,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:35,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 16:31:35,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:35,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:35,502 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:35,502 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:35,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:35,533 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:35,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:35,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:35,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 16:31:35,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:35,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:35,561 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:35,561 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:35,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:35,581 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:35,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:35,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:35,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 16:31:35,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:35,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:35,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:35,610 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:35,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:35,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:35,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 16:31:35,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:31:35,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:35,635 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:31:35,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-08-27 16:31:35,663 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:35,664 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:35,664 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:35,664 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:35,664 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:31:35,664 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:35,664 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:35,664 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:35,664 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration6_Loop [2021-08-27 16:31:35,664 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:35,664 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:35,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:35,985 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:35,988 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:31:35,989 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:35,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:36,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:36,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 16:31:36,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:36,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:36,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:36,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:36,043 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:31:36,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:36,044 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:31:36,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:36,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:36,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:36,119 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:36,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:36,133 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:36,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:36,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:36,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:36,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:36,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:36,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:36,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:36,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:36,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 16:31:36,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:36,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:36,207 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:36,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:36,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:36,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 16:31:36,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:36,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:36,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:36,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:36,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:36,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:36,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:36,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:36,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:31:36,236 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:31:36,236 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:31:36,237 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:36,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:36,257 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:36,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 16:31:36,289 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:31:36,290 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:31:36,290 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:31:36,290 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2021-08-27 16:31:36,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:36,309 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:31:36,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:36,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:31:36,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:36,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:31:36,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:36,558 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-27 16:31:36,558 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:36,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:36,638 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 474 states and 835 transitions. Complement of second has 5 states. [2021-08-27 16:31:36,639 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 [2021-08-27 16:31:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2021-08-27 16:31:36,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 28 letters. [2021-08-27 16:31:36,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:36,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 52 letters. Loop has 28 letters. [2021-08-27 16:31:36,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:36,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 56 letters. [2021-08-27 16:31:36,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:36,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 474 states and 835 transitions. [2021-08-27 16:31:36,650 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 302 [2021-08-27 16:31:36,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 474 states to 459 states and 805 transitions. [2021-08-27 16:31:36,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2021-08-27 16:31:36,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2021-08-27 16:31:36,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 805 transitions. [2021-08-27 16:31:36,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:36,653 INFO L681 BuchiCegarLoop]: Abstraction has 459 states and 805 transitions. [2021-08-27 16:31:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 805 transitions. [2021-08-27 16:31:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 351. [2021-08-27 16:31:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 351 states have (on average 1.754985754985755) internal successors, (616), 350 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 616 transitions. [2021-08-27 16:31:36,659 INFO L704 BuchiCegarLoop]: Abstraction has 351 states and 616 transitions. [2021-08-27 16:31:36,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:36,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:31:36,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:31:36,659 INFO L87 Difference]: Start difference. First operand 351 states and 616 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:36,749 INFO L93 Difference]: Finished difference Result 640 states and 1104 transitions. [2021-08-27 16:31:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:31:36,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 640 states and 1104 transitions. [2021-08-27 16:31:36,754 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2021-08-27 16:31:36,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 640 states to 640 states and 1104 transitions. [2021-08-27 16:31:36,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 456 [2021-08-27 16:31:36,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2021-08-27 16:31:36,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 1104 transitions. [2021-08-27 16:31:36,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:36,760 INFO L681 BuchiCegarLoop]: Abstraction has 640 states and 1104 transitions. [2021-08-27 16:31:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 1104 transitions. [2021-08-27 16:31:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 610. [2021-08-27 16:31:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 610 states have (on average 1.740983606557377) internal successors, (1062), 609 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1062 transitions. [2021-08-27 16:31:36,771 INFO L704 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2021-08-27 16:31:36,771 INFO L587 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2021-08-27 16:31:36,771 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 16:31:36,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 610 states and 1062 transitions. [2021-08-27 16:31:36,774 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2021-08-27 16:31:36,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:36,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:36,775 INFO L842 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] [2021-08-27 16:31:36,775 INFO L843 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] [2021-08-27 16:31:36,775 INFO L791 eck$LassoCheckResult]: Stem: 3326#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3217#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3218#L408 assume !(1 == ~c_req_up~0); 3320#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3343#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3342#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3341#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3340#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3231#L439-1 assume !(0 == ~e_f~0); 3102#L444-1 assume !(0 == ~e_g~0); 3103#L449-1 assume !(0 == ~e_e~0); 3252#L454-1 assume !(0 == ~e_c~0); 3253#L459-1 assume !(0 == ~e_wl~0); 3172#L464-1 assume !(1 == ~wl_pc~0); 3173#L476 assume !(2 == ~wl_pc~0); 3421#L477 assume !(1 == ~c1_pc~0); 3431#L487 assume !(1 == ~c2_pc~0); 3389#L496 assume !(1 == ~wb_pc~0); 3350#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 3194#L514-1 assume !(1 == ~e_e~0); 3205#L519-1 assume !(1 == ~e_f~0); 3219#L524-1 assume !(1 == ~e_g~0); 3220#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3088#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3089#L676-1 [2021-08-27 16:31:36,775 INFO L793 eck$LassoCheckResult]: Loop: 3089#L676-1 assume !false; 3099#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3141#L381 assume !false; 3206#L299 assume !(0 == ~wl_st~0); 3207#L303 assume !(0 == ~c1_st~0); 3331#L306 assume !(0 == ~c2_st~0); 3312#L309 assume !(0 == ~wb_st~0); 3313#L312 assume !(0 == ~r_st~0); 3335#L397 start_simulation_~kernel_st~0 := 2; 3223#L552 assume !(1 == ~c_req_up~0); 3224#L552-2 start_simulation_~kernel_st~0 := 3; 3264#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 3477#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3475#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3476#L574-1 assume !(0 == ~e_c~0); 3471#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3472#L584-1 assume 1 == ~wl_pc~0; 3466#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3465#L597 assume !(1 == ~c1_pc~0); 3460#L607 assume !(1 == ~c2_pc~0); 3459#L616 assume !(1 == ~wb_pc~0); 3453#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 3328#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3546#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3543#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3288#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3221#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3162#L659-1 assume 0 == ~wl_st~0; 3089#L676-1 [2021-08-27 16:31:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:36,776 INFO L82 PathProgramCache]: Analyzing trace with hash 198346713, now seen corresponding path program 1 times [2021-08-27 16:31:36,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:36,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784693351] [2021-08-27 16:31:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:36,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:36,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:36,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784693351] [2021-08-27 16:31:36,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784693351] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:36,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:36,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:36,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134346112] [2021-08-27 16:31:36,800 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:36,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:36,800 INFO L82 PathProgramCache]: Analyzing trace with hash 243706225, now seen corresponding path program 1 times [2021-08-27 16:31:36,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:36,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648579154] [2021-08-27 16:31:36,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:36,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:36,804 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:36,809 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:37,081 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:37,081 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:37,081 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:37,081 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:37,082 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:31:37,082 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,082 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:37,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:37,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2021-08-27 16:31:37,082 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:37,082 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:37,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,350 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:37,350 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:31:37,350 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:37,377 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:37,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 16:31:37,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:37,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:37,420 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:37,421 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet10=0} Honda state: {ULTIMATE.start_eval_#t~nondet10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:37,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:37,443 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:37,452 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:37,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 16:31:37,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:37,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:37,476 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:37,477 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:37,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:37,496 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:37,497 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:37,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 16:31:37,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:37,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:37,509 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:37,510 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:37,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:37,534 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:37,535 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:37,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 16:31:37,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:37,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:37,545 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:37,545 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:37,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:37,570 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:37,571 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:37,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 16:31:37,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:37,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:37,583 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:37,583 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet9=0} Honda state: {ULTIMATE.start_eval_#t~nondet9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:37,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:37,605 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:37,606 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:37,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 16:31:37,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:37,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:37,637 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:37,637 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:37,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:37,659 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:37,660 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:37,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 16:31:37,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:37,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:37,672 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:37,672 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:37,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:37,713 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:37,717 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:37,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 16:31:37,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:37,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:37,744 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:37,744 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:37,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:37,766 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:37,767 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:37,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 16:31:37,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:37,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:37,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:37,799 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:37,800 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:37,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 16:31:37,803 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:31:37,803 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:37,828 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:31:37,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:37,860 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:37,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:37,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:37,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:37,860 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:31:37,860 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:37,860 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:37,860 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:37,860 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2021-08-27 16:31:37,860 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:37,860 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:37,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:37,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:38,124 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:38,124 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:31:38,124 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:38,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:38,141 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:38,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 16:31:38,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:38,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:38,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:38,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:38,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:38,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:38,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:38,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:38,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:38,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-08-27 16:31:38,208 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:38,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:38,208 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:38,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 16:31:38,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:38,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:38,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:38,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:38,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:38,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:38,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:38,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:38,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:38,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-08-27 16:31:38,236 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:38,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:38,236 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:38,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 16:31:38,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:38,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:38,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:38,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:38,245 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:31:38,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:38,246 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:31:38,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:38,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:38,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-08-27 16:31:38,263 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:38,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:38,263 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:38,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 16:31:38,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:38,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:38,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:38,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:38,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:38,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:38,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:38,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:38,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:38,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:38,301 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:38,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:38,302 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:38,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 16:31:38,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:38,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:38,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:38,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:38,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:38,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:38,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:38,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:38,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:38,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:38,356 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:38,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:38,357 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:38,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-27 16:31:38,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:38,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:38,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:38,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:38,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:38,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:38,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:38,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:38,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:38,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:38,392 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:38,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:38,393 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:38,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-27 16:31:38,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:38,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:38,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:38,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:38,401 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:31:38,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:38,402 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:31:38,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:38,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:38,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:38,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:38,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:38,435 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:38,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:38,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:38,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:38,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:38,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:38,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:38,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:38,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:38,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-27 16:31:38,461 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:31:38,463 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:31:38,463 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:31:38,463 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:38,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:38,464 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:38,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-27 16:31:38,465 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:31:38,465 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:31:38,465 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:31:38,466 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -2*~e_c~0 + 3 Supporting invariants [] [2021-08-27 16:31:38,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:38,483 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:31:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:38,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:31:38,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:38,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:31:38,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:38,759 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-27 16:31:38,759 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:38,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:38,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 995 states and 1726 transitions. Complement of second has 7 states. [2021-08-27 16:31:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 16:31:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2021-08-27 16:31:38,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2021-08-27 16:31:38,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:38,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2021-08-27 16:31:38,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:38,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2021-08-27 16:31:38,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:38,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 995 states and 1726 transitions. [2021-08-27 16:31:38,824 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 562 [2021-08-27 16:31:38,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 995 states to 991 states and 1718 transitions. [2021-08-27 16:31:38,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 640 [2021-08-27 16:31:38,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 643 [2021-08-27 16:31:38,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 991 states and 1718 transitions. [2021-08-27 16:31:38,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:38,830 INFO L681 BuchiCegarLoop]: Abstraction has 991 states and 1718 transitions. [2021-08-27 16:31:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states and 1718 transitions. [2021-08-27 16:31:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 531. [2021-08-27 16:31:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 531 states have (on average 1.7401129943502824) internal successors, (924), 530 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 924 transitions. [2021-08-27 16:31:38,839 INFO L704 BuchiCegarLoop]: Abstraction has 531 states and 924 transitions. [2021-08-27 16:31:38,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:38,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:38,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:38,840 INFO L87 Difference]: Start difference. First operand 531 states and 924 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:38,866 INFO L93 Difference]: Finished difference Result 805 states and 1385 transitions. [2021-08-27 16:31:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:38,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 805 states and 1385 transitions. [2021-08-27 16:31:38,871 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 461 [2021-08-27 16:31:38,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 805 states to 636 states and 1094 transitions. [2021-08-27 16:31:38,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 541 [2021-08-27 16:31:38,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 546 [2021-08-27 16:31:38,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 636 states and 1094 transitions. [2021-08-27 16:31:38,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:38,874 INFO L681 BuchiCegarLoop]: Abstraction has 636 states and 1094 transitions. [2021-08-27 16:31:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states and 1094 transitions. [2021-08-27 16:31:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 449. [2021-08-27 16:31:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 449 states have (on average 1.730512249443207) internal successors, (777), 448 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 777 transitions. [2021-08-27 16:31:38,882 INFO L704 BuchiCegarLoop]: Abstraction has 449 states and 777 transitions. [2021-08-27 16:31:38,882 INFO L587 BuchiCegarLoop]: Abstraction has 449 states and 777 transitions. [2021-08-27 16:31:38,882 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 16:31:38,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 777 transitions. [2021-08-27 16:31:38,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 281 [2021-08-27 16:31:38,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:38,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:38,884 INFO L842 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] [2021-08-27 16:31:38,884 INFO L843 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] [2021-08-27 16:31:38,885 INFO L791 eck$LassoCheckResult]: Stem: 6430#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6338#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 6339#L408 assume !(1 == ~c_req_up~0); 6425#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6439#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6440#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6467#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6466#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6465#L439-1 assume !(0 == ~e_f~0); 6223#L444-1 assume !(0 == ~e_g~0); 6224#L449-1 assume !(0 == ~e_e~0); 6379#L454-1 assume !(0 == ~e_c~0); 6380#L459-1 assume !(0 == ~e_wl~0); 6293#L464-1 assume !(1 == ~wl_pc~0); 6294#L476 assume !(2 == ~wl_pc~0); 6291#L477 assume !(1 == ~c1_pc~0); 6268#L487 assume !(1 == ~c2_pc~0); 6270#L496 assume !(1 == ~wb_pc~0); 6314#L505 assume !(1 == ~e_c~0); 6315#L514-1 assume !(1 == ~e_e~0); 6443#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6340#L524-1 assume !(1 == ~e_g~0); 6341#L529-1 assume !(1 == ~e_c~0); 6210#L534-1 assume !(1 == ~e_wl~0); 6211#L676-1 [2021-08-27 16:31:38,885 INFO L793 eck$LassoCheckResult]: Loop: 6211#L676-1 assume !false; 6220#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 6262#L381 assume !false; 6328#L299 assume !(0 == ~wl_st~0); 6329#L303 assume !(0 == ~c1_st~0); 6432#L306 assume !(0 == ~c2_st~0); 6420#L309 assume !(0 == ~wb_st~0); 6421#L312 assume !(0 == ~r_st~0); 6436#L397 start_simulation_~kernel_st~0 := 2; 6437#L552 assume !(1 == ~c_req_up~0); 6476#L552-2 start_simulation_~kernel_st~0 := 3; 6475#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 6267#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6225#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6226#L574-1 assume !(0 == ~e_c~0); 6247#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6248#L584-1 assume !(1 == ~wl_pc~0); 6357#L596 assume !(2 == ~wl_pc~0); 6359#L597 assume !(1 == ~c1_pc~0); 6302#L607 assume !(1 == ~c2_pc~0); 6303#L616 assume !(1 == ~wb_pc~0); 6396#L625 assume !(1 == ~e_c~0); 6383#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6371#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6372#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6429#L649-1 assume !(1 == ~e_c~0); 6342#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6283#L659-1 assume 0 == ~wl_st~0; 6211#L676-1 [2021-08-27 16:31:38,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2021-08-27 16:31:38,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:38,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963685676] [2021-08-27 16:31:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:38,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:38,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:38,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963685676] [2021-08-27 16:31:38,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963685676] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:38,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:38,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:31:38,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632495364] [2021-08-27 16:31:38,908 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:38,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1726992066, now seen corresponding path program 1 times [2021-08-27 16:31:38,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:38,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230342446] [2021-08-27 16:31:38,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:38,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:38,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:38,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230342446] [2021-08-27 16:31:38,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230342446] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:38,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:38,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:31:38,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367337954] [2021-08-27 16:31:38,921 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:38,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:38,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:31:38,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:31:38,922 INFO L87 Difference]: Start difference. First operand 449 states and 777 transitions. cyclomatic complexity: 331 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:39,011 INFO L93 Difference]: Finished difference Result 561 states and 961 transitions. [2021-08-27 16:31:39,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 16:31:39,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 961 transitions. [2021-08-27 16:31:39,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 338 [2021-08-27 16:31:39,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 561 states and 961 transitions. [2021-08-27 16:31:39,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 451 [2021-08-27 16:31:39,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 451 [2021-08-27 16:31:39,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 961 transitions. [2021-08-27 16:31:39,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:39,017 INFO L681 BuchiCegarLoop]: Abstraction has 561 states and 961 transitions. [2021-08-27 16:31:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 961 transitions. [2021-08-27 16:31:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 552. [2021-08-27 16:31:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 552 states have (on average 1.7228260869565217) internal successors, (951), 551 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 951 transitions. [2021-08-27 16:31:39,023 INFO L704 BuchiCegarLoop]: Abstraction has 552 states and 951 transitions. [2021-08-27 16:31:39,023 INFO L587 BuchiCegarLoop]: Abstraction has 552 states and 951 transitions. [2021-08-27 16:31:39,023 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 16:31:39,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 552 states and 951 transitions. [2021-08-27 16:31:39,025 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 336 [2021-08-27 16:31:39,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:39,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:39,026 INFO L842 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] [2021-08-27 16:31:39,026 INFO L843 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] [2021-08-27 16:31:39,026 INFO L791 eck$LassoCheckResult]: Stem: 7460#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 7363#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 7364#L408 assume !(1 == ~c_req_up~0); 7453#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7525#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7524#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7523#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7522#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 7379#L439-1 assume !(0 == ~e_f~0); 7246#L444-1 assume !(0 == ~e_g~0); 7247#L449-1 assume !(0 == ~e_e~0); 7402#L454-1 assume !(0 == ~e_c~0); 7403#L459-1 assume !(0 == ~e_wl~0); 7319#L464-1 assume !(1 == ~wl_pc~0); 7320#L476 assume !(2 == ~wl_pc~0); 7317#L477 assume !(1 == ~c1_pc~0); 7294#L487 assume !(1 == ~c2_pc~0); 7296#L496 assume !(1 == ~wb_pc~0); 7549#L505 assume !(1 == ~e_c~0); 7548#L514-1 assume !(1 == ~e_e~0); 7547#L519-1 assume !(1 == ~e_f~0); 7365#L524-1 assume !(1 == ~e_g~0); 7366#L529-1 assume !(1 == ~e_c~0); 7231#L534-1 assume !(1 == ~e_wl~0); 7232#L676-1 [2021-08-27 16:31:39,026 INFO L793 eck$LassoCheckResult]: Loop: 7232#L676-1 assume !false; 7243#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 7287#L381 assume !false; 7353#L299 assume !(0 == ~wl_st~0); 7354#L303 assume !(0 == ~c1_st~0); 7465#L306 assume !(0 == ~c2_st~0); 7447#L309 assume !(0 == ~wb_st~0); 7448#L312 assume !(0 == ~r_st~0); 7469#L397 start_simulation_~kernel_st~0 := 2; 7370#L552 assume !(1 == ~c_req_up~0); 7371#L552-2 start_simulation_~kernel_st~0 := 3; 7281#L564 assume !(0 == ~e_f~0); 7282#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7625#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7624#L574-1 assume !(0 == ~e_c~0); 7604#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7584#L584-1 assume !(1 == ~wl_pc~0); 7585#L596 assume !(2 == ~wl_pc~0); 7749#L597 assume !(1 == ~c1_pc~0); 7747#L607 assume !(1 == ~c2_pc~0); 7744#L616 assume !(1 == ~wb_pc~0); 7743#L625 assume !(1 == ~e_c~0); 7742#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7741#L639-1 assume !(1 == ~e_f~0); 7740#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7739#L649-1 assume !(1 == ~e_c~0); 7738#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7309#L659-1 assume 0 == ~wl_st~0; 7232#L676-1 [2021-08-27 16:31:39,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2021-08-27 16:31:39,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:39,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437757696] [2021-08-27 16:31:39,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:39,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:39,032 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:39,038 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash 981474370, now seen corresponding path program 1 times [2021-08-27 16:31:39,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:39,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817164630] [2021-08-27 16:31:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:39,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:39,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:39,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817164630] [2021-08-27 16:31:39,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817164630] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:39,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:39,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:31:39,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874512804] [2021-08-27 16:31:39,050 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:39,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:39,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:39,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:39,050 INFO L87 Difference]: Start difference. First operand 552 states and 951 transitions. cyclomatic complexity: 402 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:39,071 INFO L93 Difference]: Finished difference Result 807 states and 1374 transitions. [2021-08-27 16:31:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:39,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 807 states and 1374 transitions. [2021-08-27 16:31:39,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 530 [2021-08-27 16:31:39,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 807 states to 807 states and 1374 transitions. [2021-08-27 16:31:39,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 637 [2021-08-27 16:31:39,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 637 [2021-08-27 16:31:39,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 807 states and 1374 transitions. [2021-08-27 16:31:39,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:39,079 INFO L681 BuchiCegarLoop]: Abstraction has 807 states and 1374 transitions. [2021-08-27 16:31:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states and 1374 transitions. [2021-08-27 16:31:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2021-08-27 16:31:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 807 states have (on average 1.7026022304832713) internal successors, (1374), 806 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1374 transitions. [2021-08-27 16:31:39,088 INFO L704 BuchiCegarLoop]: Abstraction has 807 states and 1374 transitions. [2021-08-27 16:31:39,088 INFO L587 BuchiCegarLoop]: Abstraction has 807 states and 1374 transitions. [2021-08-27 16:31:39,088 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 16:31:39,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 807 states and 1374 transitions. [2021-08-27 16:31:39,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 530 [2021-08-27 16:31:39,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:39,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:39,091 INFO L842 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] [2021-08-27 16:31:39,091 INFO L843 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] [2021-08-27 16:31:39,091 INFO L791 eck$LassoCheckResult]: Stem: 8839#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 8726#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 8727#L408 assume !(1 == ~c_req_up~0); 8662#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8958#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8957#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8956#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8955#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8746#L439-1 assume !(0 == ~e_f~0); 8612#L444-1 assume !(0 == ~e_g~0); 8613#L449-1 assume !(0 == ~e_e~0); 8774#L454-1 assume !(0 == ~e_c~0); 8775#L459-1 assume !(0 == ~e_wl~0); 8982#L464-1 assume !(1 == ~wl_pc~0); 8979#L476 assume !(2 == ~wl_pc~0); 8974#L477 assume !(1 == ~c1_pc~0); 8970#L487 assume !(1 == ~c2_pc~0); 8966#L496 assume !(1 == ~wb_pc~0); 8962#L505 assume !(1 == ~e_c~0); 8961#L514-1 assume !(1 == ~e_e~0); 8960#L519-1 assume !(1 == ~e_f~0); 8732#L524-1 assume !(1 == ~e_g~0); 8733#L529-1 assume !(1 == ~e_c~0); 8596#L534-1 assume !(1 == ~e_wl~0); 8597#L676-1 [2021-08-27 16:31:39,091 INFO L793 eck$LassoCheckResult]: Loop: 8597#L676-1 assume !false; 9029#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 9315#L381 assume !false; 9313#L299 assume !(0 == ~wl_st~0); 8843#L303 assume !(0 == ~c1_st~0); 8844#L306 assume !(0 == ~c2_st~0); 8827#L309 assume !(0 == ~wb_st~0); 8829#L312 assume !(0 == ~r_st~0); 8848#L397 start_simulation_~kernel_st~0 := 2; 8734#L552 assume !(1 == ~c_req_up~0); 8735#L552-2 start_simulation_~kernel_st~0 := 3; 8646#L564 assume !(0 == ~e_f~0); 8647#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 9336#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 8850#L574-1 assume !(0 == ~e_c~0); 8851#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 8832#L584-1 assume 1 == ~wl_pc~0; 8755#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 8756#L597 assume !(1 == ~c1_pc~0); 9301#L607 assume !(1 == ~c2_pc~0); 9298#L616 assume !(1 == ~wb_pc~0); 8841#L625 assume !(1 == ~e_c~0); 8778#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 8779#L639-1 assume !(1 == ~e_f~0); 9242#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 9034#L649-1 assume !(1 == ~e_c~0); 9035#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 9030#L659-1 assume 0 == ~wl_st~0; 8597#L676-1 [2021-08-27 16:31:39,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:39,092 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 3 times [2021-08-27 16:31:39,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:39,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541797291] [2021-08-27 16:31:39,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:39,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:39,096 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:39,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:39,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:39,103 INFO L82 PathProgramCache]: Analyzing trace with hash 432214649, now seen corresponding path program 1 times [2021-08-27 16:31:39,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:39,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089919633] [2021-08-27 16:31:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:39,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:39,106 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:39,108 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash -508129585, now seen corresponding path program 1 times [2021-08-27 16:31:39,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:39,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668617311] [2021-08-27 16:31:39,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:39,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:39,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:39,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668617311] [2021-08-27 16:31:39,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668617311] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:39,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:39,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:39,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991105620] [2021-08-27 16:31:39,284 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:39,284 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:39,284 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:39,284 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:39,284 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:31:39,284 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:39,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:39,284 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:39,284 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2021-08-27 16:31:39,285 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:39,285 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:39,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,536 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:39,536 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:31:39,536 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:39,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:39,538 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:39,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-27 16:31:39,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:39,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:39,548 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:39,548 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:39,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:39,563 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:39,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:39,564 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:39,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-27 16:31:39,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:39,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:39,580 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:39,580 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:39,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:39,598 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:39,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:39,598 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:39,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-27 16:31:39,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:39,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:39,612 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:39,612 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:39,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:39,630 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:39,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:39,631 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:39,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-27 16:31:39,633 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:39,633 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:39,640 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:39,640 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet10=0} Honda state: {ULTIMATE.start_eval_#t~nondet10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:39,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-08-27 16:31:39,656 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:39,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:39,657 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:39,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-27 16:31:39,659 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:39,659 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:39,666 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:39,666 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:39,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-08-27 16:31:39,682 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:39,683 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:39,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 16:31:39,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:39,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:39,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:39,724 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:39,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:39,725 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:39,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-27 16:31:39,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:31:39,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:39,735 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:31:39,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:39,753 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:39,753 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:39,753 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:39,753 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:39,753 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:31:39,753 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:39,754 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:39,754 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:39,754 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2021-08-27 16:31:39,754 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:39,754 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:39,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:39,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:40,039 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:40,039 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:31:40,040 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:40,257 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:40,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-27 16:31:40,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:40,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:40,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:40,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:40,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:40,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:40,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:40,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:40,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:40,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:40,300 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:40,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:40,301 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:40,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-27 16:31:40,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:40,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:40,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:40,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:40,310 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:31:40,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:40,311 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:31:40,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:40,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:40,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:40,342 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:40,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:40,343 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:40,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-27 16:31:40,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:40,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:40,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:40,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:40,352 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:31:40,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:40,353 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:31:40,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:40,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:40,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:40,385 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:40,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:40,386 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:40,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-27 16:31:40,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:40,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:40,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:40,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:40,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:40,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:40,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:40,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:40,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:31:40,412 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:31:40,412 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:31:40,412 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:40,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:40,413 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:40,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-27 16:31:40,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:31:40,415 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:31:40,415 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:31:40,415 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2021-08-27 16:31:40,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:40,438 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:31:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:40,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:31:40,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:40,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:31:40,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:40,765 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-27 16:31:40,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 807 states and 1374 transitions. cyclomatic complexity: 570 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:40,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 807 states and 1374 transitions. cyclomatic complexity: 570. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2879 states and 4876 transitions. Complement of second has 5 states. [2021-08-27 16:31:40,858 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 [2021-08-27 16:31:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2021-08-27 16:31:40,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 28 letters. [2021-08-27 16:31:40,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:40,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 52 letters. Loop has 28 letters. [2021-08-27 16:31:40,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:40,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 56 letters. [2021-08-27 16:31:40,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:40,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2879 states and 4876 transitions. [2021-08-27 16:31:40,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:40,889 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1560 [2021-08-27 16:31:40,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2879 states to 2879 states and 4876 transitions. [2021-08-27 16:31:40,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1670 [2021-08-27 16:31:40,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1687 [2021-08-27 16:31:40,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2879 states and 4876 transitions. [2021-08-27 16:31:40,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:40,901 INFO L681 BuchiCegarLoop]: Abstraction has 2879 states and 4876 transitions. [2021-08-27 16:31:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states and 4876 transitions. [2021-08-27 16:31:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2157. [2021-08-27 16:31:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2157 states have (on average 1.6917014371812702) internal successors, (3649), 2156 states have internal predecessors, (3649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3649 transitions. [2021-08-27 16:31:40,929 INFO L704 BuchiCegarLoop]: Abstraction has 2157 states and 3649 transitions. [2021-08-27 16:31:40,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:40,930 INFO L87 Difference]: Start difference. First operand 2157 states and 3649 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:40,956 INFO L93 Difference]: Finished difference Result 2157 states and 3613 transitions. [2021-08-27 16:31:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:40,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2157 states and 3613 transitions. [2021-08-27 16:31:40,964 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1030 [2021-08-27 16:31:40,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2157 states to 2157 states and 3613 transitions. [2021-08-27 16:31:40,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1140 [2021-08-27 16:31:40,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1140 [2021-08-27 16:31:40,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2157 states and 3613 transitions. [2021-08-27 16:31:40,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:40,973 INFO L681 BuchiCegarLoop]: Abstraction has 2157 states and 3613 transitions. [2021-08-27 16:31:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states and 3613 transitions. [2021-08-27 16:31:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2157. [2021-08-27 16:31:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2157 states have (on average 1.6750115901715346) internal successors, (3613), 2156 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3613 transitions. [2021-08-27 16:31:40,996 INFO L704 BuchiCegarLoop]: Abstraction has 2157 states and 3613 transitions. [2021-08-27 16:31:40,996 INFO L587 BuchiCegarLoop]: Abstraction has 2157 states and 3613 transitions. [2021-08-27 16:31:40,996 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 16:31:40,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2157 states and 3613 transitions. [2021-08-27 16:31:41,002 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1030 [2021-08-27 16:31:41,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:41,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:41,003 INFO L842 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] [2021-08-27 16:31:41,003 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:41,003 INFO L791 eck$LassoCheckResult]: Stem: 17051#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 16909#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 16910#L408 assume !(1 == ~c_req_up~0); 16843#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 17066#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 17067#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16971#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16972#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16930#L439-1 assume !(0 == ~e_f~0); 16931#L444-1 assume !(0 == ~e_g~0); 17032#L449-1 assume !(0 == ~e_e~0); 17033#L454-1 assume !(0 == ~e_c~0); 17129#L459-1 assume !(0 == ~e_wl~0); 17128#L464-1 assume !(1 == ~wl_pc~0); 17126#L476 assume !(2 == ~wl_pc~0); 17124#L477 assume !(1 == ~c1_pc~0); 17122#L487 assume !(1 == ~c2_pc~0); 17120#L496 assume !(1 == ~wb_pc~0); 17117#L505 assume !(1 == ~e_c~0); 17115#L514-1 assume !(1 == ~e_e~0); 17113#L519-1 assume !(1 == ~e_f~0); 17112#L524-1 assume !(1 == ~e_g~0); 17072#L529-1 assume !(1 == ~e_c~0); 16775#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 16776#L676-1 [2021-08-27 16:31:41,003 INFO L793 eck$LassoCheckResult]: Loop: 16776#L676-1 assume !false; 18689#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 18687#L381 assume !false; 18686#L299 assume 0 == ~wl_st~0; 18685#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 18683#L325 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 18680#L58 assume 0 == ~wl_pc~0; 18607#L71 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 18602#L321 assume !(0 == ~c1_st~0); 18577#L336 assume !(0 == ~c2_st~0); 18574#L351 assume !(0 == ~wb_st~0); 18508#L366 assume !(0 == ~r_st~0); 18049#L381 assume !false; 18503#L299 assume !(0 == ~wl_st~0); 18504#L303 assume !(0 == ~c1_st~0); 18499#L306 assume !(0 == ~c2_st~0); 18500#L309 assume !(0 == ~wb_st~0); 18493#L312 assume !(0 == ~r_st~0); 18495#L397 start_simulation_~kernel_st~0 := 2; 16917#L552 assume !(1 == ~c_req_up~0); 16918#L552-2 start_simulation_~kernel_st~0 := 3; 18744#L564 assume !(0 == ~e_f~0); 18739#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 18737#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 18736#L574-1 assume !(0 == ~e_c~0); 18735#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 18734#L584-1 assume 1 == ~wl_pc~0; 18732#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 18729#L597 assume !(1 == ~c1_pc~0); 18724#L607 assume !(1 == ~c2_pc~0); 18721#L616 assume !(1 == ~wb_pc~0); 18720#L625 assume !(1 == ~e_c~0); 18719#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 18718#L639-1 assume !(1 == ~e_f~0); 18716#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 18715#L649-1 assume !(1 == ~e_c~0); 18710#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 18708#L659-1 assume 0 == ~wl_st~0; 16776#L676-1 [2021-08-27 16:31:41,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2021-08-27 16:31:41,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:41,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432745100] [2021-08-27 16:31:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:41,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:41,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:41,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432745100] [2021-08-27 16:31:41,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432745100] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:41,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:41,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:41,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790326484] [2021-08-27 16:31:41,020 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:41,021 INFO L82 PathProgramCache]: Analyzing trace with hash 254830061, now seen corresponding path program 1 times [2021-08-27 16:31:41,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:41,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340520909] [2021-08-27 16:31:41,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:41,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:41,024 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:41,027 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:41,264 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:41,265 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:41,265 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:41,265 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:41,265 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:31:41,265 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:41,265 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:41,265 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:41,265 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration11_Loop [2021-08-27 16:31:41,265 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:41,265 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:41,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,506 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:41,506 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:31:41,506 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:41,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:41,507 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:41,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-27 16:31:41,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:41,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:41,530 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:41,530 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:41,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:41,546 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:41,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:41,547 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:41,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-27 16:31:41,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:41,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:41,569 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:41,570 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:41,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:41,584 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:41,585 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:41,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-27 16:31:41,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:41,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:41,608 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:41,608 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:41,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:41,624 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:41,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:41,625 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:41,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-27 16:31:41,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:41,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:41,647 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:41,648 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:41,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:41,663 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:41,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:41,663 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:41,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-27 16:31:41,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:41,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:41,686 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:41,686 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:41,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:41,701 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:41,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:41,702 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:41,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-27 16:31:41,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:41,704 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:41,725 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:41,725 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:41,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:41,740 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:41,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:41,741 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:41,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-08-27 16:31:41,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:41,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:41,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:41,778 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:41,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:41,779 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:41,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-08-27 16:31:41,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:31:41,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:41,789 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:31:41,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:41,805 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:41,805 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:41,805 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:41,805 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:41,805 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:31:41,805 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:41,805 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:41,805 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:41,805 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration11_Loop [2021-08-27 16:31:41,805 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:41,806 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:41,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:41,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:42,077 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:42,078 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:31:42,078 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:42,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:42,078 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:42,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-08-27 16:31:42,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:42,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:42,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:42,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:42,086 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:31:42,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:42,087 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:31:42,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:42,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:42,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:42,117 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:42,118 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:42,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-08-27 16:31:42,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:42,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:42,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:42,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:42,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:42,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:42,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:42,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:42,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:42,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:42,156 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:42,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:42,157 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:42,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-08-27 16:31:42,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:42,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:42,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:42,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:42,164 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:31:42,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:42,165 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:31:42,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:42,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:42,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:42,181 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:42,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:42,182 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:42,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-08-27 16:31:42,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:42,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:42,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:42,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:42,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:42,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:42,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:42,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:42,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:42,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:42,207 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:42,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:42,208 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:42,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-08-27 16:31:42,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:42,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:42,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:42,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:42,215 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:31:42,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:42,216 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:31:42,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:42,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:42,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-08-27 16:31:42,246 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:42,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:42,247 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:42,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-08-27 16:31:42,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:42,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:42,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:42,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:42,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:42,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:42,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:42,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:42,271 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:31:42,272 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:31:42,272 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:31:42,273 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:42,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:42,273 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:42,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-08-27 16:31:42,275 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:31:42,275 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:31:42,275 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:31:42,275 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2021-08-27 16:31:42,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:42,291 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:31:42,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:42,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:31:42,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:42,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:31:42,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:42,642 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-27 16:31:42,642 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2157 states and 3613 transitions. cyclomatic complexity: 1465 Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:42,704 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2157 states and 3613 transitions. cyclomatic complexity: 1465. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 4282 states and 7173 transitions. Complement of second has 7 states. [2021-08-27 16:31:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 16:31:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2021-08-27 16:31:42,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 370 transitions. Stem has 24 letters. Loop has 38 letters. [2021-08-27 16:31:42,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:42,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 370 transitions. Stem has 62 letters. Loop has 38 letters. [2021-08-27 16:31:42,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:42,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 370 transitions. Stem has 24 letters. Loop has 76 letters. [2021-08-27 16:31:42,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:42,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4282 states and 7173 transitions. [2021-08-27 16:31:42,721 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1969 [2021-08-27 16:31:42,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4282 states to 4227 states and 7095 transitions. [2021-08-27 16:31:42,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2202 [2021-08-27 16:31:42,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2210 [2021-08-27 16:31:42,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4227 states and 7095 transitions. [2021-08-27 16:31:42,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:42,737 INFO L681 BuchiCegarLoop]: Abstraction has 4227 states and 7095 transitions. [2021-08-27 16:31:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states and 7095 transitions. [2021-08-27 16:31:42,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 3465. [2021-08-27 16:31:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3465 states have (on average 1.6810966810966812) internal successors, (5825), 3464 states have internal predecessors, (5825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 5825 transitions. [2021-08-27 16:31:42,829 INFO L704 BuchiCegarLoop]: Abstraction has 3465 states and 5825 transitions. [2021-08-27 16:31:42,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:42,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:31:42,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:31:42,829 INFO L87 Difference]: Start difference. First operand 3465 states and 5825 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:42,903 INFO L93 Difference]: Finished difference Result 5316 states and 8926 transitions. [2021-08-27 16:31:42,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 16:31:42,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5316 states and 8926 transitions. [2021-08-27 16:31:42,917 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 2292 [2021-08-27 16:31:42,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5316 states to 5316 states and 8926 transitions. [2021-08-27 16:31:42,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2664 [2021-08-27 16:31:42,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2664 [2021-08-27 16:31:42,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5316 states and 8926 transitions. [2021-08-27 16:31:42,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:42,934 INFO L681 BuchiCegarLoop]: Abstraction has 5316 states and 8926 transitions. [2021-08-27 16:31:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states and 8926 transitions. [2021-08-27 16:31:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4687. [2021-08-27 16:31:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 4687 states have (on average 1.6867932579475144) internal successors, (7906), 4686 states have internal predecessors, (7906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 7906 transitions. [2021-08-27 16:31:42,981 INFO L704 BuchiCegarLoop]: Abstraction has 4687 states and 7906 transitions. [2021-08-27 16:31:42,981 INFO L587 BuchiCegarLoop]: Abstraction has 4687 states and 7906 transitions. [2021-08-27 16:31:42,981 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 16:31:42,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4687 states and 7906 transitions. [2021-08-27 16:31:42,989 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1893 [2021-08-27 16:31:42,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:42,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:42,989 INFO L842 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] [2021-08-27 16:31:42,989 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:42,990 INFO L791 eck$LassoCheckResult]: Stem: 32478#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 32344#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 32345#L408 assume !(1 == ~c_req_up~0); 32276#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 32491#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 32492#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 32396#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 32397#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 32358#L439-1 assume !(0 == ~e_f~0); 32359#L444-1 assume !(0 == ~e_g~0); 32499#L449-1 assume !(0 == ~e_e~0); 32384#L454-1 assume !(0 == ~e_c~0); 32385#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 32299#L464-1 assume !(1 == ~wl_pc~0); 32300#L476 assume !(2 == ~wl_pc~0); 33223#L477 assume !(1 == ~c1_pc~0); 33775#L487 assume !(1 == ~c2_pc~0); 33771#L496 assume !(1 == ~wb_pc~0); 33764#L505 assume !(1 == ~e_c~0); 33763#L514-1 assume !(1 == ~e_e~0); 33762#L519-1 assume !(1 == ~e_f~0); 33761#L524-1 assume !(1 == ~e_g~0); 33760#L529-1 assume !(1 == ~e_c~0); 33758#L534-1 assume !(1 == ~e_wl~0); 32211#L676-1 assume !false; 35444#L546 [2021-08-27 16:31:42,990 INFO L793 eck$LassoCheckResult]: Loop: 35444#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 36415#L381 assume !false; 36412#L299 assume 0 == ~wl_st~0; 36409#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 36405#L325 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 36375#L58 assume 0 == ~wl_pc~0; 36361#L71 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 36358#L321 assume !(0 == ~c1_st~0); 36320#L336 assume !(0 == ~c2_st~0); 36316#L351 assume !(0 == ~wb_st~0); 36311#L366 assume !(0 == ~r_st~0); 36308#L381 assume !false; 36307#L299 assume !(0 == ~wl_st~0); 36306#L303 assume !(0 == ~c1_st~0); 36305#L306 assume !(0 == ~c2_st~0); 36304#L309 assume !(0 == ~wb_st~0); 36302#L312 assume !(0 == ~r_st~0); 36301#L397 start_simulation_~kernel_st~0 := 2; 36147#L552 assume !(1 == ~c_req_up~0); 36148#L552-2 start_simulation_~kernel_st~0 := 3; 36367#L564 assume !(0 == ~e_f~0); 36362#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 36359#L569-1 assume !(0 == ~e_e~0); 36354#L574-1 assume !(0 == ~e_c~0); 36353#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 36349#L584-1 assume 1 == ~wl_pc~0; 36350#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 36294#L597 assume !(1 == ~c1_pc~0); 36438#L607 assume !(1 == ~c2_pc~0); 36433#L616 assume !(1 == ~wb_pc~0); 36431#L625 assume !(1 == ~e_c~0); 36429#L634-1 assume !(1 == ~e_e~0); 36427#L639-1 assume !(1 == ~e_f~0); 36425#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 36423#L649-1 assume !(1 == ~e_c~0); 36421#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 36420#L659-1 assume 0 == ~wl_st~0; 36419#L676-1 assume !false; 35444#L546 [2021-08-27 16:31:42,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:42,990 INFO L82 PathProgramCache]: Analyzing trace with hash -79370950, now seen corresponding path program 1 times [2021-08-27 16:31:42,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:42,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656799303] [2021-08-27 16:31:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:42,991 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:43,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:43,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656799303] [2021-08-27 16:31:43,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656799303] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:43,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:43,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:31:43,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377527880] [2021-08-27 16:31:43,009 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:43,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash -368922987, now seen corresponding path program 1 times [2021-08-27 16:31:43,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:43,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023156572] [2021-08-27 16:31:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:43,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:43,012 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:43,015 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:43,246 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:43,246 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:43,246 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:43,247 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:43,247 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:31:43,247 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:43,247 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:43,247 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:43,247 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration12_Loop [2021-08-27 16:31:43,247 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:43,247 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:43,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,477 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:43,477 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:31:43,477 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:43,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:43,478 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:43,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-08-27 16:31:43,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:43,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:43,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:43,502 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:43,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:43,502 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:43,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-08-27 16:31:43,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:31:43,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:43,526 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:31:43,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:43,541 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:43,541 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:43,541 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:43,541 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:43,541 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:31:43,541 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:43,541 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:43,541 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:43,541 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration12_Loop [2021-08-27 16:31:43,541 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:43,541 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:43,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:43,821 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:43,821 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:31:43,821 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:43,822 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:43,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-08-27 16:31:43,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:43,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:43,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:43,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:43,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:43,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:43,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:43,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:43,846 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:31:43,848 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:31:43,848 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:31:43,848 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:43,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:43,849 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:43,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-08-27 16:31:43,851 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:31:43,851 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:31:43,851 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:31:43,851 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2021-08-27 16:31:43,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:43,866 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:31:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:43,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:31:43,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:43,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:31:43,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:44,224 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-27 16:31:44,224 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4687 states and 7906 transitions. cyclomatic complexity: 3238 Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,296 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4687 states and 7906 transitions. cyclomatic complexity: 3238. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12056 states and 20297 transitions. Complement of second has 7 states. [2021-08-27 16:31:44,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 16:31:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2021-08-27 16:31:44,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 214 transitions. Stem has 25 letters. Loop has 38 letters. [2021-08-27 16:31:44,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:44,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 214 transitions. Stem has 63 letters. Loop has 38 letters. [2021-08-27 16:31:44,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:44,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 214 transitions. Stem has 25 letters. Loop has 76 letters. [2021-08-27 16:31:44,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:44,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12056 states and 20297 transitions. [2021-08-27 16:31:44,329 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 2885 [2021-08-27 16:31:44,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12056 states to 10119 states and 17059 transitions. [2021-08-27 16:31:44,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3672 [2021-08-27 16:31:44,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3688 [2021-08-27 16:31:44,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10119 states and 17059 transitions. [2021-08-27 16:31:44,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:44,355 INFO L681 BuchiCegarLoop]: Abstraction has 10119 states and 17059 transitions. [2021-08-27 16:31:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10119 states and 17059 transitions. [2021-08-27 16:31:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10119 to 8392. [2021-08-27 16:31:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8392 states, 8392 states have (on average 1.6898236415633938) internal successors, (14181), 8391 states have internal predecessors, (14181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8392 states to 8392 states and 14181 transitions. [2021-08-27 16:31:44,540 INFO L704 BuchiCegarLoop]: Abstraction has 8392 states and 14181 transitions. [2021-08-27 16:31:44,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:44,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:31:44,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:31:44,541 INFO L87 Difference]: Start difference. First operand 8392 states and 14181 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:44,612 INFO L93 Difference]: Finished difference Result 11272 states and 18726 transitions. [2021-08-27 16:31:44,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:31:44,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11272 states and 18726 transitions. [2021-08-27 16:31:44,639 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 3138 [2021-08-27 16:31:44,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11272 states to 11272 states and 18726 transitions. [2021-08-27 16:31:44,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3925 [2021-08-27 16:31:44,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3925 [2021-08-27 16:31:44,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11272 states and 18726 transitions. [2021-08-27 16:31:44,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:44,662 INFO L681 BuchiCegarLoop]: Abstraction has 11272 states and 18726 transitions. [2021-08-27 16:31:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11272 states and 18726 transitions. [2021-08-27 16:31:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11272 to 10394. [2021-08-27 16:31:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10394 states, 10394 states have (on average 1.6680777371560516) internal successors, (17338), 10393 states have internal predecessors, (17338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 17338 transitions. [2021-08-27 16:31:44,764 INFO L704 BuchiCegarLoop]: Abstraction has 10394 states and 17338 transitions. [2021-08-27 16:31:44,764 INFO L587 BuchiCegarLoop]: Abstraction has 10394 states and 17338 transitions. [2021-08-27 16:31:44,764 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 16:31:44,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10394 states and 17338 transitions. [2021-08-27 16:31:44,779 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 2993 [2021-08-27 16:31:44,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:44,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:44,780 INFO L842 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] [2021-08-27 16:31:44,780 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:44,780 INFO L791 eck$LassoCheckResult]: Stem: 69094#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 68968#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 68969#L408 assume !(1 == ~c_req_up~0); 69067#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 69068#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 69105#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 69106#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 69095#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 69096#L439-1 assume !(0 == ~e_f~0); 68850#L444-1 assume !(0 == ~e_g~0); 68851#L449-1 assume !(0 == ~e_e~0); 69014#L454-1 assume !(0 == ~e_c~0); 69015#L459-1 assume !(0 == ~e_wl~0); 69139#L464-1 assume !(1 == ~wl_pc~0); 68981#L476 assume !(2 == ~wl_pc~0); 68982#L477 assume !(1 == ~c1_pc~0); 69129#L487 assume !(1 == ~c2_pc~0); 69124#L496 assume !(1 == ~wb_pc~0); 69121#L505 assume !(1 == ~e_c~0); 69120#L514-1 assume !(1 == ~e_e~0); 69119#L519-1 assume !(1 == ~e_f~0); 69118#L524-1 assume !(1 == ~e_g~0); 69112#L529-1 assume !(1 == ~e_c~0); 69113#L534-1 assume !(1 == ~e_wl~0); 73340#L676-1 assume !false; 73341#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 75656#L381 [2021-08-27 16:31:44,780 INFO L793 eck$LassoCheckResult]: Loop: 75656#L381 assume !false; 78367#L299 assume 0 == ~wl_st~0; 78366#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 78364#L325 assume !(0 != eval_~tmp~0); 78365#L321 assume !(0 == ~c1_st~0); 78404#L336 assume !(0 == ~c2_st~0); 78400#L351 assume !(0 == ~wb_st~0); 78372#L366 assume !(0 == ~r_st~0); 75656#L381 [2021-08-27 16:31:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,781 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2021-08-27 16:31:44,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622899235] [2021-08-27 16:31:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:44,786 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:44,791 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1289372155, now seen corresponding path program 1 times [2021-08-27 16:31:44,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256506992] [2021-08-27 16:31:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:44,794 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:44,795 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash 370417651, now seen corresponding path program 1 times [2021-08-27 16:31:44,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602577085] [2021-08-27 16:31:44,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:44,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:44,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602577085] [2021-08-27 16:31:44,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602577085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:44,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:44,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:44,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370567643] [2021-08-27 16:31:44,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:44,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:44,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:44,839 INFO L87 Difference]: Start difference. First operand 10394 states and 17338 transitions. cyclomatic complexity: 6999 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:44,952 INFO L93 Difference]: Finished difference Result 16129 states and 26683 transitions. [2021-08-27 16:31:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:44,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16129 states and 26683 transitions. [2021-08-27 16:31:44,997 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 4724 [2021-08-27 16:31:45,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16129 states to 16129 states and 26683 transitions. [2021-08-27 16:31:45,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5804 [2021-08-27 16:31:45,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5804 [2021-08-27 16:31:45,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16129 states and 26683 transitions. [2021-08-27 16:31:45,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:45,043 INFO L681 BuchiCegarLoop]: Abstraction has 16129 states and 26683 transitions. [2021-08-27 16:31:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16129 states and 26683 transitions. [2021-08-27 16:31:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16129 to 16129. [2021-08-27 16:31:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16129 states, 16129 states have (on average 1.6543493086986174) internal successors, (26683), 16128 states have internal predecessors, (26683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16129 states to 16129 states and 26683 transitions. [2021-08-27 16:31:45,195 INFO L704 BuchiCegarLoop]: Abstraction has 16129 states and 26683 transitions. [2021-08-27 16:31:45,195 INFO L587 BuchiCegarLoop]: Abstraction has 16129 states and 26683 transitions. [2021-08-27 16:31:45,195 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 16:31:45,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16129 states and 26683 transitions. [2021-08-27 16:31:45,228 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 4724 [2021-08-27 16:31:45,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:45,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:45,228 INFO L842 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] [2021-08-27 16:31:45,228 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:45,229 INFO L791 eck$LassoCheckResult]: Stem: 95636#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 95497#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 95498#L408 assume !(1 == ~c_req_up~0); 95429#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 95644#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 95645#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 95553#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 95554#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 95510#L439-1 assume !(0 == ~e_f~0); 95511#L444-1 assume !(0 == ~e_g~0); 95621#L449-1 assume !(0 == ~e_e~0); 95622#L454-1 assume !(0 == ~e_c~0); 95669#L459-1 assume !(0 == ~e_wl~0); 95668#L464-1 assume !(1 == ~wl_pc~0); 95665#L476 assume !(2 == ~wl_pc~0); 95664#L477 assume !(1 == ~c1_pc~0); 95662#L487 assume !(1 == ~c2_pc~0); 95660#L496 assume !(1 == ~wb_pc~0); 95658#L505 assume !(1 == ~e_c~0); 95657#L514-1 assume !(1 == ~e_e~0); 95656#L519-1 assume !(1 == ~e_f~0); 95655#L524-1 assume !(1 == ~e_g~0); 95649#L529-1 assume !(1 == ~e_c~0); 95650#L534-1 assume !(1 == ~e_wl~0); 102087#L676-1 assume !false; 102088#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 105724#L381 [2021-08-27 16:31:45,229 INFO L793 eck$LassoCheckResult]: Loop: 105724#L381 assume !false; 107171#L299 assume 0 == ~wl_st~0; 107168#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 107161#L325 assume !(0 != eval_~tmp~0); 107162#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 107194#L340 assume !(0 != eval_~tmp___0~0); 107192#L336 assume !(0 == ~c2_st~0); 107180#L351 assume !(0 == ~wb_st~0); 107174#L366 assume !(0 == ~r_st~0); 105724#L381 [2021-08-27 16:31:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:45,229 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2021-08-27 16:31:45,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:45,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092707933] [2021-08-27 16:31:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:45,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:45,235 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:45,240 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:45,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 1 times [2021-08-27 16:31:45,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:45,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504156136] [2021-08-27 16:31:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:45,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:45,243 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:45,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:45,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:45,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1452726936, now seen corresponding path program 1 times [2021-08-27 16:31:45,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:45,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067292035] [2021-08-27 16:31:45,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:45,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:45,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:45,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067292035] [2021-08-27 16:31:45,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067292035] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:45,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:45,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:45,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050566806] [2021-08-27 16:31:45,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:45,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:45,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:45,403 INFO L87 Difference]: Start difference. First operand 16129 states and 26683 transitions. cyclomatic complexity: 10609 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:45,479 INFO L93 Difference]: Finished difference Result 24580 states and 40120 transitions. [2021-08-27 16:31:45,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:45,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24580 states and 40120 transitions. [2021-08-27 16:31:45,559 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 7412 [2021-08-27 16:31:45,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24580 states to 24580 states and 40120 transitions. [2021-08-27 16:31:45,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8934 [2021-08-27 16:31:45,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8934 [2021-08-27 16:31:45,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24580 states and 40120 transitions. [2021-08-27 16:31:45,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:45,704 INFO L681 BuchiCegarLoop]: Abstraction has 24580 states and 40120 transitions. [2021-08-27 16:31:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24580 states and 40120 transitions. [2021-08-27 16:31:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24580 to 24580. [2021-08-27 16:31:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24580 states, 24580 states have (on average 1.6322213181448333) internal successors, (40120), 24579 states have internal predecessors, (40120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 40120 transitions. [2021-08-27 16:31:46,063 INFO L704 BuchiCegarLoop]: Abstraction has 24580 states and 40120 transitions. [2021-08-27 16:31:46,064 INFO L587 BuchiCegarLoop]: Abstraction has 24580 states and 40120 transitions. [2021-08-27 16:31:46,064 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 16:31:46,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24580 states and 40120 transitions. [2021-08-27 16:31:46,110 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 7412 [2021-08-27 16:31:46,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:46,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:46,111 INFO L842 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] [2021-08-27 16:31:46,111 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:46,112 INFO L791 eck$LassoCheckResult]: Stem: 136378#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 136219#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 136220#L408 assume !(1 == ~c_req_up~0); 136344#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 136345#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 136388#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 136389#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 136379#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 136380#L439-1 assume !(0 == ~e_f~0); 136098#L444-1 assume !(0 == ~e_g~0); 136099#L449-1 assume !(0 == ~e_e~0); 136272#L454-1 assume !(0 == ~e_c~0); 136273#L459-1 assume !(0 == ~e_wl~0); 136443#L464-1 assume !(1 == ~wl_pc~0); 136442#L476 assume !(2 == ~wl_pc~0); 136435#L477 assume !(1 == ~c1_pc~0); 136434#L487 assume !(1 == ~c2_pc~0); 136423#L496 assume !(1 == ~wb_pc~0); 136422#L505 assume !(1 == ~e_c~0); 136416#L514-1 assume !(1 == ~e_e~0); 136414#L519-1 assume !(1 == ~e_f~0); 136415#L524-1 assume !(1 == ~e_g~0); 139323#L529-1 assume !(1 == ~e_c~0); 139313#L534-1 assume !(1 == ~e_wl~0); 139304#L676-1 assume !false; 139305#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 148347#L381 [2021-08-27 16:31:46,112 INFO L793 eck$LassoCheckResult]: Loop: 148347#L381 assume !false; 148345#L299 assume 0 == ~wl_st~0; 148344#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 148343#L325 assume !(0 != eval_~tmp~0); 148342#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 148335#L340 assume !(0 != eval_~tmp___0~0); 148341#L336 assume !(0 == ~c2_st~0); 148413#L351 assume !(0 == ~wb_st~0); 148353#L366 assume !(0 == ~r_st~0); 148347#L381 [2021-08-27 16:31:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2021-08-27 16:31:46,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672633294] [2021-08-27 16:31:46,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672633294] [2021-08-27 16:31:46,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672633294] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:46,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78046781] [2021-08-27 16:31:46,125 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 2 times [2021-08-27 16:31:46,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128113285] [2021-08-27 16:31:46,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:46,128 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:46,129 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:46,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:46,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:46,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:46,166 INFO L87 Difference]: Start difference. First operand 24580 states and 40120 transitions. cyclomatic complexity: 15595 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:46,306 INFO L93 Difference]: Finished difference Result 24508 states and 39999 transitions. [2021-08-27 16:31:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:46,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24508 states and 39999 transitions. [2021-08-27 16:31:46,373 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 7412 [2021-08-27 16:31:46,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24508 states to 24508 states and 39999 transitions. [2021-08-27 16:31:46,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8866 [2021-08-27 16:31:46,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8866 [2021-08-27 16:31:46,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24508 states and 39999 transitions. [2021-08-27 16:31:46,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:46,440 INFO L681 BuchiCegarLoop]: Abstraction has 24508 states and 39999 transitions. [2021-08-27 16:31:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24508 states and 39999 transitions. [2021-08-27 16:31:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24508 to 24508. [2021-08-27 16:31:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24508 states, 24508 states have (on average 1.6320793210380284) internal successors, (39999), 24507 states have internal predecessors, (39999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24508 states to 24508 states and 39999 transitions. [2021-08-27 16:31:46,753 INFO L704 BuchiCegarLoop]: Abstraction has 24508 states and 39999 transitions. [2021-08-27 16:31:46,753 INFO L587 BuchiCegarLoop]: Abstraction has 24508 states and 39999 transitions. [2021-08-27 16:31:46,753 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 16:31:46,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24508 states and 39999 transitions. [2021-08-27 16:31:46,915 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 7412 [2021-08-27 16:31:46,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:46,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:46,928 INFO L842 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] [2021-08-27 16:31:46,929 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:46,929 INFO L791 eck$LassoCheckResult]: Stem: 185451#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 185309#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 185310#L408 assume !(1 == ~c_req_up~0); 185423#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 185424#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 185459#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 185460#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 185452#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 185453#L439-1 assume !(0 == ~e_f~0); 185192#L444-1 assume !(0 == ~e_g~0); 185193#L449-1 assume !(0 == ~e_e~0); 185358#L454-1 assume !(0 == ~e_c~0); 185359#L459-1 assume !(0 == ~e_wl~0); 185501#L464-1 assume !(1 == ~wl_pc~0); 185321#L476 assume !(2 == ~wl_pc~0); 185322#L477 assume !(1 == ~c1_pc~0); 185491#L487 assume !(1 == ~c2_pc~0); 185486#L496 assume !(1 == ~wb_pc~0); 185483#L505 assume !(1 == ~e_c~0); 185482#L514-1 assume !(1 == ~e_e~0); 185481#L519-1 assume !(1 == ~e_f~0); 185480#L524-1 assume !(1 == ~e_g~0); 185474#L529-1 assume !(1 == ~e_c~0); 185176#L534-1 assume !(1 == ~e_wl~0); 185177#L676-1 assume !false; 191342#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 191343#L381 [2021-08-27 16:31:46,929 INFO L793 eck$LassoCheckResult]: Loop: 191343#L381 assume !false; 207749#L299 assume 0 == ~wl_st~0; 207747#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 207745#L325 assume !(0 != eval_~tmp~0); 207640#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 207638#L340 assume !(0 != eval_~tmp___0~0); 207637#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 207625#L355 assume !(0 != eval_~tmp___1~0); 207636#L351 assume !(0 == ~wb_st~0); 207754#L366 assume !(0 == ~r_st~0); 191343#L381 [2021-08-27 16:31:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2021-08-27 16:31:46,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487590261] [2021-08-27 16:31:46,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:46,935 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:46,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash 560500646, now seen corresponding path program 1 times [2021-08-27 16:31:46,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181592165] [2021-08-27 16:31:46,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:46,964 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:46,966 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:46,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2086482018, now seen corresponding path program 1 times [2021-08-27 16:31:46,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373308730] [2021-08-27 16:31:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:47,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:47,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373308730] [2021-08-27 16:31:47,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373308730] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:47,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:47,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:47,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339611294] [2021-08-27 16:31:47,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:47,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:47,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:47,062 INFO L87 Difference]: Start difference. First operand 24508 states and 39999 transitions. cyclomatic complexity: 15546 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:47,159 INFO L93 Difference]: Finished difference Result 40806 states and 65442 transitions. [2021-08-27 16:31:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:47,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40806 states and 65442 transitions. [2021-08-27 16:31:47,381 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 12598 [2021-08-27 16:31:47,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40806 states to 40806 states and 65442 transitions. [2021-08-27 16:31:47,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14826 [2021-08-27 16:31:47,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14826 [2021-08-27 16:31:47,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40806 states and 65442 transitions. [2021-08-27 16:31:47,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:47,496 INFO L681 BuchiCegarLoop]: Abstraction has 40806 states and 65442 transitions. [2021-08-27 16:31:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40806 states and 65442 transitions. [2021-08-27 16:31:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40806 to 40806. [2021-08-27 16:31:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40806 states, 40806 states have (on average 1.6037347448904573) internal successors, (65442), 40805 states have internal predecessors, (65442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40806 states to 40806 states and 65442 transitions. [2021-08-27 16:31:48,110 INFO L704 BuchiCegarLoop]: Abstraction has 40806 states and 65442 transitions. [2021-08-27 16:31:48,110 INFO L587 BuchiCegarLoop]: Abstraction has 40806 states and 65442 transitions. [2021-08-27 16:31:48,110 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 16:31:48,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40806 states and 65442 transitions. [2021-08-27 16:31:48,192 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 12598 [2021-08-27 16:31:48,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:48,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:48,193 INFO L842 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] [2021-08-27 16:31:48,193 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:48,193 INFO L791 eck$LassoCheckResult]: Stem: 250807#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(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 250632#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 250633#L408 assume !(1 == ~c_req_up~0); 250562#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 250820#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 250821#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 250695#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 250696#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 250646#L439-1 assume !(0 == ~e_f~0); 250647#L444-1 assume !(0 == ~e_g~0); 250785#L449-1 assume !(0 == ~e_e~0); 250786#L454-1 assume !(0 == ~e_c~0); 250855#L459-1 assume !(0 == ~e_wl~0); 250854#L464-1 assume !(1 == ~wl_pc~0); 250851#L476 assume !(2 == ~wl_pc~0); 250850#L477 assume !(1 == ~c1_pc~0); 250848#L487 assume !(1 == ~c2_pc~0); 250846#L496 assume !(1 == ~wb_pc~0); 250844#L505 assume !(1 == ~e_c~0); 250843#L514-1 assume !(1 == ~e_e~0); 250842#L519-1 assume !(1 == ~e_f~0); 250841#L524-1 assume !(1 == ~e_g~0); 250835#L529-1 assume !(1 == ~e_c~0); 250836#L534-1 assume !(1 == ~e_wl~0); 264160#L676-1 assume !false; 264161#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 281256#L381 [2021-08-27 16:31:48,193 INFO L793 eck$LassoCheckResult]: Loop: 281256#L381 assume !false; 285885#L299 assume 0 == ~wl_st~0; 285884#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 285883#L325 assume !(0 != eval_~tmp~0); 285574#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 285572#L340 assume !(0 != eval_~tmp___0~0); 285571#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 285567#L355 assume !(0 != eval_~tmp___1~0); 285565#L351 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 285543#L370 assume !(0 != eval_~tmp___2~0); 285564#L366 assume !(0 == ~r_st~0); 281256#L381 [2021-08-27 16:31:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2021-08-27 16:31:48,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:48,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722065031] [2021-08-27 16:31:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:48,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,199 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,203 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:48,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:48,204 INFO L82 PathProgramCache]: Analyzing trace with hash 195616437, now seen corresponding path program 1 times [2021-08-27 16:31:48,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:48,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714865102] [2021-08-27 16:31:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:48,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,206 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,207 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash -256467523, now seen corresponding path program 1 times [2021-08-27 16:31:48,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:48,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663463807] [2021-08-27 16:31:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:48,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,212 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,217 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:49,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:31:49 BoogieIcfgContainer [2021-08-27 16:31:49,368 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:31:49,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:31:49,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:31:49,369 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:31:49,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:31:34" (3/4) ... [2021-08-27 16:31:49,371 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 16:31:49,400 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 16:31:49,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:31:49,401 INFO L168 Benchmark]: Toolchain (without parser) took 16186.22 ms. Allocated memory was 67.1 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 49.4 MB in the beginning and 3.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 540.9 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:49,401 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 67.1 MB. Free memory is still 49.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:31:49,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.31 ms. Allocated memory is still 67.1 MB. Free memory was 49.2 MB in the beginning and 48.5 MB in the end (delta: 741.5 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:49,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.71 ms. Allocated memory is still 67.1 MB. Free memory was 48.2 MB in the beginning and 46.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:49,402 INFO L168 Benchmark]: Boogie Preprocessor took 22.32 ms. Allocated memory is still 67.1 MB. Free memory was 46.0 MB in the beginning and 44.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:49,402 INFO L168 Benchmark]: RCFGBuilder took 430.02 ms. Allocated memory was 67.1 MB in the beginning and 88.1 MB in the end (delta: 21.0 MB). Free memory was 43.9 MB in the beginning and 44.7 MB in the end (delta: -798.7 kB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:49,403 INFO L168 Benchmark]: BuchiAutomizer took 15356.68 ms. Allocated memory was 88.1 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 44.3 MB in the beginning and 3.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 652.6 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:49,403 INFO L168 Benchmark]: Witness Printer took 31.31 ms. Allocated memory is still 4.0 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:49,404 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.14 ms. Allocated memory is still 67.1 MB. Free memory is still 49.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 312.31 ms. Allocated memory is still 67.1 MB. Free memory was 49.2 MB in the beginning and 48.5 MB in the end (delta: 741.5 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 28.71 ms. Allocated memory is still 67.1 MB. Free memory was 48.2 MB in the beginning and 46.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.32 ms. Allocated memory is still 67.1 MB. Free memory was 46.0 MB in the beginning and 44.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 430.02 ms. Allocated memory was 67.1 MB in the beginning and 88.1 MB in the end (delta: 21.0 MB). Free memory was 43.9 MB in the beginning and 44.7 MB in the end (delta: -798.7 kB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 15356.68 ms. Allocated memory was 88.1 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 44.3 MB in the beginning and 3.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 652.6 MB. Max. memory is 16.1 GB. * Witness Printer took 31.31 ms. Allocated memory is still 4.0 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 21 terminating modules (16 trivial, 5 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * e_c + 3 and consists of 4 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. 16 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 40806 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.2s and 17 iterations. TraceHistogramMax:2. Analysis of lassos took 8.8s. Construction of modules took 0.3s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 16. Automata minimization 2007.1ms AutomataMinimizationTime, 21 MinimizatonAttempts, 5512 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 1.0s Buchi closure took 0.0s. Biggest automaton had 40806 states and ocurred in iteration 16. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 5511 SDtfs, 5051 SDslu, 3671 SDs, 0 SdLazy, 491 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 376.8ms Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI5 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital82 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq183 hnf97 smp100 dnf186 smp67 tf110 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 79ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 298]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=10950} State at position 1 is {wb_st=0, NULL=0, NULL=10950, c2_st=0, tmp=0, e_c=2, e_e=2, e_p_in=0, kernel_st=1, t_b=0, tmp___2=0, wb_pc=0, tmp___0=0, wb_i=1, c_t=0, NULL=0, NULL=0, c=0, wl_st=0, c2_pc=0, r_i=0, e_f=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55e62589=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@724618f5=0, NULL=0, r_st=2, __retres1=0, p_out=0, NULL=10952, processed=0, \result=0, wl_pc=0, e_wl=2, tmp___1=0, data=0, p_in=0, tmp___3=0, c_req_up=0, NULL=10951, wl_i=1, NULL=0, c1_st=0, NULL=10953, c1_i=1, c2_i=1, d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@412a1d2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62116db2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@284a060=0, e_g=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 298]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L404] int kernel_st ; [L407] kernel_st = 0 [L408] COND FALSE !((int )c_req_up == 1) [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 [L444] COND FALSE !((int )e_f == 0) [L449] COND FALSE !((int )e_g == 0) [L454] COND FALSE !((int )e_e == 0) [L459] COND FALSE !((int )e_c == 0) [L464] COND FALSE !((int )e_wl == 0) [L469] COND FALSE !((int )wl_pc == 1) [L477] COND FALSE !((int )wl_pc == 2) [L487] COND FALSE !((int )c1_pc == 1) [L496] COND FALSE !((int )c2_pc == 1) [L505] COND FALSE !((int )wb_pc == 1) [L514] COND FALSE !((int )e_c == 1) [L519] COND FALSE !((int )e_e == 1) [L524] COND FALSE !((int )e_f == 1) [L529] COND FALSE !((int )e_g == 1) [L534] COND FALSE !((int )e_c == 1) [L539] COND FALSE !((int )e_wl == 1) [L545] COND TRUE 1 [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 16:31:49,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...