./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer --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 a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.24-cad4683 [2019-10-22 08:55:38,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:38,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:38,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:38,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:38,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:38,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:38,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:38,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:38,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:38,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:38,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:38,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:38,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:38,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:38,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:38,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:38,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:38,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:38,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:38,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:38,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:38,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:38,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:38,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:38,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:38,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:38,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:38,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:38,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:38,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:38,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:38,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:38,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:38,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:38,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:38,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:38,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:38,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:38,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:38,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:38,408 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:55:38,421 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:38,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:38,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:38,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:38,422 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:38,422 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:38,423 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:38,423 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:38,423 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:38,423 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:38,423 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:38,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:38,423 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:38,424 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:38,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:38,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:38,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:38,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:38,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:38,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:38,425 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:38,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:38,425 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:38,425 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:38,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:38,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:38,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:38,426 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:38,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:38,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:38,426 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:38,427 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:38,427 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer 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 -> a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 [2019-10-22 08:55:38,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:38,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:38,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:38,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:38,475 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:38,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/../../sv-benchmarks/c/systemc/toy.cil.c [2019-10-22 08:55:38,527 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/data/59dcc54ba/bc950c18ed3142699beaa95855f71133/FLAGb25226f81 [2019-10-22 08:55:38,975 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:38,976 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/sv-benchmarks/c/systemc/toy.cil.c [2019-10-22 08:55:38,989 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/data/59dcc54ba/bc950c18ed3142699beaa95855f71133/FLAGb25226f81 [2019-10-22 08:55:39,329 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/data/59dcc54ba/bc950c18ed3142699beaa95855f71133 [2019-10-22 08:55:39,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:39,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:39,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:39,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:39,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:39,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@310cfdac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39, skipping insertion in model container [2019-10-22 08:55:39,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,349 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:39,389 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:39,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:39,650 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:39,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:39,719 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:39,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39 WrapperNode [2019-10-22 08:55:39,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:39,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:39,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:39,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:39,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:39,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:39,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:39,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:39,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:39,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:39,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:39,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:39,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:39,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:39,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:40,442 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:40,443 INFO L284 CfgBuilder]: Removed 26 assume(true) statements. [2019-10-22 08:55:40,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:40 BoogieIcfgContainer [2019-10-22 08:55:40,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:40,445 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:40,445 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:40,448 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:40,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:40,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:39" (1/3) ... [2019-10-22 08:55:40,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2de36378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:40, skipping insertion in model container [2019-10-22 08:55:40,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:40,451 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (2/3) ... [2019-10-22 08:55:40,451 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2de36378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:40, skipping insertion in model container [2019-10-22 08:55:40,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:40,451 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:40" (3/3) ... [2019-10-22 08:55:40,453 INFO L371 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2019-10-22 08:55:40,498 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:40,498 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:40,502 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:40,502 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:40,502 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:40,502 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:40,502 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:40,502 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:40,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2019-10-22 08:55:40,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 08:55:40,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:40,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:40,555 INFO L849 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] [2019-10-22 08:55:40,555 INFO L850 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] [2019-10-22 08:55:40,555 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:40,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2019-10-22 08:55:40,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 08:55:40,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:40,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:40,562 INFO L849 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] [2019-10-22 08:55:40,562 INFO L850 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] [2019-10-22 08:55:40,568 INFO L791 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRYtrue ~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; 14#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; 4#L398true assume !(1 == ~c_req_up~0); 8#L398-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 7#L409-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 31#L414-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 52#L419-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 74#L424-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 100#L429-1true assume !(0 == ~e_f~0); 122#L434-1true assume !(0 == ~e_g~0); 28#L439-1true assume !(0 == ~e_e~0); 48#L444-1true assume !(0 == ~e_c~0); 71#L449-1true assume !(0 == ~e_wl~0); 94#L454-1true assume !(1 == ~wl_pc~0); 47#L466true assume !(2 == ~wl_pc~0); 120#L467true assume !(1 == ~c1_pc~0); 45#L477true assume !(1 == ~c2_pc~0); 19#L486true assume !(1 == ~wb_pc~0); 111#L495true assume !(1 == ~e_c~0); 68#L504-1true assume !(1 == ~e_e~0); 92#L509-1true assume !(1 == ~e_f~0); 117#L514-1true assume !(1 == ~e_g~0); 20#L519-1true assume !(1 == ~e_c~0); 42#L524-1true assume !(1 == ~e_wl~0); 79#L666-1true [2019-10-22 08:55:40,570 INFO L793 eck$LassoCheckResult]: Loop: 79#L666-1true assume !false; 114#L536true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 107#L371true assume false; 6#L387true start_simulation_~kernel_st~0 := 2; 86#L542true assume !(1 == ~c_req_up~0); 93#L542-2true start_simulation_~kernel_st~0 := 3; 58#L554true assume 0 == ~e_f~0;~e_f~0 := 1; 44#L554-2true assume 0 == ~e_g~0;~e_g~0 := 1; 67#L559-1true assume !(0 == ~e_e~0); 88#L564-1true assume 0 == ~e_c~0;~e_c~0 := 1; 115#L569-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 18#L574-1true assume 1 == ~wl_pc~0; 112#L580true assume 1 == ~e_wl~0;~wl_st~0 := 0; 56#L587true assume !(1 == ~c1_pc~0); 103#L597true assume !(1 == ~c2_pc~0); 61#L606true assume !(1 == ~wb_pc~0); 33#L615true assume 1 == ~e_c~0;~r_st~0 := 0; 127#L624-1true assume 1 == ~e_e~0;~e_e~0 := 2; 16#L629-1true assume 1 == ~e_f~0;~e_f~0 := 2; 38#L634-1true assume !(1 == ~e_g~0); 62#L639-1true assume 1 == ~e_c~0;~e_c~0 := 2; 81#L644-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 110#L649-1true assume 0 == ~wl_st~0; 79#L666-1true [2019-10-22 08:55:40,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:40,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2019-10-22 08:55:40,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:40,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822519339] [2019-10-22 08:55:40,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:40,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822519339] [2019-10-22 08:55:40,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:40,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:40,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944798748] [2019-10-22 08:55:40,735 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:40,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:40,735 INFO L82 PathProgramCache]: Analyzing trace with hash 359392569, now seen corresponding path program 1 times [2019-10-22 08:55:40,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:40,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402159048] [2019-10-22 08:55:40,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:40,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402159048] [2019-10-22 08:55:40,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:40,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:40,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242548932] [2019-10-22 08:55:40,749 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:40,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:55:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:55:40,767 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 2 states. [2019-10-22 08:55:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:40,782 INFO L93 Difference]: Finished difference Result 125 states and 219 transitions. [2019-10-22 08:55:40,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:55:40,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 219 transitions. [2019-10-22 08:55:40,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:55:40,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 120 states and 214 transitions. [2019-10-22 08:55:40,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-10-22 08:55:40,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-10-22 08:55:40,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 214 transitions. [2019-10-22 08:55:40,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:40,804 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2019-10-22 08:55:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 214 transitions. [2019-10-22 08:55:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-10-22 08:55:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-22 08:55:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 214 transitions. [2019-10-22 08:55:40,853 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2019-10-22 08:55:40,853 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2019-10-22 08:55:40,853 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:40,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 214 transitions. [2019-10-22 08:55:40,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:55:40,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:40,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:40,856 INFO L849 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] [2019-10-22 08:55:40,856 INFO L850 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] [2019-10-22 08:55:40,857 INFO L791 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY ~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; 281#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; 259#L398 assume !(1 == ~c_req_up~0); 261#L398-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 267#L409-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 268#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 314#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 346#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 363#L429-1 assume !(0 == ~e_f~0); 374#L434-1 assume !(0 == ~e_g~0); 309#L439-1 assume !(0 == ~e_e~0); 310#L444-1 assume !(0 == ~e_c~0); 342#L449-1 assume !(0 == ~e_wl~0); 361#L454-1 assume !(1 == ~wl_pc~0); 339#L466 assume !(2 == ~wl_pc~0); 340#L467 assume !(1 == ~c1_pc~0); 335#L477 assume !(1 == ~c2_pc~0); 291#L486 assume !(1 == ~wb_pc~0); 292#L495 assume !(1 == ~e_c~0); 357#L504-1 assume !(1 == ~e_e~0); 358#L509-1 assume !(1 == ~e_f~0); 371#L514-1 assume !(1 == ~e_g~0); 294#L519-1 assume !(1 == ~e_c~0); 295#L524-1 assume !(1 == ~e_wl~0); 331#L666-1 [2019-10-22 08:55:40,857 INFO L793 eck$LassoCheckResult]: Loop: 331#L666-1 assume !false; 364#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 270#L371 assume !false; 370#L289 assume !(0 == ~wl_st~0); 304#L293 assume !(0 == ~c1_st~0); 273#L296 assume !(0 == ~c2_st~0); 275#L299 assume !(0 == ~wb_st~0); 287#L302 assume !(0 == ~r_st~0); 265#L387 start_simulation_~kernel_st~0 := 2; 266#L542 assume !(1 == ~c_req_up~0); 338#L542-2 start_simulation_~kernel_st~0 := 3; 350#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 333#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 334#L559-1 assume !(0 == ~e_e~0); 356#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 369#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 288#L574-1 assume 1 == ~wl_pc~0; 289#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 272#L587 assume !(1 == ~c1_pc~0); 349#L597 assume !(1 == ~c2_pc~0); 313#L606 assume !(1 == ~wb_pc~0); 316#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 317#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 285#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 286#L634-1 assume !(1 == ~e_g~0); 326#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 354#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 365#L649-1 assume 0 == ~wl_st~0; 331#L666-1 [2019-10-22 08:55:40,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:40,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2019-10-22 08:55:40,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:40,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331513369] [2019-10-22 08:55:40,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:40,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331513369] [2019-10-22 08:55:40,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:40,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:40,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589003875] [2019-10-22 08:55:40,896 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:40,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:40,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 1 times [2019-10-22 08:55:40,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:40,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042480751] [2019-10-22 08:55:40,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:40,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042480751] [2019-10-22 08:55:40,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:40,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:40,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394859198] [2019-10-22 08:55:40,929 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:40,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:40,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:40,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:40,930 INFO L87 Difference]: Start difference. First operand 120 states and 214 transitions. cyclomatic complexity: 95 Second operand 3 states. [2019-10-22 08:55:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:40,951 INFO L93 Difference]: Finished difference Result 120 states and 213 transitions. [2019-10-22 08:55:40,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:40,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 213 transitions. [2019-10-22 08:55:40,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:55:40,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 213 transitions. [2019-10-22 08:55:40,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-10-22 08:55:40,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-10-22 08:55:40,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 213 transitions. [2019-10-22 08:55:40,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:40,958 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2019-10-22 08:55:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 213 transitions. [2019-10-22 08:55:40,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-10-22 08:55:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-22 08:55:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 213 transitions. [2019-10-22 08:55:40,966 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2019-10-22 08:55:40,966 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2019-10-22 08:55:40,966 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:40,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 213 transitions. [2019-10-22 08:55:40,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:55:40,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:40,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:40,968 INFO L849 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] [2019-10-22 08:55:40,968 INFO L850 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] [2019-10-22 08:55:40,969 INFO L791 eck$LassoCheckResult]: Stem: 615#ULTIMATE.startENTRY ~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; 528#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; 506#L398 assume !(1 == ~c_req_up~0); 508#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 514#L409-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 515#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 561#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 593#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 610#L429-1 assume !(0 == ~e_f~0); 621#L434-1 assume !(0 == ~e_g~0); 556#L439-1 assume !(0 == ~e_e~0); 557#L444-1 assume !(0 == ~e_c~0); 589#L449-1 assume !(0 == ~e_wl~0); 608#L454-1 assume !(1 == ~wl_pc~0); 586#L466 assume !(2 == ~wl_pc~0); 587#L467 assume !(1 == ~c1_pc~0); 582#L477 assume !(1 == ~c2_pc~0); 538#L486 assume !(1 == ~wb_pc~0); 539#L495 assume !(1 == ~e_c~0); 604#L504-1 assume !(1 == ~e_e~0); 605#L509-1 assume !(1 == ~e_f~0); 618#L514-1 assume !(1 == ~e_g~0); 541#L519-1 assume !(1 == ~e_c~0); 542#L524-1 assume !(1 == ~e_wl~0); 578#L666-1 [2019-10-22 08:55:40,969 INFO L793 eck$LassoCheckResult]: Loop: 578#L666-1 assume !false; 611#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 517#L371 assume !false; 617#L289 assume !(0 == ~wl_st~0); 551#L293 assume !(0 == ~c1_st~0); 520#L296 assume !(0 == ~c2_st~0); 522#L299 assume !(0 == ~wb_st~0); 534#L302 assume !(0 == ~r_st~0); 512#L387 start_simulation_~kernel_st~0 := 2; 513#L542 assume !(1 == ~c_req_up~0); 585#L542-2 start_simulation_~kernel_st~0 := 3; 597#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 580#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 581#L559-1 assume !(0 == ~e_e~0); 603#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 616#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 535#L574-1 assume 1 == ~wl_pc~0; 536#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 519#L587 assume !(1 == ~c1_pc~0); 596#L597 assume !(1 == ~c2_pc~0); 560#L606 assume !(1 == ~wb_pc~0); 563#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 564#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 532#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 533#L634-1 assume !(1 == ~e_g~0); 573#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 601#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 612#L649-1 assume 0 == ~wl_st~0; 578#L666-1 [2019-10-22 08:55:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:40,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2019-10-22 08:55:40,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:40,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407004505] [2019-10-22 08:55:40,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407004505] [2019-10-22 08:55:41,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:41,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274348630] [2019-10-22 08:55:41,024 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 2 times [2019-10-22 08:55:41,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988444658] [2019-10-22 08:55:41,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988444658] [2019-10-22 08:55:41,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:41,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386790973] [2019-10-22 08:55:41,070 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:41,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:41,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:41,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:41,071 INFO L87 Difference]: Start difference. First operand 120 states and 213 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-10-22 08:55:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:41,094 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2019-10-22 08:55:41,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:41,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 212 transitions. [2019-10-22 08:55:41,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:55:41,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 212 transitions. [2019-10-22 08:55:41,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-10-22 08:55:41,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-10-22 08:55:41,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 212 transitions. [2019-10-22 08:55:41,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:41,101 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2019-10-22 08:55:41,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 212 transitions. [2019-10-22 08:55:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-10-22 08:55:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-22 08:55:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 212 transitions. [2019-10-22 08:55:41,111 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2019-10-22 08:55:41,111 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2019-10-22 08:55:41,111 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:41,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 212 transitions. [2019-10-22 08:55:41,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:55:41,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:41,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:41,113 INFO L849 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] [2019-10-22 08:55:41,113 INFO L850 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] [2019-10-22 08:55:41,113 INFO L791 eck$LassoCheckResult]: Stem: 862#ULTIMATE.startENTRY ~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; 775#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; 753#L398 assume !(1 == ~c_req_up~0); 755#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 761#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 762#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 808#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 840#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 857#L429-1 assume !(0 == ~e_f~0); 868#L434-1 assume !(0 == ~e_g~0); 803#L439-1 assume !(0 == ~e_e~0); 804#L444-1 assume !(0 == ~e_c~0); 836#L449-1 assume !(0 == ~e_wl~0); 855#L454-1 assume !(1 == ~wl_pc~0); 833#L466 assume !(2 == ~wl_pc~0); 834#L467 assume !(1 == ~c1_pc~0); 829#L477 assume !(1 == ~c2_pc~0); 785#L486 assume !(1 == ~wb_pc~0); 786#L495 assume !(1 == ~e_c~0); 851#L504-1 assume !(1 == ~e_e~0); 852#L509-1 assume !(1 == ~e_f~0); 865#L514-1 assume !(1 == ~e_g~0); 788#L519-1 assume !(1 == ~e_c~0); 789#L524-1 assume !(1 == ~e_wl~0); 825#L666-1 [2019-10-22 08:55:41,113 INFO L793 eck$LassoCheckResult]: Loop: 825#L666-1 assume !false; 858#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 764#L371 assume !false; 864#L289 assume !(0 == ~wl_st~0); 798#L293 assume !(0 == ~c1_st~0); 767#L296 assume !(0 == ~c2_st~0); 769#L299 assume !(0 == ~wb_st~0); 781#L302 assume !(0 == ~r_st~0); 759#L387 start_simulation_~kernel_st~0 := 2; 760#L542 assume !(1 == ~c_req_up~0); 832#L542-2 start_simulation_~kernel_st~0 := 3; 844#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 827#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 828#L559-1 assume !(0 == ~e_e~0); 850#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 863#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 782#L574-1 assume !(1 == ~wl_pc~0); 784#L586 assume !(2 == ~wl_pc~0); 766#L587 assume !(1 == ~c1_pc~0); 843#L597 assume !(1 == ~c2_pc~0); 807#L606 assume !(1 == ~wb_pc~0); 810#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 811#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 779#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 780#L634-1 assume !(1 == ~e_g~0); 820#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 848#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 859#L649-1 assume 0 == ~wl_st~0; 825#L666-1 [2019-10-22 08:55:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2019-10-22 08:55:41,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207719045] [2019-10-22 08:55:41,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207719045] [2019-10-22 08:55:41,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:41,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365992317] [2019-10-22 08:55:41,138 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1257113092, now seen corresponding path program 1 times [2019-10-22 08:55:41,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65006752] [2019-10-22 08:55:41,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65006752] [2019-10-22 08:55:41,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:41,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519638706] [2019-10-22 08:55:41,167 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:41,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:41,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:41,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:41,168 INFO L87 Difference]: Start difference. First operand 120 states and 212 transitions. cyclomatic complexity: 93 Second operand 3 states. [2019-10-22 08:55:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:41,181 INFO L93 Difference]: Finished difference Result 120 states and 211 transitions. [2019-10-22 08:55:41,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:41,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 211 transitions. [2019-10-22 08:55:41,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:55:41,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 211 transitions. [2019-10-22 08:55:41,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-10-22 08:55:41,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-10-22 08:55:41,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 211 transitions. [2019-10-22 08:55:41,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:41,190 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2019-10-22 08:55:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 211 transitions. [2019-10-22 08:55:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-10-22 08:55:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-22 08:55:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 211 transitions. [2019-10-22 08:55:41,195 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2019-10-22 08:55:41,195 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2019-10-22 08:55:41,195 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:41,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 211 transitions. [2019-10-22 08:55:41,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:55:41,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:41,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:41,197 INFO L849 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] [2019-10-22 08:55:41,197 INFO L850 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] [2019-10-22 08:55:41,197 INFO L791 eck$LassoCheckResult]: Stem: 1109#ULTIMATE.startENTRY ~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; 1022#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; 1000#L398 assume !(1 == ~c_req_up~0); 1002#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1008#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1009#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1055#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1087#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1104#L429-1 assume !(0 == ~e_f~0); 1115#L434-1 assume !(0 == ~e_g~0); 1050#L439-1 assume !(0 == ~e_e~0); 1051#L444-1 assume !(0 == ~e_c~0); 1083#L449-1 assume !(0 == ~e_wl~0); 1102#L454-1 assume !(1 == ~wl_pc~0); 1080#L466 assume !(2 == ~wl_pc~0); 1081#L467 assume !(1 == ~c1_pc~0); 1076#L477 assume !(1 == ~c2_pc~0); 1032#L486 assume !(1 == ~wb_pc~0); 1033#L495 assume !(1 == ~e_c~0); 1098#L504-1 assume !(1 == ~e_e~0); 1099#L509-1 assume !(1 == ~e_f~0); 1112#L514-1 assume !(1 == ~e_g~0); 1035#L519-1 assume !(1 == ~e_c~0); 1036#L524-1 assume !(1 == ~e_wl~0); 1072#L666-1 [2019-10-22 08:55:41,198 INFO L793 eck$LassoCheckResult]: Loop: 1072#L666-1 assume !false; 1105#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 1011#L371 assume !false; 1111#L289 assume !(0 == ~wl_st~0); 1045#L293 assume !(0 == ~c1_st~0); 1014#L296 assume !(0 == ~c2_st~0); 1016#L299 assume !(0 == ~wb_st~0); 1028#L302 assume !(0 == ~r_st~0); 1006#L387 start_simulation_~kernel_st~0 := 2; 1007#L542 assume !(1 == ~c_req_up~0); 1079#L542-2 start_simulation_~kernel_st~0 := 3; 1091#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 1074#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1075#L559-1 assume !(0 == ~e_e~0); 1097#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1110#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1029#L574-1 assume 1 == ~wl_pc~0; 1030#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1013#L587 assume !(1 == ~c1_pc~0); 1090#L597 assume !(1 == ~c2_pc~0); 1054#L606 assume !(1 == ~wb_pc~0); 1057#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 1058#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1026#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1027#L634-1 assume !(1 == ~e_g~0); 1067#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1095#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1106#L649-1 assume 0 == ~wl_st~0; 1072#L666-1 [2019-10-22 08:55:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2019-10-22 08:55:41,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922914796] [2019-10-22 08:55:41,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,247 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:41,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 3 times [2019-10-22 08:55:41,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937230654] [2019-10-22 08:55:41,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937230654] [2019-10-22 08:55:41,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:41,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533214236] [2019-10-22 08:55:41,267 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:41,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:41,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:41,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:41,267 INFO L87 Difference]: Start difference. First operand 120 states and 211 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-10-22 08:55:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:41,308 INFO L93 Difference]: Finished difference Result 154 states and 273 transitions. [2019-10-22 08:55:41,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:41,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 273 transitions. [2019-10-22 08:55:41,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-10-22 08:55:41,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 273 transitions. [2019-10-22 08:55:41,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-10-22 08:55:41,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-10-22 08:55:41,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 273 transitions. [2019-10-22 08:55:41,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:41,312 INFO L688 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2019-10-22 08:55:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 273 transitions. [2019-10-22 08:55:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-10-22 08:55:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-22 08:55:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 273 transitions. [2019-10-22 08:55:41,318 INFO L711 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2019-10-22 08:55:41,318 INFO L591 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2019-10-22 08:55:41,319 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:41,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 273 transitions. [2019-10-22 08:55:41,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-10-22 08:55:41,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:41,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:41,321 INFO L849 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] [2019-10-22 08:55:41,321 INFO L850 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] [2019-10-22 08:55:41,321 INFO L791 eck$LassoCheckResult]: Stem: 1392#ULTIMATE.startENTRY ~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; 1302#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; 1280#L398 assume !(1 == ~c_req_up~0); 1282#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1288#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1289#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1335#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1368#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1387#L429-1 assume !(0 == ~e_f~0); 1398#L434-1 assume 0 == ~e_g~0;~e_g~0 := 1; 1403#L439-1 assume !(0 == ~e_e~0); 1417#L444-1 assume !(0 == ~e_c~0); 1416#L449-1 assume !(0 == ~e_wl~0); 1415#L454-1 assume !(1 == ~wl_pc~0); 1413#L466 assume !(2 == ~wl_pc~0); 1411#L467 assume !(1 == ~c1_pc~0); 1409#L477 assume !(1 == ~c2_pc~0); 1407#L486 assume !(1 == ~wb_pc~0); 1379#L495 assume !(1 == ~e_c~0); 1381#L504-1 assume !(1 == ~e_e~0); 1382#L509-1 assume !(1 == ~e_f~0); 1395#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1315#L519-1 assume !(1 == ~e_c~0); 1316#L524-1 assume !(1 == ~e_wl~0); 1352#L666-1 [2019-10-22 08:55:41,321 INFO L793 eck$LassoCheckResult]: Loop: 1352#L666-1 assume !false; 1388#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 1291#L371 assume !false; 1394#L289 assume !(0 == ~wl_st~0); 1325#L293 assume !(0 == ~c1_st~0); 1294#L296 assume !(0 == ~c2_st~0); 1296#L299 assume !(0 == ~wb_st~0); 1308#L302 assume !(0 == ~r_st~0); 1286#L387 start_simulation_~kernel_st~0 := 2; 1287#L542 assume !(1 == ~c_req_up~0); 1360#L542-2 start_simulation_~kernel_st~0 := 3; 1372#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 1354#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1355#L559-1 assume !(0 == ~e_e~0); 1380#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1393#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1309#L574-1 assume 1 == ~wl_pc~0; 1310#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1293#L587 assume !(1 == ~c1_pc~0); 1371#L597 assume !(1 == ~c2_pc~0); 1334#L606 assume !(1 == ~wb_pc~0); 1337#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 1338#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1306#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1307#L634-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1347#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1376#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1389#L649-1 assume 0 == ~wl_st~0; 1352#L666-1 [2019-10-22 08:55:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1535466835, now seen corresponding path program 1 times [2019-10-22 08:55:41,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502558279] [2019-10-22 08:55:41,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502558279] [2019-10-22 08:55:41,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:41,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274815544] [2019-10-22 08:55:41,348 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:41,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1806432395, now seen corresponding path program 1 times [2019-10-22 08:55:41,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894511829] [2019-10-22 08:55:41,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:41,363 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:41,540 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-22 08:55:41,620 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:41,622 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:41,622 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:41,622 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:41,622 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:41,622 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:41,622 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:41,623 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:41,623 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2019-10-22 08:55:41,623 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:41,623 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:41,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:41,966 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:41,970 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:41,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:41,980 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:41,993 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:41,993 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:42,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:42,003 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:42,016 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:42,017 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:42,036 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:42,039 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:42,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:42,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:42,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:42,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:42,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:42,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:42,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:42,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2019-10-22 08:55:42,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:42,040 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:42,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:42,319 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:42,325 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:42,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:42,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:42,329 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:42,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:42,330 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:42,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:42,332 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:42,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:42,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:42,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:42,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:42,339 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:42,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:42,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:42,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:42,340 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:42,340 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:42,347 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:42,350 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:42,352 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:55:42,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:42,355 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:42,355 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:42,355 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2019-10-22 08:55:42,358 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:42,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:42,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:42,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:42,472 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 [2019-10-22 08:55:42,473 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 273 transitions. cyclomatic complexity: 120 Second operand 5 states. [2019-10-22 08:55:42,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 273 transitions. cyclomatic complexity: 120. Second operand 5 states. Result 480 states and 845 transitions. Complement of second has 5 states. [2019-10-22 08:55:42,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:55:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2019-10-22 08:55:42,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 28 letters. [2019-10-22 08:55:42,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:42,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 52 letters. Loop has 28 letters. [2019-10-22 08:55:42,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:42,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 56 letters. [2019-10-22 08:55:42,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:42,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 480 states and 845 transitions. [2019-10-22 08:55:42,560 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 318 [2019-10-22 08:55:42,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 480 states to 480 states and 845 transitions. [2019-10-22 08:55:42,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2019-10-22 08:55:42,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2019-10-22 08:55:42,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 845 transitions. [2019-10-22 08:55:42,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:42,565 INFO L688 BuchiCegarLoop]: Abstraction has 480 states and 845 transitions. [2019-10-22 08:55:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states and 845 transitions. [2019-10-22 08:55:42,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 370. [2019-10-22 08:55:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-22 08:55:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 653 transitions. [2019-10-22 08:55:42,578 INFO L711 BuchiCegarLoop]: Abstraction has 370 states and 653 transitions. [2019-10-22 08:55:42,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:42,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:42,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:42,579 INFO L87 Difference]: Start difference. First operand 370 states and 653 transitions. Second operand 4 states. [2019-10-22 08:55:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:42,670 INFO L93 Difference]: Finished difference Result 570 states and 982 transitions. [2019-10-22 08:55:42,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:42,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 570 states and 982 transitions. [2019-10-22 08:55:42,674 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 332 [2019-10-22 08:55:42,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 570 states to 570 states and 982 transitions. [2019-10-22 08:55:42,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2019-10-22 08:55:42,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2019-10-22 08:55:42,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 570 states and 982 transitions. [2019-10-22 08:55:42,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:42,679 INFO L688 BuchiCegarLoop]: Abstraction has 570 states and 982 transitions. [2019-10-22 08:55:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states and 982 transitions. [2019-10-22 08:55:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 542. [2019-10-22 08:55:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-22 08:55:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 942 transitions. [2019-10-22 08:55:42,691 INFO L711 BuchiCegarLoop]: Abstraction has 542 states and 942 transitions. [2019-10-22 08:55:42,691 INFO L591 BuchiCegarLoop]: Abstraction has 542 states and 942 transitions. [2019-10-22 08:55:42,691 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:55:42,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 942 transitions. [2019-10-22 08:55:42,694 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 332 [2019-10-22 08:55:42,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:42,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:42,695 INFO L849 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] [2019-10-22 08:55:42,695 INFO L850 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] [2019-10-22 08:55:42,696 INFO L791 eck$LassoCheckResult]: Stem: 3246#ULTIMATE.startENTRY ~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; 3073#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; 3034#L398 assume !(1 == ~c_req_up~0); 3036#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3047#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3048#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3132#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3193#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3231#L429-1 assume !(0 == ~e_f~0); 3264#L434-1 assume !(0 == ~e_g~0); 3124#L439-1 assume !(0 == ~e_e~0); 3125#L444-1 assume !(0 == ~e_c~0); 3185#L449-1 assume !(0 == ~e_wl~0); 3228#L454-1 assume !(1 == ~wl_pc~0); 3182#L466 assume !(2 == ~wl_pc~0); 3183#L467 assume !(1 == ~c1_pc~0); 3176#L477 assume !(1 == ~c2_pc~0); 3092#L486 assume !(1 == ~wb_pc~0); 3093#L495 assume !(1 == ~e_c~0); 3316#L504-1 assume !(1 == ~e_e~0); 3314#L509-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3313#L514-1 assume !(1 == ~e_g~0); 3280#L519-1 assume !(1 == ~e_c~0); 3312#L524-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3232#L666-1 [2019-10-22 08:55:42,696 INFO L793 eck$LassoCheckResult]: Loop: 3232#L666-1 assume !false; 3233#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 3050#L371 assume !false; 3251#L289 assume !(0 == ~wl_st~0); 3114#L293 assume !(0 == ~c1_st~0); 3057#L296 assume !(0 == ~c2_st~0); 3059#L299 assume !(0 == ~wb_st~0); 3084#L302 assume !(0 == ~r_st~0); 3043#L387 start_simulation_~kernel_st~0 := 2; 3044#L542 assume !(1 == ~c_req_up~0); 3179#L542-2 start_simulation_~kernel_st~0 := 3; 3256#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 3350#L554-2 assume !(0 == ~e_g~0); 3352#L559-1 assume !(0 == ~e_e~0); 3351#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3278#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3086#L574-1 assume !(1 == ~wl_pc~0); 3088#L586 assume !(2 == ~wl_pc~0); 3054#L587 assume !(1 == ~c1_pc~0); 3198#L597 assume !(1 == ~c2_pc~0); 3129#L606 assume !(1 == ~wb_pc~0); 3210#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 3559#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3558#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3499#L634-1 assume !(1 == ~e_g~0); 3155#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3214#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3238#L649-1 assume 0 == ~wl_st~0; 3232#L666-1 [2019-10-22 08:55:42,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,696 INFO L82 PathProgramCache]: Analyzing trace with hash 255545495, now seen corresponding path program 1 times [2019-10-22 08:55:42,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617540898] [2019-10-22 08:55:42,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:42,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617540898] [2019-10-22 08:55:42,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:42,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:42,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665923966] [2019-10-22 08:55:42,721 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:42,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2016785850, now seen corresponding path program 1 times [2019-10-22 08:55:42,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949019768] [2019-10-22 08:55:42,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:42,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949019768] [2019-10-22 08:55:42,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:42,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:42,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499327470] [2019-10-22 08:55:42,738 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:42,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:42,738 INFO L87 Difference]: Start difference. First operand 542 states and 942 transitions. cyclomatic complexity: 406 Second operand 4 states. [2019-10-22 08:55:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:42,843 INFO L93 Difference]: Finished difference Result 1129 states and 1896 transitions. [2019-10-22 08:55:42,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:42,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1129 states and 1896 transitions. [2019-10-22 08:55:42,851 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 690 [2019-10-22 08:55:42,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1129 states to 1129 states and 1896 transitions. [2019-10-22 08:55:42,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 774 [2019-10-22 08:55:42,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 774 [2019-10-22 08:55:42,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1129 states and 1896 transitions. [2019-10-22 08:55:42,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:42,860 INFO L688 BuchiCegarLoop]: Abstraction has 1129 states and 1896 transitions. [2019-10-22 08:55:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states and 1896 transitions. [2019-10-22 08:55:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1111. [2019-10-22 08:55:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-22 08:55:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1875 transitions. [2019-10-22 08:55:42,881 INFO L711 BuchiCegarLoop]: Abstraction has 1111 states and 1875 transitions. [2019-10-22 08:55:42,882 INFO L591 BuchiCegarLoop]: Abstraction has 1111 states and 1875 transitions. [2019-10-22 08:55:42,882 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:55:42,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1111 states and 1875 transitions. [2019-10-22 08:55:42,887 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 688 [2019-10-22 08:55:42,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:42,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:42,888 INFO L849 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] [2019-10-22 08:55:42,888 INFO L850 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] [2019-10-22 08:55:42,888 INFO L791 eck$LassoCheckResult]: Stem: 4965#ULTIMATE.startENTRY ~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; 4768#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; 4722#L398 assume !(1 == ~c_req_up~0); 4724#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4739#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4826#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4827#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4940#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4941#L429-1 assume !(0 == ~e_f~0); 5013#L434-1 assume !(0 == ~e_g~0); 5014#L439-1 assume !(0 == ~e_e~0); 4882#L444-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4883#L449-1 assume !(0 == ~e_wl~0); 4936#L454-1 assume !(1 == ~wl_pc~0); 4879#L466 assume !(2 == ~wl_pc~0); 4880#L467 assume !(1 == ~c1_pc~0); 4876#L477 assume !(1 == ~c2_pc~0); 4878#L486 assume !(1 == ~wb_pc~0); 5032#L495 assume !(1 == ~e_c~0); 5030#L504-1 assume !(1 == ~e_e~0); 5028#L509-1 assume !(1 == ~e_f~0); 5025#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 5022#L519-1 assume !(1 == ~e_c~0); 5023#L524-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 5196#L666-1 [2019-10-22 08:55:42,888 INFO L793 eck$LassoCheckResult]: Loop: 5196#L666-1 assume !false; 5346#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 5718#L371 assume !false; 5717#L289 assume !(0 == ~wl_st~0); 5716#L293 assume !(0 == ~c1_st~0); 5715#L296 assume !(0 == ~c2_st~0); 5714#L299 assume !(0 == ~wb_st~0); 5322#L302 assume !(0 == ~r_st~0); 5320#L387 start_simulation_~kernel_st~0 := 2; 5313#L542 assume !(1 == ~c_req_up~0); 5312#L542-2 start_simulation_~kernel_st~0 := 3; 5305#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 5303#L554-2 assume !(0 == ~e_g~0); 5301#L559-1 assume !(0 == ~e_e~0); 5298#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 5297#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5295#L574-1 assume 1 == ~wl_pc~0; 5293#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 5289#L587 assume !(1 == ~c1_pc~0); 5286#L597 assume !(1 == ~c2_pc~0); 5288#L606 assume !(1 == ~wb_pc~0); 5680#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 5277#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 5278#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 5660#L634-1 assume !(1 == ~e_g~0); 5462#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 5659#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 5730#L649-1 assume 0 == ~wl_st~0; 5196#L666-1 [2019-10-22 08:55:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,889 INFO L82 PathProgramCache]: Analyzing trace with hash 842409169, now seen corresponding path program 1 times [2019-10-22 08:55:42,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380336672] [2019-10-22 08:55:42,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:42,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380336672] [2019-10-22 08:55:42,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:42,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:42,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70815581] [2019-10-22 08:55:42,908 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:42,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1467526129, now seen corresponding path program 1 times [2019-10-22 08:55:42,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742602688] [2019-10-22 08:55:42,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:42,919 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:43,038 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-10-22 08:55:43,084 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:43,084 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:43,084 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:43,084 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:43,085 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:43,085 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:43,085 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:43,085 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:43,085 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2019-10-22 08:55:43,085 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:43,085 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:43,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,378 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:43,378 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:43,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:43,388 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,388 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:43,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:43,396 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,396 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:43,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,405 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:43,409 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,409 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:43,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,447 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:43,451 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,451 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:43,458 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,458 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:43,468 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:43,468 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:43,474 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:43,476 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:43,476 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:43,476 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:43,476 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:43,476 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:43,476 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:43,476 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:43,476 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:43,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2019-10-22 08:55:43,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:43,477 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:43,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55: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 [2019-10-22 08:55:43,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55: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 [2019-10-22 08:55:43,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55: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 [2019-10-22 08:55:43,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55: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 [2019-10-22 08:55: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 [2019-10-22 08:55: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 [2019-10-22 08:55:43,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,735 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:43,735 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:43,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:43,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,736 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:43,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,737 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:43,737 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:43,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:43,739 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,739 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:43,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,739 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:43,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,740 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:43,740 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:43,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:43,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,742 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:43,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,743 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:43,743 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:43,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:43,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,746 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:43,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,746 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:43,746 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,747 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:43,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:43,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:43,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,749 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:43,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,750 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:43,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:43,752 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:43,754 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:43,754 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:55:43,755 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:43,755 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:43,755 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:43,755 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2019-10-22 08:55:43,755 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:43,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:43,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:43,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:43,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:43,834 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 [2019-10-22 08:55:43,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1111 states and 1875 transitions. cyclomatic complexity: 776 Second operand 5 states. [2019-10-22 08:55:43,872 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1111 states and 1875 transitions. cyclomatic complexity: 776. Second operand 5 states. Result 1849 states and 3132 transitions. Complement of second has 5 states. [2019-10-22 08:55:43,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:55:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2019-10-22 08:55:43,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 24 letters. Loop has 28 letters. [2019-10-22 08:55:43,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:43,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 52 letters. Loop has 28 letters. [2019-10-22 08:55:43,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:43,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 24 letters. Loop has 56 letters. [2019-10-22 08:55:43,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:43,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1849 states and 3132 transitions. [2019-10-22 08:55:43,887 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1064 [2019-10-22 08:55:43,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1849 states to 1849 states and 3132 transitions. [2019-10-22 08:55:43,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1142 [2019-10-22 08:55:43,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1151 [2019-10-22 08:55:43,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1849 states and 3132 transitions. [2019-10-22 08:55:43,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:43,898 INFO L688 BuchiCegarLoop]: Abstraction has 1849 states and 3132 transitions. [2019-10-22 08:55:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states and 3132 transitions. [2019-10-22 08:55:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 955. [2019-10-22 08:55:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-10-22 08:55:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1615 transitions. [2019-10-22 08:55:43,920 INFO L711 BuchiCegarLoop]: Abstraction has 955 states and 1615 transitions. [2019-10-22 08:55:43,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:43,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:43,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:43,921 INFO L87 Difference]: Start difference. First operand 955 states and 1615 transitions. Second operand 4 states. [2019-10-22 08:55:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:43,984 INFO L93 Difference]: Finished difference Result 977 states and 1626 transitions. [2019-10-22 08:55:43,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:43,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 977 states and 1626 transitions. [2019-10-22 08:55:43,990 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 547 [2019-10-22 08:55:43,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 977 states to 977 states and 1626 transitions. [2019-10-22 08:55:43,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2019-10-22 08:55:43,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2019-10-22 08:55:43,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 977 states and 1626 transitions. [2019-10-22 08:55:43,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:43,995 INFO L688 BuchiCegarLoop]: Abstraction has 977 states and 1626 transitions. [2019-10-22 08:55:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states and 1626 transitions. [2019-10-22 08:55:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 894. [2019-10-22 08:55:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-10-22 08:55:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1493 transitions. [2019-10-22 08:55:44,009 INFO L711 BuchiCegarLoop]: Abstraction has 894 states and 1493 transitions. [2019-10-22 08:55:44,009 INFO L591 BuchiCegarLoop]: Abstraction has 894 states and 1493 transitions. [2019-10-22 08:55:44,009 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:55:44,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 894 states and 1493 transitions. [2019-10-22 08:55:44,013 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 547 [2019-10-22 08:55:44,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:44,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:44,014 INFO L849 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] [2019-10-22 08:55:44,014 INFO L850 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] [2019-10-22 08:55:44,014 INFO L791 eck$LassoCheckResult]: Stem: 10007#ULTIMATE.startENTRY ~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; 9831#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; 9788#L398 assume !(1 == ~c_req_up~0); 9790#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9801#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9802#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9954#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9955#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9995#L429-1 assume !(0 == ~e_f~0); 10039#L434-1 assume !(0 == ~e_g~0); 10040#L439-1 assume !(0 == ~e_e~0); 9946#L444-1 assume !(0 == ~e_c~0); 9947#L449-1 assume !(0 == ~e_wl~0); 10014#L454-1 assume !(1 == ~wl_pc~0); 10015#L466 assume !(2 == ~wl_pc~0); 10038#L467 assume !(1 == ~c1_pc~0); 10037#L477 assume !(1 == ~c2_pc~0); 9850#L486 assume !(1 == ~wb_pc~0); 9851#L495 assume !(1 == ~e_c~0); 10032#L504-1 assume !(1 == ~e_e~0); 10012#L509-1 assume !(1 == ~e_f~0); 10013#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10035#L519-1 assume !(1 == ~e_c~0); 9928#L524-1 assume !(1 == ~e_wl~0); 9929#L666-1 assume !false; 10456#L536 [2019-10-22 08:55:44,015 INFO L793 eck$LassoCheckResult]: Loop: 10456#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 10532#L371 assume !false; 10531#L289 assume !(0 == ~wl_st~0); 10530#L293 assume !(0 == ~c1_st~0); 10529#L296 assume !(0 == ~c2_st~0); 10528#L299 assume !(0 == ~wb_st~0); 10527#L302 assume !(0 == ~r_st~0); 10526#L387 start_simulation_~kernel_st~0 := 2; 10441#L542 assume !(1 == ~c_req_up~0); 9940#L542-2 start_simulation_~kernel_st~0 := 3; 9963#L554 assume !(0 == ~e_f~0); 9932#L554-2 assume !(0 == ~e_g~0); 9933#L559-1 assume !(0 == ~e_e~0); 9981#L564-1 assume !(0 == ~e_c~0); 10008#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 9844#L574-1 assume 1 == ~wl_pc~0; 9845#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 9810#L587 assume !(1 == ~c1_pc~0); 9960#L597 assume !(1 == ~c2_pc~0); 9889#L606 assume !(1 == ~wb_pc~0); 9896#L615 assume !(1 == ~e_c~0); 9897#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 10041#L629-1 assume !(1 == ~e_f~0); 10499#L634-1 assume !(1 == ~e_g~0); 9918#L639-1 assume !(1 == ~e_c~0); 10542#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10539#L649-1 assume 0 == ~wl_st~0; 10535#L666-1 assume !false; 10456#L536 [2019-10-22 08:55:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash -666236546, now seen corresponding path program 1 times [2019-10-22 08:55:44,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:44,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712188866] [2019-10-22 08:55:44,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:44,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:44,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:44,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712188866] [2019-10-22 08:55:44,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:44,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:44,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400748693] [2019-10-22 08:55:44,036 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:44,036 INFO L82 PathProgramCache]: Analyzing trace with hash -311766517, now seen corresponding path program 1 times [2019-10-22 08:55:44,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:44,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495476545] [2019-10-22 08:55:44,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:44,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:44,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:44,045 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:44,180 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:44,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:44,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:44,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:44,181 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:44,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,181 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:44,181 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:44,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration9_Loop [2019-10-22 08:55:44,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:44,181 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:44,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,463 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:44,463 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:44,474 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,474 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:44,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,481 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,485 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,485 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=7} Honda state: {~r_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:44,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,492 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,495 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,495 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:44,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,504 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,507 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,507 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:44,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,513 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,518 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,518 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:44,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,525 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,529 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,529 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:44,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,536 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,540 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,540 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_g~0=-1} Honda state: {~e_g~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:44,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,547 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,550 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,550 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet1=0} Honda state: {ULTIMATE.start_eval_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:44,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,560 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,565 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,566 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=7} Honda state: {~wb_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:44,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,581 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:44,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:44,619 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:44,621 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:44,621 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:44,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:44,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:44,622 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:44,622 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,622 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:44,622 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:44,622 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration9_Loop [2019-10-22 08:55:44,622 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:44,622 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:44,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:44,955 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:44,956 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:44,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,957 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,957 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,957 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:44,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:44,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:44,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,962 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:44,962 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,962 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:44,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:44,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,964 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:44,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,964 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:44,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:44,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,967 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,967 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:44,968 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,968 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:44,969 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:44,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,971 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,971 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,972 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,972 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:44,972 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,972 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:44,972 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:44,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,974 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,974 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:44,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,975 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:44,975 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:44,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,978 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,978 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:44,978 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,978 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:44,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:44,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,980 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,980 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:44,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,980 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:44,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:44,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,982 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,983 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:44,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,983 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:44,983 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:44,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,991 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,991 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:44,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,991 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:44,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:44,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:44,993 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:44,993 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:44,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:44,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:44,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:44,994 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:44,994 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:44,996 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:44,999 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:45,000 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:55:45,000 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:45,000 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:45,000 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:45,000 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -2*~e_e~0 + 3 Supporting invariants [] [2019-10-22 08:55:45,001 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:45,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:45,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:45,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:45,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:45,061 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:45,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 894 states and 1493 transitions. cyclomatic complexity: 608 Second operand 4 states. [2019-10-22 08:55:45,095 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 894 states and 1493 transitions. cyclomatic complexity: 608. Second operand 4 states. Result 2509 states and 4176 transitions. Complement of second has 5 states. [2019-10-22 08:55:45,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:55:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2019-10-22 08:55:45,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 25 letters. Loop has 28 letters. [2019-10-22 08:55:45,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:45,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 53 letters. Loop has 28 letters. [2019-10-22 08:55:45,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:45,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 25 letters. Loop has 56 letters. [2019-10-22 08:55:45,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:45,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2509 states and 4176 transitions. [2019-10-22 08:55:45,112 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1064 [2019-10-22 08:55:45,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2509 states to 2509 states and 4176 transitions. [2019-10-22 08:55:45,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1144 [2019-10-22 08:55:45,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1165 [2019-10-22 08:55:45,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2509 states and 4176 transitions. [2019-10-22 08:55:45,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:45,125 INFO L688 BuchiCegarLoop]: Abstraction has 2509 states and 4176 transitions. [2019-10-22 08:55:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states and 4176 transitions. [2019-10-22 08:55:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2488. [2019-10-22 08:55:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2019-10-22 08:55:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 4141 transitions. [2019-10-22 08:55:45,167 INFO L711 BuchiCegarLoop]: Abstraction has 2488 states and 4141 transitions. [2019-10-22 08:55:45,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:45,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:45,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:45,169 INFO L87 Difference]: Start difference. First operand 2488 states and 4141 transitions. Second operand 4 states. [2019-10-22 08:55:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:45,246 INFO L93 Difference]: Finished difference Result 3187 states and 5219 transitions. [2019-10-22 08:55:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:45,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3187 states and 5219 transitions. [2019-10-22 08:55:45,263 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1227 [2019-10-22 08:55:45,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3187 states to 3187 states and 5219 transitions. [2019-10-22 08:55:45,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2019-10-22 08:55:45,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2019-10-22 08:55:45,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3187 states and 5219 transitions. [2019-10-22 08:55:45,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:45,281 INFO L688 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2019-10-22 08:55:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states and 5219 transitions. [2019-10-22 08:55:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3187. [2019-10-22 08:55:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3187 states. [2019-10-22 08:55:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 5219 transitions. [2019-10-22 08:55:45,335 INFO L711 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2019-10-22 08:55:45,335 INFO L591 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2019-10-22 08:55:45,335 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:55:45,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3187 states and 5219 transitions. [2019-10-22 08:55:45,348 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1227 [2019-10-22 08:55:45,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:45,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:45,349 INFO L849 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] [2019-10-22 08:55:45,351 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:45,351 INFO L791 eck$LassoCheckResult]: Stem: 19290#ULTIMATE.startENTRY ~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; 19102#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; 19055#L398 assume !(1 == ~c_req_up~0); 19057#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 19062#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 19063#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 19222#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 19223#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 19271#L429-1 assume !(0 == ~e_f~0); 19344#L434-1 assume !(0 == ~e_g~0); 19147#L439-1 assume !(0 == ~e_e~0); 19148#L444-1 assume !(0 == ~e_c~0); 19343#L449-1 assume !(0 == ~e_wl~0); 19298#L454-1 assume !(1 == ~wl_pc~0); 19207#L466 assume !(2 == ~wl_pc~0); 19208#L467 assume !(1 == ~c1_pc~0); 19324#L477 assume !(1 == ~c2_pc~0); 19336#L486 assume !(1 == ~wb_pc~0); 19317#L495 assume !(1 == ~e_c~0); 19262#L504-1 assume !(1 == ~e_e~0); 19263#L509-1 assume !(1 == ~e_f~0); 19322#L514-1 assume !(1 == ~e_g~0); 19120#L519-1 assume !(1 == ~e_c~0); 19121#L524-1 assume !(1 == ~e_wl~0); 19425#L666-1 assume !false; 19426#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 20838#L371 [2019-10-22 08:55:45,351 INFO L793 eck$LassoCheckResult]: Loop: 20838#L371 assume !false; 21690#L289 assume 0 == ~wl_st~0; 21685#L302-1 assume !(0 == ~wl_st~0); 21679#L311 assume !(0 == ~c1_st~0); 21676#L326 assume !(0 == ~c2_st~0); 21667#L341 assume !(0 == ~wb_st~0); 21664#L356 assume !(0 == ~r_st~0); 20838#L371 [2019-10-22 08:55:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2019-10-22 08:55:45,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920561764] [2019-10-22 08:55:45,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,368 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,371 INFO L82 PathProgramCache]: Analyzing trace with hash 117964263, now seen corresponding path program 1 times [2019-10-22 08:55:45,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16064777] [2019-10-22 08:55:45,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:45,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16064777] [2019-10-22 08:55:45,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:45,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:45,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383046648] [2019-10-22 08:55:45,381 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:45,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:45,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:45,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:45,382 INFO L87 Difference]: Start difference. First operand 3187 states and 5219 transitions. cyclomatic complexity: 2068 Second operand 3 states. [2019-10-22 08:55:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:45,436 INFO L93 Difference]: Finished difference Result 4973 states and 7999 transitions. [2019-10-22 08:55:45,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:45,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4973 states and 7999 transitions. [2019-10-22 08:55:45,459 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1926 [2019-10-22 08:55:45,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4973 states to 4973 states and 7999 transitions. [2019-10-22 08:55:45,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1992 [2019-10-22 08:55:45,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1992 [2019-10-22 08:55:45,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4973 states and 7999 transitions. [2019-10-22 08:55:45,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:45,484 INFO L688 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2019-10-22 08:55:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states and 7999 transitions. [2019-10-22 08:55:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4973. [2019-10-22 08:55:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4973 states. [2019-10-22 08:55:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 7999 transitions. [2019-10-22 08:55:45,553 INFO L711 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2019-10-22 08:55:45,553 INFO L591 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2019-10-22 08:55:45,553 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:55:45,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4973 states and 7999 transitions. [2019-10-22 08:55:45,567 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1926 [2019-10-22 08:55:45,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:45,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:45,567 INFO L849 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] [2019-10-22 08:55:45,567 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:45,568 INFO L791 eck$LassoCheckResult]: Stem: 27454#ULTIMATE.startENTRY ~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; 27270#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; 27221#L398 assume !(1 == ~c_req_up~0); 27223#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 27228#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 27229#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 27385#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 27386#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 27435#L429-1 assume !(0 == ~e_f~0); 27509#L434-1 assume !(0 == ~e_g~0); 27311#L439-1 assume !(0 == ~e_e~0); 27312#L444-1 assume !(0 == ~e_c~0); 27508#L449-1 assume !(0 == ~e_wl~0); 27461#L454-1 assume !(1 == ~wl_pc~0); 27373#L466 assume !(2 == ~wl_pc~0); 27374#L467 assume !(1 == ~c1_pc~0); 27488#L477 assume !(1 == ~c2_pc~0); 27501#L486 assume !(1 == ~wb_pc~0); 27483#L495 assume !(1 == ~e_c~0); 27426#L504-1 assume !(1 == ~e_e~0); 27427#L509-1 assume !(1 == ~e_f~0); 27486#L514-1 assume !(1 == ~e_g~0); 27286#L519-1 assume !(1 == ~e_c~0); 27287#L524-1 assume !(1 == ~e_wl~0); 27360#L666-1 assume !false; 28735#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 30068#L371 [2019-10-22 08:55:45,568 INFO L793 eck$LassoCheckResult]: Loop: 30068#L371 assume !false; 31131#L289 assume 0 == ~wl_st~0; 31003#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 31120#L315 assume !(0 != eval_~tmp~0); 31129#L311 assume !(0 == ~c1_st~0); 31161#L326 assume !(0 == ~c2_st~0); 31147#L341 assume !(0 == ~wb_st~0); 31140#L356 assume !(0 == ~r_st~0); 30068#L371 [2019-10-22 08:55:45,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,568 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2019-10-22 08:55:45,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675685547] [2019-10-22 08:55:45,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,581 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1280783410, now seen corresponding path program 1 times [2019-10-22 08:55:45,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530563364] [2019-10-22 08:55:45,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,588 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,588 INFO L82 PathProgramCache]: Analyzing trace with hash 361828906, now seen corresponding path program 1 times [2019-10-22 08:55:45,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343951472] [2019-10-22 08:55:45,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:45,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343951472] [2019-10-22 08:55:45,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:45,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:45,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085312159] [2019-10-22 08:55:45,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:45,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:45,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:45,626 INFO L87 Difference]: Start difference. First operand 4973 states and 7999 transitions. cyclomatic complexity: 3062 Second operand 3 states. [2019-10-22 08:55:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:45,674 INFO L93 Difference]: Finished difference Result 7644 states and 12212 transitions. [2019-10-22 08:55:45,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:45,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7644 states and 12212 transitions. [2019-10-22 08:55:45,702 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2986 [2019-10-22 08:55:45,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7644 states to 7644 states and 12212 transitions. [2019-10-22 08:55:45,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3054 [2019-10-22 08:55:45,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3054 [2019-10-22 08:55:45,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7644 states and 12212 transitions. [2019-10-22 08:55:45,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:45,742 INFO L688 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2019-10-22 08:55:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7644 states and 12212 transitions. [2019-10-22 08:55:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7644 to 7644. [2019-10-22 08:55:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7644 states. [2019-10-22 08:55:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 12212 transitions. [2019-10-22 08:55:45,853 INFO L711 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2019-10-22 08:55:45,853 INFO L591 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2019-10-22 08:55:45,853 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:55:45,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7644 states and 12212 transitions. [2019-10-22 08:55:45,874 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2986 [2019-10-22 08:55:45,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:45,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:45,875 INFO L849 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] [2019-10-22 08:55:45,875 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:45,875 INFO L791 eck$LassoCheckResult]: Stem: 40073#ULTIMATE.startENTRY ~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; 39895#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; 39846#L398 assume !(1 == ~c_req_up~0); 39848#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 39853#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 39854#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 40014#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 40015#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 40056#L429-1 assume !(0 == ~e_f~0); 40131#L434-1 assume !(0 == ~e_g~0); 39938#L439-1 assume !(0 == ~e_e~0); 39939#L444-1 assume !(0 == ~e_c~0); 40130#L449-1 assume !(0 == ~e_wl~0); 40080#L454-1 assume !(1 == ~wl_pc~0); 40001#L466 assume !(2 == ~wl_pc~0); 40002#L467 assume !(1 == ~c1_pc~0); 40108#L477 assume !(1 == ~c2_pc~0); 40123#L486 assume !(1 == ~wb_pc~0); 40101#L495 assume !(1 == ~e_c~0); 40045#L504-1 assume !(1 == ~e_e~0); 40046#L509-1 assume !(1 == ~e_f~0); 40105#L514-1 assume !(1 == ~e_g~0); 39912#L519-1 assume !(1 == ~e_c~0); 39913#L524-1 assume !(1 == ~e_wl~0); 39988#L666-1 assume !false; 42263#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 45127#L371 [2019-10-22 08:55:45,875 INFO L793 eck$LassoCheckResult]: Loop: 45127#L371 assume !false; 47432#L289 assume 0 == ~wl_st~0; 40114#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 39963#L315 assume !(0 != eval_~tmp~0); 39964#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 45144#L330 assume !(0 != eval_~tmp___0~0); 45143#L326 assume !(0 == ~c2_st~0); 45131#L341 assume !(0 == ~wb_st~0); 45128#L356 assume !(0 == ~r_st~0); 45127#L371 [2019-10-22 08:55:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2019-10-22 08:55:45,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65382351] [2019-10-22 08:55:45,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,939 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,940 INFO L82 PathProgramCache]: Analyzing trace with hash 998807808, now seen corresponding path program 1 times [2019-10-22 08:55:45,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388214878] [2019-10-22 08:55:45,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,946 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1718978040, now seen corresponding path program 1 times [2019-10-22 08:55:45,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990232544] [2019-10-22 08:55:45,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:45,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990232544] [2019-10-22 08:55:45,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:45,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:45,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560559444] [2019-10-22 08:55:45,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:45,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:45,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:45,990 INFO L87 Difference]: Start difference. First operand 7644 states and 12212 transitions. cyclomatic complexity: 4604 Second operand 3 states. [2019-10-22 08:55:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:46,051 INFO L93 Difference]: Finished difference Result 12085 states and 19155 transitions. [2019-10-22 08:55:46,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:46,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12085 states and 19155 transitions. [2019-10-22 08:55:46,096 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-10-22 08:55:46,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12085 states to 12085 states and 19155 transitions. [2019-10-22 08:55:46,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4860 [2019-10-22 08:55:46,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4860 [2019-10-22 08:55:46,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12085 states and 19155 transitions. [2019-10-22 08:55:46,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:46,142 INFO L688 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2019-10-22 08:55:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12085 states and 19155 transitions. [2019-10-22 08:55:46,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12085 to 12085. [2019-10-22 08:55:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12085 states. [2019-10-22 08:55:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12085 states to 12085 states and 19155 transitions. [2019-10-22 08:55:46,291 INFO L711 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2019-10-22 08:55:46,291 INFO L591 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2019-10-22 08:55:46,291 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 08:55:46,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12085 states and 19155 transitions. [2019-10-22 08:55:46,320 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-10-22 08:55:46,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:46,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:46,321 INFO L849 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] [2019-10-22 08:55:46,321 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:46,321 INFO L791 eck$LassoCheckResult]: Stem: 59828#ULTIMATE.startENTRY ~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; 59630#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; 59583#L398 assume !(1 == ~c_req_up~0); 59585#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 59590#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 59591#L414-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 59916#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 59805#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 59806#L429-1 assume !(0 == ~e_f~0); 59911#L434-1 assume !(0 == ~e_g~0); 59912#L439-1 assume !(0 == ~e_e~0); 59908#L444-1 assume !(0 == ~e_c~0); 59909#L449-1 assume !(0 == ~e_wl~0); 59835#L454-1 assume !(1 == ~wl_pc~0); 59836#L466 assume !(2 == ~wl_pc~0); 59873#L467 assume !(1 == ~c1_pc~0); 59872#L477 assume !(1 == ~c2_pc~0); 59894#L486 assume !(1 == ~wb_pc~0); 59893#L495 assume !(1 == ~e_c~0); 59797#L504-1 assume !(1 == ~e_e~0); 59798#L509-1 assume !(1 == ~e_f~0); 59868#L514-1 assume !(1 == ~e_g~0); 59869#L519-1 assume !(1 == ~e_c~0); 63968#L524-1 assume !(1 == ~e_wl~0); 63963#L666-1 assume !false; 63964#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 67491#L371 [2019-10-22 08:55:46,322 INFO L793 eck$LassoCheckResult]: Loop: 67491#L371 assume !false; 67695#L289 assume 0 == ~wl_st~0; 67682#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 67675#L315 assume !(0 != eval_~tmp~0); 67689#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 67708#L330 assume !(0 != eval_~tmp___0~0); 67706#L326 assume !(0 == ~c2_st~0); 67703#L341 assume !(0 == ~wb_st~0); 67700#L356 assume !(0 == ~r_st~0); 67491#L371 [2019-10-22 08:55:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2019-10-22 08:55:46,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051329575] [2019-10-22 08:55:46,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:46,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051329575] [2019-10-22 08:55:46,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:46,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:46,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371075338] [2019-10-22 08:55:46,335 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash 998807808, now seen corresponding path program 2 times [2019-10-22 08:55:46,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788462656] [2019-10-22 08:55:46,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,340 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:46,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:46,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:46,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:46,366 INFO L87 Difference]: Start difference. First operand 12085 states and 19155 transitions. cyclomatic complexity: 7106 Second operand 3 states. [2019-10-22 08:55:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:46,399 INFO L93 Difference]: Finished difference Result 12033 states and 19068 transitions. [2019-10-22 08:55:46,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:46,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12033 states and 19068 transitions. [2019-10-22 08:55:46,438 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-10-22 08:55:46,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12033 states to 12033 states and 19068 transitions. [2019-10-22 08:55:46,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4810 [2019-10-22 08:55:46,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4810 [2019-10-22 08:55:46,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12033 states and 19068 transitions. [2019-10-22 08:55:46,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:46,480 INFO L688 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2019-10-22 08:55:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12033 states and 19068 transitions. [2019-10-22 08:55:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12033 to 12033. [2019-10-22 08:55:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12033 states. [2019-10-22 08:55:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12033 states to 12033 states and 19068 transitions. [2019-10-22 08:55:46,623 INFO L711 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2019-10-22 08:55:46,623 INFO L591 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2019-10-22 08:55:46,623 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 08:55:46,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12033 states and 19068 transitions. [2019-10-22 08:55:46,651 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-10-22 08:55:46,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:46,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:46,652 INFO L849 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] [2019-10-22 08:55:46,652 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:46,652 INFO L791 eck$LassoCheckResult]: Stem: 83946#ULTIMATE.startENTRY ~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; 83750#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; 83707#L398 assume !(1 == ~c_req_up~0); 83709#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 83714#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 83715#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 83877#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 83878#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 83924#L429-1 assume !(0 == ~e_f~0); 84009#L434-1 assume !(0 == ~e_g~0); 83802#L439-1 assume !(0 == ~e_e~0); 83803#L444-1 assume !(0 == ~e_c~0); 84008#L449-1 assume !(0 == ~e_wl~0); 83954#L454-1 assume !(1 == ~wl_pc~0); 83864#L466 assume !(2 == ~wl_pc~0); 83865#L467 assume !(1 == ~c1_pc~0); 83984#L477 assume !(1 == ~c2_pc~0); 84001#L486 assume !(1 == ~wb_pc~0); 83978#L495 assume !(1 == ~e_c~0); 83915#L504-1 assume !(1 == ~e_e~0); 83916#L509-1 assume !(1 == ~e_f~0); 83982#L514-1 assume !(1 == ~e_g~0); 83775#L519-1 assume !(1 == ~e_c~0); 83776#L524-1 assume !(1 == ~e_wl~0); 83851#L666-1 assume !false; 86384#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 91989#L371 [2019-10-22 08:55:46,652 INFO L793 eck$LassoCheckResult]: Loop: 91989#L371 assume !false; 91753#L289 assume 0 == ~wl_st~0; 91748#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 91686#L315 assume !(0 != eval_~tmp~0); 91590#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91588#L330 assume !(0 != eval_~tmp___0~0); 91586#L326 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 91571#L345 assume !(0 != eval_~tmp___1~0); 91581#L341 assume !(0 == ~wb_st~0); 91992#L356 assume !(0 == ~r_st~0); 91989#L371 [2019-10-22 08:55:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2019-10-22 08:55:46,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279118673] [2019-10-22 08:55:46,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,663 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:46,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,664 INFO L82 PathProgramCache]: Analyzing trace with hash 896651005, now seen corresponding path program 1 times [2019-10-22 08:55:46,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735281735] [2019-10-22 08:55:46,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,669 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1750331659, now seen corresponding path program 1 times [2019-10-22 08:55:46,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736691899] [2019-10-22 08:55:46,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:46,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736691899] [2019-10-22 08:55:46,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:46,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:46,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119791420] [2019-10-22 08:55:46,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:46,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:46,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:46,730 INFO L87 Difference]: Start difference. First operand 12033 states and 19068 transitions. cyclomatic complexity: 7071 Second operand 3 states. [2019-10-22 08:55:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:46,801 INFO L93 Difference]: Finished difference Result 18669 states and 29460 transitions. [2019-10-22 08:55:46,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:46,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18669 states and 29460 transitions. [2019-10-22 08:55:46,872 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7424 [2019-10-22 08:55:46,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18669 states to 18669 states and 29460 transitions. [2019-10-22 08:55:46,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7496 [2019-10-22 08:55:46,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7496 [2019-10-22 08:55:46,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18669 states and 29460 transitions. [2019-10-22 08:55:46,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:46,959 INFO L688 BuchiCegarLoop]: Abstraction has 18669 states and 29460 transitions. [2019-10-22 08:55:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18669 states and 29460 transitions. [2019-10-22 08:55:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18669 to 18549. [2019-10-22 08:55:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18549 states. [2019-10-22 08:55:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18549 states to 18549 states and 29340 transitions. [2019-10-22 08:55:47,304 INFO L711 BuchiCegarLoop]: Abstraction has 18549 states and 29340 transitions. [2019-10-22 08:55:47,304 INFO L591 BuchiCegarLoop]: Abstraction has 18549 states and 29340 transitions. [2019-10-22 08:55:47,304 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-10-22 08:55:47,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18549 states and 29340 transitions. [2019-10-22 08:55:47,351 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7376 [2019-10-22 08:55:47,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:47,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:47,351 INFO L849 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] [2019-10-22 08:55:47,351 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:47,352 INFO L791 eck$LassoCheckResult]: Stem: 114662#ULTIMATE.startENTRY ~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; 114464#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; 114417#L398 assume !(1 == ~c_req_up~0); 114419#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 114424#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 114425#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 114584#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 114585#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 114635#L429-1 assume !(0 == ~e_f~0); 114737#L434-1 assume !(0 == ~e_g~0); 114508#L439-1 assume !(0 == ~e_e~0); 114509#L444-1 assume !(0 == ~e_c~0); 114736#L449-1 assume !(0 == ~e_wl~0); 114671#L454-1 assume !(1 == ~wl_pc~0); 114571#L466 assume !(2 == ~wl_pc~0); 114572#L467 assume !(1 == ~c1_pc~0); 114710#L477 assume !(1 == ~c2_pc~0); 114729#L486 assume !(1 == ~wb_pc~0); 114703#L495 assume !(1 == ~e_c~0); 114627#L504-1 assume !(1 == ~e_e~0); 114628#L509-1 assume !(1 == ~e_f~0); 114706#L514-1 assume !(1 == ~e_g~0); 114482#L519-1 assume !(1 == ~e_c~0); 114483#L524-1 assume !(1 == ~e_wl~0); 114558#L666-1 assume !false; 120203#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 127280#L371 [2019-10-22 08:55:47,352 INFO L793 eck$LassoCheckResult]: Loop: 127280#L371 assume !false; 126072#L289 assume 0 == ~wl_st~0; 126071#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 126063#L315 assume !(0 != eval_~tmp~0); 126070#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 126221#L330 assume !(0 != eval_~tmp___0~0); 126219#L326 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 126206#L345 assume !(0 != eval_~tmp___1~0); 126215#L341 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 127228#L360 assume !(0 != eval_~tmp___2~0); 127238#L356 assume !(0 == ~r_st~0); 127280#L371 [2019-10-22 08:55:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 5 times [2019-10-22 08:55:47,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478751858] [2019-10-22 08:55:47,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,363 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2026342965, now seen corresponding path program 1 times [2019-10-22 08:55:47,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973774369] [2019-10-22 08:55:47,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,369 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1574259005, now seen corresponding path program 1 times [2019-10-22 08:55:47,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918604185] [2019-10-22 08:55:47,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,382 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:47,791 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2019-10-22 08:55:47,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:47 BoogieIcfgContainer [2019-10-22 08:55:47,887 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:47,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:47,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:47,888 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:47,888 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:40" (3/4) ... [2019-10-22 08:55:47,891 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 08:55:47,954 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_38bdc3c1-7cf0-48a8-bf66-80a6bec1058c/bin/uautomizer/witness.graphml [2019-10-22 08:55:47,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:47,958 INFO L168 Benchmark]: Toolchain (without parser) took 8625.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.6 MB). Free memory was 939.1 MB in the beginning and 926.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 251.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,958 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:47,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,959 INFO L168 Benchmark]: Boogie Preprocessor took 55.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,960 INFO L168 Benchmark]: RCFGBuilder took 622.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,960 INFO L168 Benchmark]: BuchiAutomizer took 7442.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.6 MB). Free memory was 1.1 GB in the beginning and 936.1 MB in the end (delta: 131.8 MB). Peak memory consumption was 242.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,961 INFO L168 Benchmark]: Witness Printer took 68.95 ms. Allocated memory is still 1.3 GB. Free memory was 936.1 MB in the beginning and 926.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,962 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 622.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7442.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.6 MB). Free memory was 1.1 GB in the beginning and 936.1 MB in the end (delta: 131.8 MB). Peak memory consumption was 242.4 MB. Max. memory is 11.5 GB. * Witness Printer took 68.95 ms. Allocated memory is still 1.3 GB. Free memory was 936.1 MB in the beginning and 926.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (14 trivial, 3 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 -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * e_e + 3 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 18549 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.3s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 1274 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 18549 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4151 SDtfs, 4004 SDslu, 2207 SDs, 0 SdLazy, 345 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 288]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p_out=0, wb_st=0, processed=0, \result=0, c2_st=0, wl_pc=0, e_wl=2, tmp=0, e_c=2, e_e=2, kernel_st=1, e_p_in=0, tmp___1=0, t_b=0, tmp___2=0, p_in=0, wb_pc=0, data=0, tmp___0=0, wb_i=1, c_req_up=0, tmp___3=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@640d2fb4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f36f75f=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30b833b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bff1f14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60da6c33=0, r_i=0, d=0, e_f=2, e_g=2, r_st=2, __retres1=0, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 288]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L683] int __retres1 ; [L687] e_wl = 2 [L688] e_c = e_wl [L689] e_g = e_c [L690] e_f = e_g [L691] e_e = e_f [L692] wl_pc = 0 [L693] c1_pc = 0 [L694] c2_pc = 0 [L695] wb_pc = 0 [L696] wb_i = 1 [L697] c2_i = wb_i [L698] c1_i = c2_i [L699] wl_i = c1_i [L700] r_i = 0 [L701] c_req_up = 0 [L702] d = 0 [L703] c = 0 [L394] int kernel_st ; [L397] kernel_st = 0 [L398] COND FALSE !((int )c_req_up == 1) [L409] COND TRUE (int )wl_i == 1 [L410] wl_st = 0 [L414] COND TRUE (int )c1_i == 1 [L415] c1_st = 0 [L419] COND TRUE (int )c2_i == 1 [L420] c2_st = 0 [L424] COND TRUE (int )wb_i == 1 [L425] wb_st = 0 [L429] COND FALSE !((int )r_i == 1) [L432] r_st = 2 [L434] COND FALSE !((int )e_f == 0) [L439] COND FALSE !((int )e_g == 0) [L444] COND FALSE !((int )e_e == 0) [L449] COND FALSE !((int )e_c == 0) [L454] COND FALSE !((int )e_wl == 0) [L459] COND FALSE !((int )wl_pc == 1) [L467] COND FALSE !((int )wl_pc == 2) [L477] COND FALSE !((int )c1_pc == 1) [L486] COND FALSE !((int )c2_pc == 1) [L495] COND FALSE !((int )wb_pc == 1) [L504] COND FALSE !((int )e_c == 1) [L509] COND FALSE !((int )e_e == 1) [L514] COND FALSE !((int )e_f == 1) [L519] COND FALSE !((int )e_g == 1) [L524] COND FALSE !((int )e_c == 1) [L529] COND FALSE !((int )e_wl == 1) [L535] COND TRUE 1 [L538] kernel_st = 1 [L280] int tmp ; [L281] int tmp___0 ; [L282] int tmp___1 ; [L283] int tmp___2 ; [L284] int tmp___3 ; Loop: [L288] COND TRUE 1 [L290] COND TRUE (int )wl_st == 0 [L311] COND TRUE (int )wl_st == 0 [L313] tmp = __VERIFIER_nondet_int() [L315] COND FALSE !(\read(tmp)) [L326] COND TRUE (int )c1_st == 0 [L328] tmp___0 = __VERIFIER_nondet_int() [L330] COND FALSE !(\read(tmp___0)) [L341] COND TRUE (int )c2_st == 0 [L343] tmp___1 = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp___1)) [L356] COND TRUE (int )wb_st == 0 [L358] tmp___2 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp___2)) [L371] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...