./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy2.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_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy2.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/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 c8989412e094655bcf4508d76eb9764ed06d0b34 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:00:40,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:40,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:40,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:40,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:40,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:40,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:40,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:40,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:40,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:40,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:40,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:40,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:40,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:40,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:40,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:40,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:40,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:40,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:40,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:40,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:40,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:40,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:40,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:40,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:40,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:40,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:40,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:40,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:40,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:40,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:40,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:40,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:40,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:40,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:40,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:40,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:40,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:40,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:40,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:40,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:40,240 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:40,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:40,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:40,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:40,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:40,265 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:40,265 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:40,265 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:40,265 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:40,266 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:40,266 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:40,266 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:40,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:40,266 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:40,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:40,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:40,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:40,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:40,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:40,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:40,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:40,268 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:40,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:40,269 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:40,270 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:40,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:40,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:40,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:40,270 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:40,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:40,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:40,271 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:40,271 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:40,272 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_c35a9645-d395-423a-a668-c7ffbefe762b/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 -> c8989412e094655bcf4508d76eb9764ed06d0b34 [2019-10-22 09:00:40,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:40,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:40,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:40,315 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:40,316 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:40,316 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/../../sv-benchmarks/c/systemc/toy2.cil.c [2019-10-22 09:00:40,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/data/ae2083fd7/f11efb190ec9498bb58cafc83583c5ed/FLAG66a35dd6c [2019-10-22 09:00:40,757 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:40,757 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/sv-benchmarks/c/systemc/toy2.cil.c [2019-10-22 09:00:40,764 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/data/ae2083fd7/f11efb190ec9498bb58cafc83583c5ed/FLAG66a35dd6c [2019-10-22 09:00:40,775 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/data/ae2083fd7/f11efb190ec9498bb58cafc83583c5ed [2019-10-22 09:00:40,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:40,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:40,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:40,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:40,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:40,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:40" (1/1) ... [2019-10-22 09:00:40,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4a4101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40, skipping insertion in model container [2019-10-22 09:00:40,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:40" (1/1) ... [2019-10-22 09:00:40,793 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:40,835 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:41,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:41,144 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:41,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:41,218 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:41,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41 WrapperNode [2019-10-22 09:00:41,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:41,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:41,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:41,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:41,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (1/1) ... [2019-10-22 09:00:41,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (1/1) ... [2019-10-22 09:00:41,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:41,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:41,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:41,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:41,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (1/1) ... [2019-10-22 09:00:41,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (1/1) ... [2019-10-22 09:00:41,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (1/1) ... [2019-10-22 09:00:41,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (1/1) ... [2019-10-22 09:00:41,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (1/1) ... [2019-10-22 09:00:41,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (1/1) ... [2019-10-22 09:00:41,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (1/1) ... [2019-10-22 09:00:41,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:41,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:41,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:41,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:41,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/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 09:00:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:41,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:41,820 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:41,820 INFO L284 CfgBuilder]: Removed 26 assume(true) statements. [2019-10-22 09:00:41,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:41 BoogieIcfgContainer [2019-10-22 09:00:41,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:41,822 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:41,822 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:41,825 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:41,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:41,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:40" (1/3) ... [2019-10-22 09:00:41,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2459fc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:41, skipping insertion in model container [2019-10-22 09:00:41,827 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:41,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:41" (2/3) ... [2019-10-22 09:00:41,828 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2459fc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:41, skipping insertion in model container [2019-10-22 09:00:41,828 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:41,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:41" (3/3) ... [2019-10-22 09:00:41,829 INFO L371 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2019-10-22 09:00:41,872 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:41,872 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:41,872 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:41,873 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:41,873 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:41,873 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:41,873 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:41,873 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:41,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states. [2019-10-22 09:00:41,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 09:00:41,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:41,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:41,923 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 09:00:41,923 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 09:00:41,923 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:41,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states. [2019-10-22 09:00:41,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 09:00:41,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:41,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:41,930 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 09:00:41,930 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 09:00:41,937 INFO L791 eck$LassoCheckResult]: Stem: 94#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; 10#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; 74#L394true assume !(1 == ~c_req_up~0); 63#L394-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 61#L405-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 88#L410-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 109#L415-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 4#L420-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 27#L425-1true assume !(0 == ~e_f~0); 54#L430-1true assume !(0 == ~e_g~0); 79#L435-1true assume !(0 == ~e_e~0); 101#L440-1true assume !(0 == ~e_c~0); 122#L445-1true assume !(0 == ~e_wl~0); 21#L450-1true assume !(1 == ~wl_pc~0); 100#L462true assume !(2 == ~wl_pc~0); 67#L463true assume !(1 == ~c1_pc~0); 98#L473true assume !(1 == ~c2_pc~0); 70#L482true assume !(1 == ~wb_pc~0); 42#L491true assume !(1 == ~e_c~0); 120#L500-1true assume !(1 == ~e_e~0); 17#L505-1true assume !(1 == ~e_f~0); 47#L510-1true assume !(1 == ~e_g~0); 71#L515-1true assume !(1 == ~e_c~0); 96#L520-1true assume !(1 == ~e_wl~0); 24#L662-1true [2019-10-22 09:00:41,937 INFO L793 eck$LassoCheckResult]: Loop: 24#L662-1true assume !false; 45#L532true 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; 51#L367true assume !true; 75#L383true start_simulation_~kernel_st~0 := 2; 35#L538true assume !(1 == ~c_req_up~0); 18#L538-2true start_simulation_~kernel_st~0 := 3; 113#L550true assume !(0 == ~e_f~0); 97#L550-2true assume 0 == ~e_g~0;~e_g~0 := 1; 8#L555-1true assume 0 == ~e_e~0;~e_e~0 := 1; 36#L560-1true assume 0 == ~e_c~0;~e_c~0 := 1; 46#L565-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 68#L570-1true assume !(1 == ~wl_pc~0); 34#L582true assume !(2 == ~wl_pc~0); 112#L583true assume !(1 == ~c1_pc~0); 32#L593true assume !(1 == ~c2_pc~0); 125#L602true assume !(1 == ~wb_pc~0); 90#L611true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L620-1true assume !(1 == ~e_e~0); 85#L625-1true assume 1 == ~e_f~0;~e_f~0 := 2; 107#L630-1true assume 1 == ~e_g~0;~e_g~0 := 2; 126#L635-1true assume 1 == ~e_c~0;~e_c~0 := 2; 25#L640-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 40#L645-1true assume 0 == ~wl_st~0; 24#L662-1true [2019-10-22 09:00:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2019-10-22 09:00:41,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:41,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505982556] [2019-10-22 09:00:41,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:41,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:41,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,089 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 09:00:42,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505982556] [2019-10-22 09:00:42,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:42,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735623210] [2019-10-22 09:00:42,095 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,095 INFO L82 PathProgramCache]: Analyzing trace with hash 25607920, now seen corresponding path program 1 times [2019-10-22 09:00:42,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382833444] [2019-10-22 09:00:42,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,104 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 09:00:42,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382833444] [2019-10-22 09:00:42,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:42,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820549875] [2019-10-22 09:00:42,106 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:42,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:00:42,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:00:42,121 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-10-22 09:00:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:42,135 INFO L93 Difference]: Finished difference Result 124 states and 217 transitions. [2019-10-22 09:00:42,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:00:42,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 217 transitions. [2019-10-22 09:00:42,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-10-22 09:00:42,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 212 transitions. [2019-10-22 09:00:42,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-10-22 09:00:42,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-10-22 09:00:42,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 212 transitions. [2019-10-22 09:00:42,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:42,149 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2019-10-22 09:00:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 212 transitions. [2019-10-22 09:00:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-10-22 09:00:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-22 09:00:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 212 transitions. [2019-10-22 09:00:42,182 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2019-10-22 09:00:42,182 INFO L591 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2019-10-22 09:00:42,182 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:42,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 212 transitions. [2019-10-22 09:00:42,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-10-22 09:00:42,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:42,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:42,185 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 09:00:42,186 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 09:00:42,186 INFO L791 eck$LassoCheckResult]: Stem: 369#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; 275#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; 276#L394 assume !(1 == ~c_req_up~0); 278#L394-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 351#L405-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 352#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 366#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 260#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 261#L425-1 assume !(0 == ~e_f~0); 307#L430-1 assume !(0 == ~e_g~0); 344#L435-1 assume !(0 == ~e_e~0); 362#L440-1 assume !(0 == ~e_c~0); 372#L445-1 assume !(0 == ~e_wl~0); 297#L450-1 assume !(1 == ~wl_pc~0); 298#L462 assume !(2 == ~wl_pc~0); 284#L463 assume !(1 == ~c1_pc~0); 356#L473 assume !(1 == ~c2_pc~0); 289#L482 assume !(1 == ~wb_pc~0); 332#L491 assume !(1 == ~e_c~0); 333#L500-1 assume !(1 == ~e_e~0); 290#L505-1 assume !(1 == ~e_f~0); 291#L510-1 assume !(1 == ~e_g~0); 337#L515-1 assume !(1 == ~e_c~0); 358#L520-1 assume !(1 == ~e_wl~0); 301#L662-1 [2019-10-22 09:00:42,186 INFO L793 eck$LassoCheckResult]: Loop: 301#L662-1 assume !false; 303#L532 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; 335#L367 assume !false; 265#L285 assume !(0 == ~wl_st~0); 267#L289 assume !(0 == ~c1_st~0); 365#L292 assume !(0 == ~c2_st~0); 345#L295 assume !(0 == ~wb_st~0); 346#L298 assume !(0 == ~r_st~0); 353#L383 start_simulation_~kernel_st~0 := 2; 322#L538 assume !(1 == ~c_req_up~0); 294#L538-2 start_simulation_~kernel_st~0 := 3; 295#L550 assume !(0 == ~e_f~0); 370#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 271#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 272#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 325#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 336#L570-1 assume 1 == ~wl_pc~0; 350#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 320#L583 assume !(1 == ~c1_pc~0); 315#L593 assume !(1 == ~c2_pc~0); 317#L602 assume !(1 == ~wb_pc~0); 328#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 348#L620-1 assume !(1 == ~e_e~0); 349#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 364#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 374#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 304#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 305#L645-1 assume 0 == ~wl_st~0; 301#L662-1 [2019-10-22 09:00:42,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2019-10-22 09:00:42,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089924462] [2019-10-22 09:00:42,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,216 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 09:00:42,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089924462] [2019-10-22 09:00:42,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:42,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225884165] [2019-10-22 09:00:42,217 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:42,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 1 times [2019-10-22 09:00:42,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013952130] [2019-10-22 09:00:42,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,272 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 09:00:42,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013952130] [2019-10-22 09:00:42,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:42,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016174431] [2019-10-22 09:00:42,273 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:42,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:42,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:42,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:42,274 INFO L87 Difference]: Start difference. First operand 119 states and 212 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-10-22 09:00:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:42,297 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2019-10-22 09:00:42,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:42,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 211 transitions. [2019-10-22 09:00:42,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-10-22 09:00:42,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 211 transitions. [2019-10-22 09:00:42,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-10-22 09:00:42,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-10-22 09:00:42,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 211 transitions. [2019-10-22 09:00:42,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:42,306 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2019-10-22 09:00:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 211 transitions. [2019-10-22 09:00:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-10-22 09:00:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-22 09:00:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 211 transitions. [2019-10-22 09:00:42,317 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2019-10-22 09:00:42,317 INFO L591 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2019-10-22 09:00:42,317 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:42,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 211 transitions. [2019-10-22 09:00:42,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-10-22 09:00:42,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:42,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:42,319 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 09:00:42,319 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 09:00:42,319 INFO L791 eck$LassoCheckResult]: Stem: 614#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; 520#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; 521#L394 assume !(1 == ~c_req_up~0); 523#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 596#L405-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 597#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 611#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 505#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 506#L425-1 assume !(0 == ~e_f~0); 552#L430-1 assume !(0 == ~e_g~0); 589#L435-1 assume !(0 == ~e_e~0); 607#L440-1 assume !(0 == ~e_c~0); 617#L445-1 assume !(0 == ~e_wl~0); 542#L450-1 assume !(1 == ~wl_pc~0); 543#L462 assume !(2 == ~wl_pc~0); 529#L463 assume !(1 == ~c1_pc~0); 601#L473 assume !(1 == ~c2_pc~0); 534#L482 assume !(1 == ~wb_pc~0); 577#L491 assume !(1 == ~e_c~0); 578#L500-1 assume !(1 == ~e_e~0); 535#L505-1 assume !(1 == ~e_f~0); 536#L510-1 assume !(1 == ~e_g~0); 582#L515-1 assume !(1 == ~e_c~0); 603#L520-1 assume !(1 == ~e_wl~0); 546#L662-1 [2019-10-22 09:00:42,319 INFO L793 eck$LassoCheckResult]: Loop: 546#L662-1 assume !false; 548#L532 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; 580#L367 assume !false; 510#L285 assume !(0 == ~wl_st~0); 512#L289 assume !(0 == ~c1_st~0); 610#L292 assume !(0 == ~c2_st~0); 590#L295 assume !(0 == ~wb_st~0); 591#L298 assume !(0 == ~r_st~0); 598#L383 start_simulation_~kernel_st~0 := 2; 567#L538 assume !(1 == ~c_req_up~0); 539#L538-2 start_simulation_~kernel_st~0 := 3; 540#L550 assume !(0 == ~e_f~0); 615#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 516#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 517#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 570#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 581#L570-1 assume 1 == ~wl_pc~0; 595#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 565#L583 assume !(1 == ~c1_pc~0); 560#L593 assume !(1 == ~c2_pc~0); 562#L602 assume !(1 == ~wb_pc~0); 573#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 593#L620-1 assume !(1 == ~e_e~0); 594#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 609#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 619#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 549#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 550#L645-1 assume 0 == ~wl_st~0; 546#L662-1 [2019-10-22 09:00:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2019-10-22 09:00:42,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083666943] [2019-10-22 09:00:42,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,376 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 09:00:42,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083666943] [2019-10-22 09:00:42,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:42,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65075503] [2019-10-22 09:00:42,377 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:42,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 2 times [2019-10-22 09:00:42,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099090514] [2019-10-22 09:00:42,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,398 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 09:00:42,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099090514] [2019-10-22 09:00:42,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:42,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205384866] [2019-10-22 09:00:42,399 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:42,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:42,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:42,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:42,399 INFO L87 Difference]: Start difference. First operand 119 states and 211 transitions. cyclomatic complexity: 93 Second operand 3 states. [2019-10-22 09:00:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:42,410 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2019-10-22 09:00:42,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:42,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 210 transitions. [2019-10-22 09:00:42,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-10-22 09:00:42,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 210 transitions. [2019-10-22 09:00:42,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-10-22 09:00:42,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-10-22 09:00:42,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 210 transitions. [2019-10-22 09:00:42,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:42,414 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2019-10-22 09:00:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 210 transitions. [2019-10-22 09:00:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-10-22 09:00:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-22 09:00:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 210 transitions. [2019-10-22 09:00:42,419 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2019-10-22 09:00:42,419 INFO L591 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2019-10-22 09:00:42,419 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:42,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 210 transitions. [2019-10-22 09:00:42,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-10-22 09:00:42,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:42,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:42,422 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 09:00:42,422 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 09:00:42,422 INFO L791 eck$LassoCheckResult]: Stem: 859#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; 765#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; 766#L394 assume !(1 == ~c_req_up~0); 768#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 841#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 842#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 856#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 750#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 751#L425-1 assume !(0 == ~e_f~0); 797#L430-1 assume !(0 == ~e_g~0); 834#L435-1 assume !(0 == ~e_e~0); 852#L440-1 assume !(0 == ~e_c~0); 862#L445-1 assume !(0 == ~e_wl~0); 787#L450-1 assume !(1 == ~wl_pc~0); 788#L462 assume !(2 == ~wl_pc~0); 774#L463 assume !(1 == ~c1_pc~0); 846#L473 assume !(1 == ~c2_pc~0); 779#L482 assume !(1 == ~wb_pc~0); 822#L491 assume !(1 == ~e_c~0); 823#L500-1 assume !(1 == ~e_e~0); 780#L505-1 assume !(1 == ~e_f~0); 781#L510-1 assume !(1 == ~e_g~0); 827#L515-1 assume !(1 == ~e_c~0); 848#L520-1 assume !(1 == ~e_wl~0); 791#L662-1 [2019-10-22 09:00:42,422 INFO L793 eck$LassoCheckResult]: Loop: 791#L662-1 assume !false; 793#L532 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; 825#L367 assume !false; 755#L285 assume !(0 == ~wl_st~0); 757#L289 assume !(0 == ~c1_st~0); 855#L292 assume !(0 == ~c2_st~0); 835#L295 assume !(0 == ~wb_st~0); 836#L298 assume !(0 == ~r_st~0); 843#L383 start_simulation_~kernel_st~0 := 2; 812#L538 assume !(1 == ~c_req_up~0); 784#L538-2 start_simulation_~kernel_st~0 := 3; 785#L550 assume !(0 == ~e_f~0); 860#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 761#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 762#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 815#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 826#L570-1 assume 1 == ~wl_pc~0; 840#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 810#L583 assume !(1 == ~c1_pc~0); 805#L593 assume !(1 == ~c2_pc~0); 807#L602 assume !(1 == ~wb_pc~0); 818#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 838#L620-1 assume !(1 == ~e_e~0); 839#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 854#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 864#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 794#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 795#L645-1 assume 0 == ~wl_st~0; 791#L662-1 [2019-10-22 09:00:42,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2019-10-22 09:00:42,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734350741] [2019-10-22 09:00:42,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,444 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 09:00:42,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734350741] [2019-10-22 09:00:42,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:42,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828440730] [2019-10-22 09:00:42,445 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 3 times [2019-10-22 09:00:42,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456645724] [2019-10-22 09:00:42,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,475 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 09:00:42,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456645724] [2019-10-22 09:00:42,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:42,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683857588] [2019-10-22 09:00:42,477 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:42,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:42,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:42,477 INFO L87 Difference]: Start difference. First operand 119 states and 210 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-10-22 09:00:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:42,487 INFO L93 Difference]: Finished difference Result 119 states and 209 transitions. [2019-10-22 09:00:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:42,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 209 transitions. [2019-10-22 09:00:42,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-10-22 09:00:42,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 209 transitions. [2019-10-22 09:00:42,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-10-22 09:00:42,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-10-22 09:00:42,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 209 transitions. [2019-10-22 09:00:42,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:42,491 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2019-10-22 09:00:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 209 transitions. [2019-10-22 09:00:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-10-22 09:00:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-22 09:00:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 209 transitions. [2019-10-22 09:00:42,496 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2019-10-22 09:00:42,496 INFO L591 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2019-10-22 09:00:42,496 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:42,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 209 transitions. [2019-10-22 09:00:42,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-10-22 09:00:42,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:42,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:42,498 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 09:00:42,498 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 09:00:42,499 INFO L791 eck$LassoCheckResult]: Stem: 1104#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; 1010#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; 1011#L394 assume !(1 == ~c_req_up~0); 1013#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1086#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1087#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1101#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 995#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 996#L425-1 assume !(0 == ~e_f~0); 1042#L430-1 assume !(0 == ~e_g~0); 1079#L435-1 assume !(0 == ~e_e~0); 1097#L440-1 assume !(0 == ~e_c~0); 1107#L445-1 assume !(0 == ~e_wl~0); 1032#L450-1 assume !(1 == ~wl_pc~0); 1033#L462 assume !(2 == ~wl_pc~0); 1019#L463 assume !(1 == ~c1_pc~0); 1091#L473 assume !(1 == ~c2_pc~0); 1024#L482 assume !(1 == ~wb_pc~0); 1067#L491 assume !(1 == ~e_c~0); 1068#L500-1 assume !(1 == ~e_e~0); 1025#L505-1 assume !(1 == ~e_f~0); 1026#L510-1 assume !(1 == ~e_g~0); 1072#L515-1 assume !(1 == ~e_c~0); 1093#L520-1 assume !(1 == ~e_wl~0); 1036#L662-1 [2019-10-22 09:00:42,499 INFO L793 eck$LassoCheckResult]: Loop: 1036#L662-1 assume !false; 1038#L532 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; 1070#L367 assume !false; 1000#L285 assume !(0 == ~wl_st~0); 1002#L289 assume !(0 == ~c1_st~0); 1100#L292 assume !(0 == ~c2_st~0); 1080#L295 assume !(0 == ~wb_st~0); 1081#L298 assume !(0 == ~r_st~0); 1088#L383 start_simulation_~kernel_st~0 := 2; 1057#L538 assume !(1 == ~c_req_up~0); 1029#L538-2 start_simulation_~kernel_st~0 := 3; 1030#L550 assume !(0 == ~e_f~0); 1105#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1006#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1007#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1060#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1071#L570-1 assume 1 == ~wl_pc~0; 1085#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1055#L583 assume !(1 == ~c1_pc~0); 1050#L593 assume !(1 == ~c2_pc~0); 1052#L602 assume !(1 == ~wb_pc~0); 1063#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 1083#L620-1 assume !(1 == ~e_e~0); 1084#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1099#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1109#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1039#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1040#L645-1 assume 0 == ~wl_st~0; 1036#L662-1 [2019-10-22 09:00:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2019-10-22 09:00:42,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745516203] [2019-10-22 09:00:42,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:42,546 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 4 times [2019-10-22 09:00:42,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685829147] [2019-10-22 09:00:42,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,563 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 09:00:42,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685829147] [2019-10-22 09:00:42,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:42,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555078333] [2019-10-22 09:00:42,565 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:42,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:42,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:42,565 INFO L87 Difference]: Start difference. First operand 119 states and 209 transitions. cyclomatic complexity: 91 Second operand 3 states. [2019-10-22 09:00:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:42,611 INFO L93 Difference]: Finished difference Result 147 states and 260 transitions. [2019-10-22 09:00:42,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:42,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 260 transitions. [2019-10-22 09:00:42,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2019-10-22 09:00:42,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 260 transitions. [2019-10-22 09:00:42,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-10-22 09:00:42,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-10-22 09:00:42,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 260 transitions. [2019-10-22 09:00:42,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:42,616 INFO L688 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2019-10-22 09:00:42,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 260 transitions. [2019-10-22 09:00:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-10-22 09:00:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-22 09:00:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 260 transitions. [2019-10-22 09:00:42,622 INFO L711 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2019-10-22 09:00:42,622 INFO L591 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2019-10-22 09:00:42,622 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:42,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 260 transitions. [2019-10-22 09:00:42,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2019-10-22 09:00:42,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:42,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:42,624 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 09:00:42,625 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 09:00:42,625 INFO L791 eck$LassoCheckResult]: Stem: 1380#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; 1283#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; 1284#L394 assume !(1 == ~c_req_up~0); 1286#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1359#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1360#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1377#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1267#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1268#L425-1 assume !(0 == ~e_f~0); 1315#L430-1 assume !(0 == ~e_g~0); 1352#L435-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1372#L440-1 assume !(0 == ~e_c~0); 1383#L445-1 assume !(0 == ~e_wl~0); 1305#L450-1 assume !(1 == ~wl_pc~0); 1306#L462 assume !(2 == ~wl_pc~0); 1292#L463 assume !(1 == ~c1_pc~0); 1366#L473 assume !(1 == ~c2_pc~0); 1297#L482 assume !(1 == ~wb_pc~0); 1340#L491 assume !(1 == ~e_c~0); 1341#L500-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1298#L505-1 assume !(1 == ~e_f~0); 1299#L510-1 assume !(1 == ~e_g~0); 1345#L515-1 assume !(1 == ~e_c~0); 1368#L520-1 assume !(1 == ~e_wl~0); 1309#L662-1 [2019-10-22 09:00:42,625 INFO L793 eck$LassoCheckResult]: Loop: 1309#L662-1 assume !false; 1311#L532 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; 1343#L367 assume !false; 1272#L285 assume !(0 == ~wl_st~0); 1274#L289 assume !(0 == ~c1_st~0); 1376#L292 assume !(0 == ~c2_st~0); 1353#L295 assume !(0 == ~wb_st~0); 1354#L298 assume !(0 == ~r_st~0); 1361#L383 start_simulation_~kernel_st~0 := 2; 1330#L538 assume !(1 == ~c_req_up~0); 1302#L538-2 start_simulation_~kernel_st~0 := 3; 1303#L550 assume !(0 == ~e_f~0); 1381#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1278#L555-1 assume !(0 == ~e_e~0); 1280#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1333#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1344#L570-1 assume 1 == ~wl_pc~0; 1358#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1328#L583 assume !(1 == ~c1_pc~0); 1323#L593 assume !(1 == ~c2_pc~0); 1325#L602 assume !(1 == ~wb_pc~0); 1389#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 1388#L620-1 assume !(1 == ~e_e~0); 1357#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1375#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1385#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1312#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1313#L645-1 assume 0 == ~wl_st~0; 1309#L662-1 [2019-10-22 09:00:42,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1264875287, now seen corresponding path program 1 times [2019-10-22 09:00:42,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464724288] [2019-10-22 09:00:42,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,648 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 09:00:42,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464724288] [2019-10-22 09:00:42,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:42,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788356157] [2019-10-22 09:00:42,650 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash 922220149, now seen corresponding path program 1 times [2019-10-22 09:00:42,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405697476] [2019-10-22 09:00:42,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:42,661 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:42,833 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-10-22 09:00:42,917 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:42,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:42,918 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:42,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:42,918 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:42,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:42,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:42,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:42,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration6_Loop [2019-10-22 09:00:42,919 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:42,919 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:42,936 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 09:00:42,942 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 09:00:42,946 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 09:00:42,948 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 09:00:42,950 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 09:00:42,953 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 09:00:42,961 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 09:00:42,964 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 09:00:42,969 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 09:00:42,973 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 09:00:42,975 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 09:00:42,977 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 09:00:42,980 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 09:00:42,985 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 09:00:42,987 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 09:00:42,990 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 09:00:42,993 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 09:00:42,999 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 09:00:43,002 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 09:00:43,005 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 09:00:43,011 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 09:00:43,013 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 09:00:43,016 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 09:00:43,018 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 09:00:43,024 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 09:00:43,026 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 09:00:43,271 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:43,272 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:43,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:43,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:43,288 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:43,288 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_c35a9645-d395-423a-a668-c7ffbefe762b/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 09:00:43,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:43,296 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_c35a9645-d395-423a-a668-c7ffbefe762b/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 09:00:43,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:43,307 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 09:00:43,315 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:43,317 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:43,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:43,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:43,317 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:43,317 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:43,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:43,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:43,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:43,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration6_Loop [2019-10-22 09:00:43,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:43,318 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:43,325 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 09:00:43,328 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 09:00:43,336 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 09:00:43,338 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 09:00:43,341 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 09:00:43,344 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 09:00:43,349 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 09:00:43,351 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 09:00:43,359 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 09:00:43,366 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 09:00:43,368 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 09:00:43,370 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 09:00:43,371 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 09:00:43,376 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 09:00:43,379 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 09:00:43,381 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 09:00:43,383 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 09:00:43,388 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 09:00:43,390 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 09:00:43,392 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 09:00:43,397 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 09:00:43,399 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 09:00:43,402 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 09:00:43,403 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 09:00:43,408 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 09:00:43,410 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 09:00:43,640 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:43,647 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:43,649 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 09:00:43,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:43,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:43,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:43,652 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:43,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:43,654 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:43,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:43,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:43,662 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 09:00:43,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:43,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:43,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:43,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:43,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:43,666 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:43,666 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:43,671 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:43,673 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:43,674 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:43,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:43,678 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:43,678 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:43,679 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2019-10-22 09:00:43,681 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:43,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:43,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:43,839 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 09:00:43,842 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 09:00:43,843 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 260 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-10-22 09:00:43,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 260 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 461 states and 811 transitions. Complement of second has 5 states. [2019-10-22 09:00:43,959 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 09:00:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2019-10-22 09:00:43,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 24 letters. Loop has 28 letters. [2019-10-22 09:00:43,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 52 letters. Loop has 28 letters. [2019-10-22 09:00:43,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 24 letters. Loop has 56 letters. [2019-10-22 09:00:43,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 461 states and 811 transitions. [2019-10-22 09:00:43,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 306 [2019-10-22 09:00:43,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 461 states to 461 states and 811 transitions. [2019-10-22 09:00:43,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2019-10-22 09:00:43,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2019-10-22 09:00:43,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 811 transitions. [2019-10-22 09:00:43,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:43,983 INFO L688 BuchiCegarLoop]: Abstraction has 461 states and 811 transitions. [2019-10-22 09:00:43,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 811 transitions. [2019-10-22 09:00:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 355. [2019-10-22 09:00:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-10-22 09:00:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 626 transitions. [2019-10-22 09:00:44,013 INFO L711 BuchiCegarLoop]: Abstraction has 355 states and 626 transitions. [2019-10-22 09:00:44,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:44,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:44,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:44,014 INFO L87 Difference]: Start difference. First operand 355 states and 626 transitions. Second operand 4 states. [2019-10-22 09:00:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:44,096 INFO L93 Difference]: Finished difference Result 595 states and 1033 transitions. [2019-10-22 09:00:44,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:44,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 1033 transitions. [2019-10-22 09:00:44,101 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 340 [2019-10-22 09:00:44,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 595 states and 1033 transitions. [2019-10-22 09:00:44,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2019-10-22 09:00:44,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2019-10-22 09:00:44,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 595 states and 1033 transitions. [2019-10-22 09:00:44,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:44,107 INFO L688 BuchiCegarLoop]: Abstraction has 595 states and 1033 transitions. [2019-10-22 09:00:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 1033 transitions. [2019-10-22 09:00:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 559. [2019-10-22 09:00:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-22 09:00:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 976 transitions. [2019-10-22 09:00:44,119 INFO L711 BuchiCegarLoop]: Abstraction has 559 states and 976 transitions. [2019-10-22 09:00:44,119 INFO L591 BuchiCegarLoop]: Abstraction has 559 states and 976 transitions. [2019-10-22 09:00:44,119 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:44,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 559 states and 976 transitions. [2019-10-22 09:00:44,123 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 340 [2019-10-22 09:00:44,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:44,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:44,124 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 09:00:44,124 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 09:00:44,124 INFO L791 eck$LassoCheckResult]: Stem: 3220#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; 3036#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; 3037#L394 assume !(1 == ~c_req_up~0); 3039#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3182#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3183#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3212#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3008#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3009#L425-1 assume !(0 == ~e_f~0); 3090#L430-1 assume !(0 == ~e_g~0); 3169#L435-1 assume !(0 == ~e_e~0); 3202#L440-1 assume !(0 == ~e_c~0); 3234#L445-1 assume !(0 == ~e_wl~0); 3073#L450-1 assume !(1 == ~wl_pc~0); 3074#L462 assume !(2 == ~wl_pc~0); 3050#L463 assume !(1 == ~c1_pc~0); 3309#L473 assume !(1 == ~c2_pc~0); 3307#L482 assume !(1 == ~wb_pc~0); 3142#L491 assume !(1 == ~e_c~0); 3143#L500-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3252#L505-1 assume !(1 == ~e_f~0); 3060#L510-1 assume !(1 == ~e_g~0); 3287#L515-1 assume !(1 == ~e_c~0); 3225#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3226#L662-1 [2019-10-22 09:00:44,124 INFO L793 eck$LassoCheckResult]: Loop: 3226#L662-1 assume !false; 3376#L532 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; 3372#L367 assume !false; 3369#L285 assume !(0 == ~wl_st~0); 3367#L289 assume !(0 == ~c1_st~0); 3364#L292 assume !(0 == ~c2_st~0); 3361#L295 assume !(0 == ~wb_st~0); 3357#L298 assume !(0 == ~r_st~0); 3352#L383 start_simulation_~kernel_st~0 := 2; 3347#L538 assume !(1 == ~c_req_up~0); 3343#L538-2 start_simulation_~kernel_st~0 := 3; 3341#L550 assume !(0 == ~e_f~0); 3337#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3338#L555-1 assume !(0 == ~e_e~0); 3335#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3336#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3455#L570-1 assume !(1 == ~wl_pc~0); 3451#L582 assume !(2 == ~wl_pc~0); 3447#L583 assume !(1 == ~c1_pc~0); 3443#L593 assume !(1 == ~c2_pc~0); 3439#L602 assume !(1 == ~wb_pc~0); 3435#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 3432#L620-1 assume !(1 == ~e_e~0); 3431#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3429#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3428#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3389#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3384#L645-1 assume 0 == ~wl_st~0; 3226#L662-1 [2019-10-22 09:00:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash 253758035, now seen corresponding path program 1 times [2019-10-22 09:00:44,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080474979] [2019-10-22 09:00:44,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:44,172 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 09:00:44,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080474979] [2019-10-22 09:00:44,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:44,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:44,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459848604] [2019-10-22 09:00:44,174 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:44,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1471479870, now seen corresponding path program 1 times [2019-10-22 09:00:44,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636285614] [2019-10-22 09:00:44,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:44,190 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 09:00:44,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636285614] [2019-10-22 09:00:44,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:44,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:44,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82917020] [2019-10-22 09:00:44,191 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:44,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:44,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:44,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:44,191 INFO L87 Difference]: Start difference. First operand 559 states and 976 transitions. cyclomatic complexity: 423 Second operand 4 states. [2019-10-22 09:00:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:44,257 INFO L93 Difference]: Finished difference Result 1029 states and 1741 transitions. [2019-10-22 09:00:44,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:44,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1029 states and 1741 transitions. [2019-10-22 09:00:44,264 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 638 [2019-10-22 09:00:44,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1029 states to 1029 states and 1741 transitions. [2019-10-22 09:00:44,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 706 [2019-10-22 09:00:44,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 706 [2019-10-22 09:00:44,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1029 states and 1741 transitions. [2019-10-22 09:00:44,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:44,271 INFO L688 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2019-10-22 09:00:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states and 1741 transitions. [2019-10-22 09:00:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2019-10-22 09:00:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-10-22 09:00:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1741 transitions. [2019-10-22 09:00:44,288 INFO L711 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2019-10-22 09:00:44,288 INFO L591 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2019-10-22 09:00:44,288 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:44,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1029 states and 1741 transitions. [2019-10-22 09:00:44,293 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 638 [2019-10-22 09:00:44,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:44,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:44,294 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 09:00:44,294 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 09:00:44,295 INFO L791 eck$LassoCheckResult]: Stem: 4819#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; 4635#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; 4636#L394 assume !(1 == ~c_req_up~0); 4794#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4861#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4812#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4813#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4607#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4608#L425-1 assume !(0 == ~e_f~0); 4766#L430-1 assume !(0 == ~e_g~0); 4767#L435-1 assume !(0 == ~e_e~0); 4828#L440-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4829#L445-1 assume !(0 == ~e_wl~0); 4860#L450-1 assume !(1 == ~wl_pc~0); 4858#L462 assume !(2 == ~wl_pc~0); 4856#L463 assume !(1 == ~c1_pc~0); 4827#L473 assume !(1 == ~c2_pc~0); 4656#L482 assume !(1 == ~wb_pc~0); 4789#L491 assume !(1 == ~e_c~0); 4846#L500-1 assume !(1 == ~e_e~0); 4847#L505-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4864#L510-1 assume !(1 == ~e_g~0); 4865#L515-1 assume !(1 == ~e_c~0); 4938#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4675#L662-1 [2019-10-22 09:00:44,295 INFO L793 eck$LassoCheckResult]: Loop: 4675#L662-1 assume !false; 4680#L532 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; 4748#L367 assume !false; 4615#L285 assume !(0 == ~wl_st~0); 4617#L289 assume !(0 == ~c1_st~0); 4810#L292 assume !(0 == ~c2_st~0); 4768#L295 assume !(0 == ~wb_st~0); 4769#L298 assume !(0 == ~r_st~0); 4783#L383 start_simulation_~kernel_st~0 := 2; 4718#L538 assume !(1 == ~c_req_up~0); 4720#L538-2 start_simulation_~kernel_st~0 := 3; 5107#L550 assume !(0 == ~e_f~0); 4823#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 4627#L555-1 assume !(0 == ~e_e~0); 4628#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 5144#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5142#L570-1 assume !(1 == ~wl_pc~0); 5138#L582 assume !(2 == ~wl_pc~0); 5136#L583 assume !(1 == ~c1_pc~0); 5134#L593 assume !(1 == ~c2_pc~0); 5102#L602 assume !(1 == ~wb_pc~0); 5101#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 5121#L620-1 assume !(1 == ~e_e~0); 5120#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 5119#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 5118#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4682#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4683#L645-1 assume 0 == ~wl_st~0; 4675#L662-1 [2019-10-22 09:00:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash 842351509, now seen corresponding path program 1 times [2019-10-22 09:00:44,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414362158] [2019-10-22 09:00:44,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:44,325 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 09:00:44,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414362158] [2019-10-22 09:00:44,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:44,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:44,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216381024] [2019-10-22 09:00:44,326 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1471479870, now seen corresponding path program 2 times [2019-10-22 09:00:44,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552342350] [2019-10-22 09:00:44,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:44,338 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 09:00:44,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552342350] [2019-10-22 09:00:44,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:44,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:44,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111417333] [2019-10-22 09:00:44,339 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:44,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:44,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:44,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:44,340 INFO L87 Difference]: Start difference. First operand 1029 states and 1741 transitions. cyclomatic complexity: 724 Second operand 4 states. [2019-10-22 09:00:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:44,422 INFO L93 Difference]: Finished difference Result 1300 states and 2165 transitions. [2019-10-22 09:00:44,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:44,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1300 states and 2165 transitions. [2019-10-22 09:00:44,430 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 808 [2019-10-22 09:00:44,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1300 states to 1300 states and 2165 transitions. [2019-10-22 09:00:44,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 892 [2019-10-22 09:00:44,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 892 [2019-10-22 09:00:44,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1300 states and 2165 transitions. [2019-10-22 09:00:44,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:44,438 INFO L688 BuchiCegarLoop]: Abstraction has 1300 states and 2165 transitions. [2019-10-22 09:00:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states and 2165 transitions. [2019-10-22 09:00:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1276. [2019-10-22 09:00:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-10-22 09:00:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 2141 transitions. [2019-10-22 09:00:44,458 INFO L711 BuchiCegarLoop]: Abstraction has 1276 states and 2141 transitions. [2019-10-22 09:00:44,458 INFO L591 BuchiCegarLoop]: Abstraction has 1276 states and 2141 transitions. [2019-10-22 09:00:44,458 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:44,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1276 states and 2141 transitions. [2019-10-22 09:00:44,464 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 808 [2019-10-22 09:00:44,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:44,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:44,465 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 09:00:44,465 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 09:00:44,465 INFO L791 eck$LassoCheckResult]: Stem: 7178#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; 6974#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; 6975#L394 assume !(1 == ~c_req_up~0); 7146#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7130#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7131#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7197#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6946#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6947#L425-1 assume !(0 == ~e_f~0); 7113#L430-1 assume !(0 == ~e_g~0); 7114#L435-1 assume !(0 == ~e_e~0); 7189#L440-1 assume !(0 == ~e_c~0); 7190#L445-1 assume !(0 == ~e_wl~0); 7012#L450-1 assume !(1 == ~wl_pc~0); 7013#L462 assume !(2 == ~wl_pc~0); 6994#L463 assume !(1 == ~c1_pc~0); 7139#L473 assume !(1 == ~c2_pc~0); 7217#L482 assume !(1 == ~wb_pc~0); 7082#L491 assume !(1 == ~e_c~0); 7083#L500-1 assume !(1 == ~e_e~0); 7211#L505-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7093#L510-1 assume !(1 == ~e_g~0); 7094#L515-1 assume !(1 == ~e_c~0); 7180#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7181#L662-1 [2019-10-22 09:00:44,465 INFO L793 eck$LassoCheckResult]: Loop: 7181#L662-1 assume !false; 7910#L532 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; 7615#L367 assume !false; 7905#L285 assume !(0 == ~wl_st~0); 7906#L289 assume !(0 == ~c1_st~0); 7908#L292 assume !(0 == ~c2_st~0); 7903#L295 assume !(0 == ~wb_st~0); 7904#L298 assume !(0 == ~r_st~0); 7907#L383 start_simulation_~kernel_st~0 := 2; 7939#L538 assume !(1 == ~c_req_up~0); 7937#L538-2 start_simulation_~kernel_st~0 := 3; 7936#L550 assume !(0 == ~e_f~0); 7935#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7934#L555-1 assume !(0 == ~e_e~0); 7933#L560-1 assume !(0 == ~e_c~0); 7932#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7931#L570-1 assume !(1 == ~wl_pc~0); 7928#L582 assume !(2 == ~wl_pc~0); 7927#L583 assume !(1 == ~c1_pc~0); 7925#L593 assume !(1 == ~c2_pc~0); 7923#L602 assume !(1 == ~wb_pc~0); 7921#L611 assume !(1 == ~e_c~0); 7920#L620-1 assume !(1 == ~e_e~0); 7919#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7780#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7918#L635-1 assume !(1 == ~e_c~0); 7916#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7915#L645-1 assume 0 == ~wl_st~0; 7181#L662-1 [2019-10-22 09:00:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash 255545495, now seen corresponding path program 1 times [2019-10-22 09:00:44,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373524625] [2019-10-22 09:00:44,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:44,486 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 09:00:44,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373524625] [2019-10-22 09:00:44,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:44,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:44,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680310558] [2019-10-22 09:00:44,487 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2059595392, now seen corresponding path program 1 times [2019-10-22 09:00:44,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737089593] [2019-10-22 09:00:44,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:44,498 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 09:00:44,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737089593] [2019-10-22 09:00:44,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:44,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:44,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680948588] [2019-10-22 09:00:44,499 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:44,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:44,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:44,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:44,500 INFO L87 Difference]: Start difference. First operand 1276 states and 2141 transitions. cyclomatic complexity: 880 Second operand 4 states. [2019-10-22 09:00:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:44,585 INFO L93 Difference]: Finished difference Result 1415 states and 2300 transitions. [2019-10-22 09:00:44,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:44,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1415 states and 2300 transitions. [2019-10-22 09:00:44,593 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 891 [2019-10-22 09:00:44,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1415 states to 1415 states and 2300 transitions. [2019-10-22 09:00:44,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 967 [2019-10-22 09:00:44,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 967 [2019-10-22 09:00:44,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1415 states and 2300 transitions. [2019-10-22 09:00:44,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:44,605 INFO L688 BuchiCegarLoop]: Abstraction has 1415 states and 2300 transitions. [2019-10-22 09:00:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states and 2300 transitions. [2019-10-22 09:00:44,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1385. [2019-10-22 09:00:44,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-10-22 09:00:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2270 transitions. [2019-10-22 09:00:44,627 INFO L711 BuchiCegarLoop]: Abstraction has 1385 states and 2270 transitions. [2019-10-22 09:00:44,627 INFO L591 BuchiCegarLoop]: Abstraction has 1385 states and 2270 transitions. [2019-10-22 09:00:44,627 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:00:44,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1385 states and 2270 transitions. [2019-10-22 09:00:44,633 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 887 [2019-10-22 09:00:44,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:44,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:44,634 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 09:00:44,634 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 09:00:44,634 INFO L791 eck$LassoCheckResult]: Stem: 9877#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; 9678#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; 9679#L394 assume !(1 == ~c_req_up~0); 9681#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9833#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9834#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9896#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9648#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9649#L425-1 assume !(0 == ~e_f~0); 9815#L430-1 assume !(0 == ~e_g~0); 9816#L435-1 assume !(0 == ~e_e~0); 9884#L440-1 assume !(0 == ~e_c~0); 9885#L445-1 assume !(0 == ~e_wl~0); 9715#L450-1 assume !(1 == ~wl_pc~0); 9716#L462 assume !(2 == ~wl_pc~0); 9692#L463 assume !(1 == ~c1_pc~0); 9840#L473 assume !(1 == ~c2_pc~0); 9919#L482 assume !(1 == ~wb_pc~0); 9785#L491 assume !(1 == ~e_c~0); 9786#L500-1 assume !(1 == ~e_e~0); 9911#L505-1 assume !(1 == ~e_f~0); 9796#L510-1 assume !(1 == ~e_g~0); 9797#L515-1 assume !(1 == ~e_c~0); 9843#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 9719#L662-1 [2019-10-22 09:00:44,634 INFO L793 eck$LassoCheckResult]: Loop: 9719#L662-1 assume !false; 9724#L532 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; 9791#L367 assume !false; 9656#L285 assume !(0 == ~wl_st~0); 9658#L289 assume !(0 == ~c1_st~0); 9865#L292 assume !(0 == ~c2_st~0); 9817#L295 assume !(0 == ~wb_st~0); 9818#L298 assume !(0 == ~r_st~0); 9835#L383 start_simulation_~kernel_st~0 := 2; 9763#L538 assume !(1 == ~c_req_up~0); 9707#L538-2 start_simulation_~kernel_st~0 := 3; 9708#L550 assume !(0 == ~e_f~0); 9900#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10712#L555-1 assume !(0 == ~e_e~0); 10713#L560-1 assume !(0 == ~e_c~0); 10705#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10706#L570-1 assume !(1 == ~wl_pc~0); 11014#L582 assume !(2 == ~wl_pc~0); 10692#L583 assume !(1 == ~c1_pc~0); 10691#L593 assume !(1 == ~c2_pc~0); 10686#L602 assume !(1 == ~wb_pc~0); 10684#L611 assume !(1 == ~e_c~0); 10683#L620-1 assume !(1 == ~e_e~0); 10682#L625-1 assume !(1 == ~e_f~0); 10681#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10679#L635-1 assume !(1 == ~e_c~0); 10680#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 9777#L645-1 assume 0 == ~wl_st~0; 9719#L662-1 [2019-10-22 09:00:44,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,634 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2019-10-22 09:00:44,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317832153] [2019-10-22 09:00:44,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:44,651 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 09:00:44,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317832153] [2019-10-22 09:00:44,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:44,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:44,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440003165] [2019-10-22 09:00:44,652 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:44,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2057748350, now seen corresponding path program 1 times [2019-10-22 09:00:44,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525309277] [2019-10-22 09:00:44,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:44,663 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 09:00:44,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525309277] [2019-10-22 09:00:44,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:44,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:44,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831421193] [2019-10-22 09:00:44,665 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:44,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:44,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:44,665 INFO L87 Difference]: Start difference. First operand 1385 states and 2270 transitions. cyclomatic complexity: 900 Second operand 3 states. [2019-10-22 09:00:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:44,699 INFO L93 Difference]: Finished difference Result 2200 states and 3552 transitions. [2019-10-22 09:00:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:44,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2200 states and 3552 transitions. [2019-10-22 09:00:44,712 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1264 [2019-10-22 09:00:44,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2200 states to 2200 states and 3552 transitions. [2019-10-22 09:00:44,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1324 [2019-10-22 09:00:44,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1324 [2019-10-22 09:00:44,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2200 states and 3552 transitions. [2019-10-22 09:00:44,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:44,723 INFO L688 BuchiCegarLoop]: Abstraction has 2200 states and 3552 transitions. [2019-10-22 09:00:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states and 3552 transitions. [2019-10-22 09:00:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2188. [2019-10-22 09:00:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2188 states. [2019-10-22 09:00:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3540 transitions. [2019-10-22 09:00:44,756 INFO L711 BuchiCegarLoop]: Abstraction has 2188 states and 3540 transitions. [2019-10-22 09:00:44,756 INFO L591 BuchiCegarLoop]: Abstraction has 2188 states and 3540 transitions. [2019-10-22 09:00:44,756 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:00:44,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2188 states and 3540 transitions. [2019-10-22 09:00:44,765 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1257 [2019-10-22 09:00:44,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:44,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:44,766 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 09:00:44,766 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 09:00:44,766 INFO L791 eck$LassoCheckResult]: Stem: 13464#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; 13268#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; 13269#L394 assume !(1 == ~c_req_up~0); 13436#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 13418#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 13419#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 13483#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 13240#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 13241#L425-1 assume !(0 == ~e_f~0); 13400#L430-1 assume !(0 == ~e_g~0); 13401#L435-1 assume !(0 == ~e_e~0); 13475#L440-1 assume !(0 == ~e_c~0); 13476#L445-1 assume !(0 == ~e_wl~0); 13511#L450-1 assume !(1 == ~wl_pc~0); 13472#L462 assume !(2 == ~wl_pc~0); 13287#L463 assume !(1 == ~c1_pc~0); 13426#L473 assume !(1 == ~c2_pc~0); 13505#L482 assume !(1 == ~wb_pc~0); 13374#L491 assume !(1 == ~e_c~0); 13375#L500-1 assume !(1 == ~e_e~0); 13503#L505-1 assume !(1 == ~e_f~0); 13382#L510-1 assume !(1 == ~e_g~0); 13383#L515-1 assume !(1 == ~e_c~0); 13433#L520-1 assume !(1 == ~e_wl~0); 13586#L662-1 assume !false; 13587#L532 [2019-10-22 09:00:44,766 INFO L793 eck$LassoCheckResult]: Loop: 13587#L532 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; 14882#L367 assume !false; 14715#L285 assume !(0 == ~wl_st~0); 14712#L289 assume !(0 == ~c1_st~0); 14709#L292 assume !(0 == ~c2_st~0); 14706#L295 assume !(0 == ~wb_st~0); 14700#L298 assume !(0 == ~r_st~0); 14702#L383 start_simulation_~kernel_st~0 := 2; 14688#L538 assume !(1 == ~c_req_up~0); 14689#L538-2 start_simulation_~kernel_st~0 := 3; 14972#L550 assume !(0 == ~e_f~0); 14971#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 14970#L555-1 assume !(0 == ~e_e~0); 14969#L560-1 assume !(0 == ~e_c~0); 14968#L565-1 assume !(0 == ~e_wl~0); 14967#L570-1 assume !(1 == ~wl_pc~0); 14964#L582 assume !(2 == ~wl_pc~0); 14963#L583 assume !(1 == ~c1_pc~0); 14961#L593 assume !(1 == ~c2_pc~0); 14959#L602 assume !(1 == ~wb_pc~0); 14957#L611 assume !(1 == ~e_c~0); 14956#L620-1 assume !(1 == ~e_e~0); 14955#L625-1 assume !(1 == ~e_f~0); 14951#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 14945#L635-1 assume !(1 == ~e_c~0); 14942#L640-1 assume !(1 == ~e_wl~0); 14770#L645-1 assume 0 == ~wl_st~0; 14885#L662-1 assume !false; 13587#L532 [2019-10-22 09:00:44,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,767 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2019-10-22 09:00:44,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713479338] [2019-10-22 09:00:44,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:44,779 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,780 INFO L82 PathProgramCache]: Analyzing trace with hash 793828832, now seen corresponding path program 1 times [2019-10-22 09:00:44,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814392648] [2019-10-22 09:00:44,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:44,791 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 09:00:44,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814392648] [2019-10-22 09:00:44,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:44,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:44,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823171818] [2019-10-22 09:00:44,792 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:44,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:44,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:44,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:44,792 INFO L87 Difference]: Start difference. First operand 2188 states and 3540 transitions. cyclomatic complexity: 1364 Second operand 3 states. [2019-10-22 09:00:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:44,823 INFO L93 Difference]: Finished difference Result 3269 states and 5252 transitions. [2019-10-22 09:00:44,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:44,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3269 states and 5252 transitions. [2019-10-22 09:00:44,841 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1877 [2019-10-22 09:00:44,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3269 states to 3269 states and 5252 transitions. [2019-10-22 09:00:44,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1948 [2019-10-22 09:00:44,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1948 [2019-10-22 09:00:44,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3269 states and 5252 transitions. [2019-10-22 09:00:44,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:44,861 INFO L688 BuchiCegarLoop]: Abstraction has 3269 states and 5252 transitions. [2019-10-22 09:00:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states and 5252 transitions. [2019-10-22 09:00:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3190. [2019-10-22 09:00:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2019-10-22 09:00:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 5137 transitions. [2019-10-22 09:00:44,918 INFO L711 BuchiCegarLoop]: Abstraction has 3190 states and 5137 transitions. [2019-10-22 09:00:44,918 INFO L591 BuchiCegarLoop]: Abstraction has 3190 states and 5137 transitions. [2019-10-22 09:00:44,918 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:00:44,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3190 states and 5137 transitions. [2019-10-22 09:00:44,929 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1871 [2019-10-22 09:00:44,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:44,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:44,930 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 09:00:44,930 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:44,931 INFO L791 eck$LassoCheckResult]: Stem: 18937#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; 18729#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; 18730#L394 assume !(1 == ~c_req_up~0); 18899#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 18881#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 18882#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 18958#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 18703#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 18704#L425-1 assume !(0 == ~e_f~0); 18865#L430-1 assume !(0 == ~e_g~0); 18866#L435-1 assume !(0 == ~e_e~0); 18947#L440-1 assume !(0 == ~e_c~0); 18948#L445-1 assume !(0 == ~e_wl~0); 18996#L450-1 assume !(1 == ~wl_pc~0); 18945#L462 assume !(2 == ~wl_pc~0); 18749#L463 assume !(1 == ~c1_pc~0); 18891#L473 assume !(1 == ~c2_pc~0); 18990#L482 assume !(1 == ~wb_pc~0); 18837#L491 assume !(1 == ~e_c~0); 18838#L500-1 assume !(1 == ~e_e~0); 18988#L505-1 assume !(1 == ~e_f~0); 18846#L510-1 assume !(1 == ~e_g~0); 18847#L515-1 assume !(1 == ~e_c~0); 18896#L520-1 assume !(1 == ~e_wl~0); 19113#L662-1 assume !false; 19114#L532 [2019-10-22 09:00:44,931 INFO L793 eck$LassoCheckResult]: Loop: 19114#L532 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; 21096#L367 assume !false; 21094#L285 assume 0 == ~wl_st~0; 21092#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 21090#L311 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 21025#L56 assume 0 == ~wl_pc~0; 21024#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 20906#L307 assume !(0 == ~c1_st~0); 20970#L322 assume !(0 == ~c2_st~0); 20956#L337 assume !(0 == ~wb_st~0); 20724#L352 assume !(0 == ~r_st~0); 20721#L367 assume !false; 20704#L285 assume !(0 == ~wl_st~0); 20705#L289 assume !(0 == ~c1_st~0); 20658#L292 assume !(0 == ~c2_st~0); 20659#L295 assume !(0 == ~wb_st~0); 20640#L298 assume !(0 == ~r_st~0); 20642#L383 start_simulation_~kernel_st~0 := 2; 20629#L538 assume !(1 == ~c_req_up~0); 20630#L538-2 start_simulation_~kernel_st~0 := 3; 20944#L550 assume !(0 == ~e_f~0); 20942#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 20940#L555-1 assume !(0 == ~e_e~0); 20938#L560-1 assume !(0 == ~e_c~0); 20936#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 20934#L570-1 assume 1 == ~wl_pc~0; 20931#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 20928#L583 assume !(1 == ~c1_pc~0); 20924#L593 assume !(1 == ~c2_pc~0); 20920#L602 assume !(1 == ~wb_pc~0); 20916#L611 assume !(1 == ~e_c~0); 20908#L620-1 assume !(1 == ~e_e~0); 20767#L625-1 assume !(1 == ~e_f~0); 20763#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 20760#L635-1 assume !(1 == ~e_c~0); 20753#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 20754#L645-1 assume 0 == ~wl_st~0; 21099#L662-1 assume !false; 19114#L532 [2019-10-22 09:00:44,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,931 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2019-10-22 09:00:44,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916978094] [2019-10-22 09:00:44,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:44,943 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash 828679061, now seen corresponding path program 1 times [2019-10-22 09:00:44,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929745919] [2019-10-22 09:00:44,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:44,954 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1088220784, now seen corresponding path program 1 times [2019-10-22 09:00:44,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:44,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500366567] [2019-10-22 09:00:44,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:44,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:44,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500366567] [2019-10-22 09:00:44,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:44,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:44,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617242015] [2019-10-22 09:00:45,123 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-10-22 09:00:45,175 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:45,175 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:45,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:45,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:45,176 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:45,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:45,176 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:45,176 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:45,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration12_Loop [2019-10-22 09:00:45,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:45,176 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:45,180 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 09:00:45,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 09:00:45,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 09:00:45,188 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 09:00:45,194 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 09:00:45,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 09:00:45,199 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 09:00:45,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 09:00:45,205 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 09:00:45,208 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 09:00:45,211 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 09:00:45,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 09:00:45,224 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 09:00:45,226 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 09:00:45,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 09:00:45,233 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 09:00:45,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 09:00:45,241 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 09:00:45,243 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 09:00:45,246 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 09:00:45,249 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 09:00:45,256 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 09:00:45,258 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 09:00:45,260 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 09:00:45,262 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 09:00:45,263 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 09:00:45,265 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 09:00:45,502 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:45,503 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/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 09:00:45,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:45,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:45,518 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:45,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_c35a9645-d395-423a-a668-c7ffbefe762b/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) [2019-10-22 09:00:45,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:45,526 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:45,530 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:45,530 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-1} Honda state: {~e_c~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:45,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:45,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:45,624 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:45,625 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_c35a9645-d395-423a-a668-c7ffbefe762b/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 09:00:45,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:45,631 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:45,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:45,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:45,649 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:45,651 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:45,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:45,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:45,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:45,651 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:45,651 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:45,651 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:45,651 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:45,651 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration12_Loop [2019-10-22 09:00:45,651 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:45,651 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:45,653 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 09:00:45,659 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 09:00:45,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 09:00:45,663 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 09:00:45,668 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 09:00:45,669 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 09:00:45,671 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 09:00:45,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 09:00:45,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 09:00:45,689 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 09:00:45,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 09:00:45,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 09:00:45,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 09:00:45,695 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 09:00:45,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 09:00:45,701 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 09:00:45,703 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 09:00:45,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 09:00:45,708 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 09:00:45,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 09:00:45,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 09:00:45,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 09:00:45,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 09:00:45,719 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 09:00:45,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 09:00:45,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 09:00:45,724 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 09:00:45,897 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:45,897 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:45,897 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 09:00:45,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:45,898 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:45,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:45,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:45,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:45,899 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:45,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:45,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:45,904 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 09:00:45,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:45,904 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:45,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:45,905 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:45,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:45,905 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:45,905 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:45,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:45,906 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 09:00:45,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:45,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:45,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:45,907 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:45,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:45,908 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:45,911 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:45,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:45,912 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 09:00:45,913 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:45,913 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:45,913 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:45,913 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:45,913 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:45,913 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:45,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:45,915 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:45,918 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:45,919 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:45,919 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:45,919 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:45,919 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:45,920 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2019-10-22 09:00:45,920 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:45,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:45,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:45,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:45,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:45,991 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 09:00:45,992 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3190 states and 5137 transitions. cyclomatic complexity: 1965 Second operand 5 states. [2019-10-22 09:00:46,108 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3190 states and 5137 transitions. cyclomatic complexity: 1965. Second operand 5 states. Result 8418 states and 13557 transitions. Complement of second has 7 states. [2019-10-22 09:00:46,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2019-10-22 09:00:46,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 25 letters. Loop has 38 letters. [2019-10-22 09:00:46,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:46,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 63 letters. Loop has 38 letters. [2019-10-22 09:00:46,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:46,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 25 letters. Loop has 76 letters. [2019-10-22 09:00:46,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:46,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8418 states and 13557 transitions. [2019-10-22 09:00:46,160 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 3355 [2019-10-22 09:00:46,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8418 states to 8248 states and 13287 transitions. [2019-10-22 09:00:46,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3562 [2019-10-22 09:00:46,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3576 [2019-10-22 09:00:46,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8248 states and 13287 transitions. [2019-10-22 09:00:46,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:46,206 INFO L688 BuchiCegarLoop]: Abstraction has 8248 states and 13287 transitions. [2019-10-22 09:00:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states and 13287 transitions. [2019-10-22 09:00:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 8064. [2019-10-22 09:00:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8064 states. [2019-10-22 09:00:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8064 states to 8064 states and 13001 transitions. [2019-10-22 09:00:46,330 INFO L711 BuchiCegarLoop]: Abstraction has 8064 states and 13001 transitions. [2019-10-22 09:00:46,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:46,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:46,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:46,330 INFO L87 Difference]: Start difference. First operand 8064 states and 13001 transitions. Second operand 3 states. [2019-10-22 09:00:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:46,397 INFO L93 Difference]: Finished difference Result 12318 states and 19757 transitions. [2019-10-22 09:00:46,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:46,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12318 states and 19757 transitions. [2019-10-22 09:00:46,446 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 5136 [2019-10-22 09:00:46,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12318 states to 12318 states and 19757 transitions. [2019-10-22 09:00:46,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5280 [2019-10-22 09:00:46,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5280 [2019-10-22 09:00:46,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12318 states and 19757 transitions. [2019-10-22 09:00:46,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:46,522 INFO L688 BuchiCegarLoop]: Abstraction has 12318 states and 19757 transitions. [2019-10-22 09:00:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12318 states and 19757 transitions. [2019-10-22 09:00:46,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12318 to 12318. [2019-10-22 09:00:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12318 states. [2019-10-22 09:00:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12318 states to 12318 states and 19757 transitions. [2019-10-22 09:00:46,692 INFO L711 BuchiCegarLoop]: Abstraction has 12318 states and 19757 transitions. [2019-10-22 09:00:46,692 INFO L591 BuchiCegarLoop]: Abstraction has 12318 states and 19757 transitions. [2019-10-22 09:00:46,692 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 09:00:46,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12318 states and 19757 transitions. [2019-10-22 09:00:46,725 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 5136 [2019-10-22 09:00:46,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:46,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:46,726 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 09:00:46,726 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:46,726 INFO L791 eck$LassoCheckResult]: Stem: 51148#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; 50935#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; 50936#L394 assume !(1 == ~c_req_up~0); 50938#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 51101#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 51132#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 51133#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 51201#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 50987#L425-1 assume !(0 == ~e_f~0); 50988#L430-1 assume !(0 == ~e_g~0); 51121#L435-1 assume !(0 == ~e_e~0); 51122#L440-1 assume !(0 == ~e_c~0); 51200#L445-1 assume !(0 == ~e_wl~0); 51199#L450-1 assume !(1 == ~wl_pc~0); 51156#L462 assume !(2 == ~wl_pc~0); 50946#L463 assume !(1 == ~c1_pc~0); 51105#L473 assume !(1 == ~c2_pc~0); 51193#L482 assume !(1 == ~wb_pc~0); 51045#L491 assume !(1 == ~e_c~0); 51046#L500-1 assume !(1 == ~e_e~0); 51183#L505-1 assume !(1 == ~e_f~0); 51053#L510-1 assume !(1 == ~e_g~0); 51054#L515-1 assume !(1 == ~e_c~0); 51111#L520-1 assume !(1 == ~e_wl~0); 52954#L662-1 assume !false; 52952#L532 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; 52953#L367 [2019-10-22 09:00:46,726 INFO L793 eck$LassoCheckResult]: Loop: 52953#L367 assume !false; 57733#L285 assume 0 == ~wl_st~0; 56476#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 51208#L311 assume !(0 != eval_~tmp~0); 51209#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 56471#L326 assume !(0 != eval_~tmp___0~0); 56472#L322 assume !(0 == ~c2_st~0); 57737#L337 assume !(0 == ~wb_st~0); 57736#L352 assume !(0 == ~r_st~0); 52953#L367 [2019-10-22 09:00:46,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2019-10-22 09:00:46,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:46,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435622725] [2019-10-22 09:00:46,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:46,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:46,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash 850890528, now seen corresponding path program 1 times [2019-10-22 09:00:46,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:46,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168727408] [2019-10-22 09:00:46,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:46,749 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:46,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:46,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1866895320, now seen corresponding path program 1 times [2019-10-22 09:00:46,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:46,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723881489] [2019-10-22 09:00:46,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:46,762 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 09:00:46,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723881489] [2019-10-22 09:00:46,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:46,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:46,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040258004] [2019-10-22 09:00:46,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:46,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:46,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:46,790 INFO L87 Difference]: Start difference. First operand 12318 states and 19757 transitions. cyclomatic complexity: 7495 Second operand 3 states. [2019-10-22 09:00:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:46,852 INFO L93 Difference]: Finished difference Result 19296 states and 30676 transitions. [2019-10-22 09:00:46,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:46,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19296 states and 30676 transitions. [2019-10-22 09:00:46,926 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-10-22 09:00:46,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19296 states to 19296 states and 30676 transitions. [2019-10-22 09:00:46,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8284 [2019-10-22 09:00:47,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8284 [2019-10-22 09:00:47,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19296 states and 30676 transitions. [2019-10-22 09:00:47,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:47,006 INFO L688 BuchiCegarLoop]: Abstraction has 19296 states and 30676 transitions. [2019-10-22 09:00:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19296 states and 30676 transitions. [2019-10-22 09:00:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19296 to 19296. [2019-10-22 09:00:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19296 states. [2019-10-22 09:00:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19296 states to 19296 states and 30676 transitions. [2019-10-22 09:00:47,403 INFO L711 BuchiCegarLoop]: Abstraction has 19296 states and 30676 transitions. [2019-10-22 09:00:47,403 INFO L591 BuchiCegarLoop]: Abstraction has 19296 states and 30676 transitions. [2019-10-22 09:00:47,403 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 09:00:47,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19296 states and 30676 transitions. [2019-10-22 09:00:47,455 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-10-22 09:00:47,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:47,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:47,456 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 09:00:47,456 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:47,456 INFO L791 eck$LassoCheckResult]: Stem: 82778#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; 82559#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; 82560#L394 assume !(1 == ~c_req_up~0); 82723#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 82724#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 82764#L410-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 82765#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 82852#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 82618#L425-1 assume !(0 == ~e_f~0); 82619#L430-1 assume !(0 == ~e_g~0); 82749#L435-1 assume !(0 == ~e_e~0); 82750#L440-1 assume !(0 == ~e_c~0); 82818#L445-1 assume !(0 == ~e_wl~0); 82595#L450-1 assume !(1 == ~wl_pc~0); 82596#L462 assume !(2 == ~wl_pc~0); 82839#L463 assume !(1 == ~c1_pc~0); 82838#L473 assume !(1 == ~c2_pc~0); 82734#L482 assume !(1 == ~wb_pc~0); 82735#L491 assume !(1 == ~e_c~0); 82827#L500-1 assume !(1 == ~e_e~0); 82828#L505-1 assume !(1 == ~e_f~0); 82679#L510-1 assume !(1 == ~e_g~0); 82680#L515-1 assume !(1 == ~e_c~0); 82782#L520-1 assume !(1 == ~e_wl~0); 82783#L662-1 assume !false; 85002#L532 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; 91209#L367 [2019-10-22 09:00:47,456 INFO L793 eck$LassoCheckResult]: Loop: 91209#L367 assume !false; 91201#L285 assume 0 == ~wl_st~0; 91190#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 91180#L311 assume !(0 != eval_~tmp~0); 91181#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91280#L326 assume !(0 != eval_~tmp___0~0); 91277#L322 assume !(0 == ~c2_st~0); 91227#L337 assume !(0 == ~wb_st~0); 91223#L352 assume !(0 == ~r_st~0); 91209#L367 [2019-10-22 09:00:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2019-10-22 09:00:47,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:47,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527206553] [2019-10-22 09:00:47,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:47,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:47,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:47,475 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 09:00:47,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527206553] [2019-10-22 09:00:47,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:47,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:47,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686253929] [2019-10-22 09:00:47,476 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash 850890528, now seen corresponding path program 2 times [2019-10-22 09:00:47,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:47,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385855234] [2019-10-22 09:00:47,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:47,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:47,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:47,484 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:47,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:47,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:47,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:47,511 INFO L87 Difference]: Start difference. First operand 19296 states and 30676 transitions. cyclomatic complexity: 11436 Second operand 3 states. [2019-10-22 09:00:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:47,557 INFO L93 Difference]: Finished difference Result 19244 states and 30595 transitions. [2019-10-22 09:00:47,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:47,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19244 states and 30595 transitions. [2019-10-22 09:00:47,628 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-10-22 09:00:47,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19244 states to 19244 states and 30595 transitions. [2019-10-22 09:00:47,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8234 [2019-10-22 09:00:47,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8234 [2019-10-22 09:00:47,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19244 states and 30595 transitions. [2019-10-22 09:00:47,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:47,698 INFO L688 BuchiCegarLoop]: Abstraction has 19244 states and 30595 transitions. [2019-10-22 09:00:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19244 states and 30595 transitions. [2019-10-22 09:00:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19244 to 19244. [2019-10-22 09:00:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19244 states. [2019-10-22 09:00:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19244 states to 19244 states and 30595 transitions. [2019-10-22 09:00:47,916 INFO L711 BuchiCegarLoop]: Abstraction has 19244 states and 30595 transitions. [2019-10-22 09:00:47,916 INFO L591 BuchiCegarLoop]: Abstraction has 19244 states and 30595 transitions. [2019-10-22 09:00:47,916 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-10-22 09:00:47,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19244 states and 30595 transitions. [2019-10-22 09:00:47,960 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-10-22 09:00:47,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:47,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:47,961 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 09:00:47,961 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:47,961 INFO L791 eck$LassoCheckResult]: Stem: 121318#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; 121105#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; 121106#L394 assume !(1 == ~c_req_up~0); 121108#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 121271#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 121307#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 121308#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 121369#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 121158#L425-1 assume !(0 == ~e_f~0); 121159#L430-1 assume !(0 == ~e_g~0); 121289#L435-1 assume !(0 == ~e_e~0); 121290#L440-1 assume !(0 == ~e_c~0); 121368#L445-1 assume !(0 == ~e_wl~0); 121367#L450-1 assume !(1 == ~wl_pc~0); 121326#L462 assume !(2 == ~wl_pc~0); 121116#L463 assume !(1 == ~c1_pc~0); 121275#L473 assume !(1 == ~c2_pc~0); 121361#L482 assume !(1 == ~wb_pc~0); 121214#L491 assume !(1 == ~e_c~0); 121215#L500-1 assume !(1 == ~e_e~0); 121351#L505-1 assume !(1 == ~e_f~0); 121224#L510-1 assume !(1 == ~e_g~0); 121225#L515-1 assume !(1 == ~e_c~0); 121279#L520-1 assume !(1 == ~e_wl~0); 121319#L662-1 assume !false; 122901#L532 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; 129788#L367 [2019-10-22 09:00:47,961 INFO L793 eck$LassoCheckResult]: Loop: 129788#L367 assume !false; 129783#L285 assume 0 == ~wl_st~0; 129780#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 129776#L311 assume !(0 != eval_~tmp~0); 129777#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 129594#L326 assume !(0 != eval_~tmp___0~0); 129826#L322 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 129804#L341 assume !(0 != eval_~tmp___1~0); 129799#L337 assume !(0 == ~wb_st~0); 129796#L352 assume !(0 == ~r_st~0); 129788#L367 [2019-10-22 09:00:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2019-10-22 09:00:47,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:47,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510360480] [2019-10-22 09:00:47,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:47,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:47,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:47,972 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:47,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:47,972 INFO L82 PathProgramCache]: Analyzing trace with hash 606182616, now seen corresponding path program 1 times [2019-10-22 09:00:47,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:47,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595398803] [2019-10-22 09:00:47,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:47,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:47,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:47,977 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2040800048, now seen corresponding path program 1 times [2019-10-22 09:00:47,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:47,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387839000] [2019-10-22 09:00:47,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:47,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:47,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:47,991 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 09:00:47,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387839000] [2019-10-22 09:00:47,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:47,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:47,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097862642] [2019-10-22 09:00:48,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:48,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:48,026 INFO L87 Difference]: Start difference. First operand 19244 states and 30595 transitions. cyclomatic complexity: 11407 Second operand 3 states. [2019-10-22 09:00:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:48,120 INFO L93 Difference]: Finished difference Result 33096 states and 52188 transitions. [2019-10-22 09:00:48,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:48,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33096 states and 52188 transitions. [2019-10-22 09:00:48,230 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 13770 [2019-10-22 09:00:48,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33096 states to 33096 states and 52188 transitions. [2019-10-22 09:00:48,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14128 [2019-10-22 09:00:48,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14128 [2019-10-22 09:00:48,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33096 states and 52188 transitions. [2019-10-22 09:00:48,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:48,346 INFO L688 BuchiCegarLoop]: Abstraction has 33096 states and 52188 transitions. [2019-10-22 09:00:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33096 states and 52188 transitions. [2019-10-22 09:00:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33096 to 33096. [2019-10-22 09:00:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33096 states. [2019-10-22 09:00:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33096 states to 33096 states and 52188 transitions. [2019-10-22 09:00:48,882 INFO L711 BuchiCegarLoop]: Abstraction has 33096 states and 52188 transitions. [2019-10-22 09:00:48,882 INFO L591 BuchiCegarLoop]: Abstraction has 33096 states and 52188 transitions. [2019-10-22 09:00:48,882 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-10-22 09:00:48,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33096 states and 52188 transitions. [2019-10-22 09:00:48,952 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 13770 [2019-10-22 09:00:48,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:48,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:48,953 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 09:00:48,953 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:48,953 INFO L791 eck$LassoCheckResult]: Stem: 173685#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; 173452#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; 173453#L394 assume !(1 == ~c_req_up~0); 173455#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 173631#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 173669#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 173670#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 173742#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 173507#L425-1 assume !(0 == ~e_f~0); 173508#L430-1 assume !(0 == ~e_g~0); 173651#L435-1 assume !(0 == ~e_e~0); 173652#L440-1 assume !(0 == ~e_c~0); 173741#L445-1 assume !(0 == ~e_wl~0); 173740#L450-1 assume !(1 == ~wl_pc~0); 173694#L462 assume !(2 == ~wl_pc~0); 173463#L463 assume !(1 == ~c1_pc~0); 173635#L473 assume !(1 == ~c2_pc~0); 173734#L482 assume !(1 == ~wb_pc~0); 173569#L491 assume !(1 == ~e_c~0); 173570#L500-1 assume !(1 == ~e_e~0); 173725#L505-1 assume !(1 == ~e_f~0); 173580#L510-1 assume !(1 == ~e_g~0); 173581#L515-1 assume !(1 == ~e_c~0); 173640#L520-1 assume !(1 == ~e_wl~0); 173686#L662-1 assume !false; 180618#L532 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; 180620#L367 [2019-10-22 09:00:48,953 INFO L793 eck$LassoCheckResult]: Loop: 180620#L367 assume !false; 180973#L285 assume 0 == ~wl_st~0; 180971#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 180970#L311 assume !(0 != eval_~tmp~0); 180969#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 180958#L326 assume !(0 != eval_~tmp___0~0); 180968#L322 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 180864#L341 assume !(0 != eval_~tmp___1~0); 180627#L337 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 180623#L356 assume !(0 != eval_~tmp___2~0); 180625#L352 assume !(0 == ~r_st~0); 180620#L367 [2019-10-22 09:00:48,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2019-10-22 09:00:48,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:48,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741375281] [2019-10-22 09:00:48,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,969 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:48,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:48,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1611757493, now seen corresponding path program 1 times [2019-10-22 09:00:48,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:48,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245805465] [2019-10-22 09:00:48,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,979 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:48,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1159673533, now seen corresponding path program 1 times [2019-10-22 09:00:48,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:48,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132819690] [2019-10-22 09:00:48,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:49,005 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:49,449 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2019-10-22 09:00:49,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:49 BoogieIcfgContainer [2019-10-22 09:00:49,541 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:49,542 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:49,542 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:49,542 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:49,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:41" (3/4) ... [2019-10-22 09:00:49,545 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:00:49,593 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c35a9645-d395-423a-a668-c7ffbefe762b/bin/uautomizer/witness.graphml [2019-10-22 09:00:49,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:49,594 INFO L168 Benchmark]: Toolchain (without parser) took 8816.35 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 502.8 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -84.9 MB). Peak memory consumption was 417.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:49,595 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:49,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -207.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:49,595 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:49,595 INFO L168 Benchmark]: Boogie Preprocessor took 29.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:49,595 INFO L168 Benchmark]: RCFGBuilder took 532.73 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: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:49,596 INFO L168 Benchmark]: BuchiAutomizer took 7719.66 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 342.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.8 MB). Peak memory consumption was 399.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:49,596 INFO L168 Benchmark]: Witness Printer took 51.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:49,598 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -207.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 532.73 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: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7719.66 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 342.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.8 MB). Peak memory consumption was 399.1 MB. Max. memory is 11.5 GB. * Witness Printer took 51.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 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 (15 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 33096 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 16 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 471 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had 33096 states and ocurred in iteration 15. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 4076 SDtfs, 3647 SDslu, 2145 SDs, 0 SdLazy, 375 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc2 concLT1 SILN1 SILU0 SILI8 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital84 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq179 hnf100 smp100 dnf211 smp50 tf111 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 284]: 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@7c2151dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@514f1633=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c7121ab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25a655a2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ff514b6=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: 284]: 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 ; [L679] int __retres1 ; [L683] e_wl = 2 [L684] e_c = e_wl [L685] e_g = e_c [L686] e_f = e_g [L687] e_e = e_f [L688] wl_pc = 0 [L689] c1_pc = 0 [L690] c2_pc = 0 [L691] wb_pc = 0 [L692] wb_i = 1 [L693] c2_i = wb_i [L694] c1_i = c2_i [L695] wl_i = c1_i [L696] r_i = 0 [L697] c_req_up = 0 [L698] d = 0 [L699] c = 0 [L390] int kernel_st ; [L393] kernel_st = 0 [L394] COND FALSE !((int )c_req_up == 1) [L405] COND TRUE (int )wl_i == 1 [L406] wl_st = 0 [L410] COND TRUE (int )c1_i == 1 [L411] c1_st = 0 [L415] COND TRUE (int )c2_i == 1 [L416] c2_st = 0 [L420] COND TRUE (int )wb_i == 1 [L421] wb_st = 0 [L425] COND FALSE !((int )r_i == 1) [L428] r_st = 2 [L430] COND FALSE !((int )e_f == 0) [L435] COND FALSE !((int )e_g == 0) [L440] COND FALSE !((int )e_e == 0) [L445] COND FALSE !((int )e_c == 0) [L450] COND FALSE !((int )e_wl == 0) [L455] COND FALSE !((int )wl_pc == 1) [L463] COND FALSE !((int )wl_pc == 2) [L473] COND FALSE !((int )c1_pc == 1) [L482] COND FALSE !((int )c2_pc == 1) [L491] COND FALSE !((int )wb_pc == 1) [L500] COND FALSE !((int )e_c == 1) [L505] COND FALSE !((int )e_e == 1) [L510] COND FALSE !((int )e_f == 1) [L515] COND FALSE !((int )e_g == 1) [L520] COND FALSE !((int )e_c == 1) [L525] COND FALSE !((int )e_wl == 1) [L531] COND TRUE 1 [L534] kernel_st = 1 [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; Loop: [L284] COND TRUE 1 [L286] COND TRUE (int )wl_st == 0 [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND FALSE !(\read(tmp)) [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND FALSE !(\read(tmp___0)) [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND FALSE !(\read(tmp___1)) [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND FALSE !(\read(tmp___2)) [L367] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...