./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy2.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f721563b23ef637d292551ef1a662f821e744b5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:13:52,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:13:52,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:13:53,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:13:53,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:13:53,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:13:53,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:13:53,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:13:53,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:13:53,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:13:53,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:13:53,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:13:53,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:13:53,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:13:53,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:13:53,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:13:53,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:13:53,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:13:53,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:13:53,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:13:53,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:13:53,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:13:53,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:13:53,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:13:53,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:13:53,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:13:53,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:13:53,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:13:53,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:13:53,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:13:53,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:13:53,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:13:53,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:13:53,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:13:53,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:13:53,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:13:53,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:13:53,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:13:53,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:13:53,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:13:53,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:13:53,088 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:13:53,126 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:13:53,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:13:53,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:13:53,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:13:53,128 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:13:53,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:13:53,129 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:13:53,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:13:53,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:13:53,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:13:53,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:13:53,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:13:53,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:13:53,130 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:13:53,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:13:53,131 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:13:53,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:13:53,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:13:53,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:13:53,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:13:53,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:13:53,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:13:53,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:13:53,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:13:53,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:13:53,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:13:53,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:13:53,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:13:53,134 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:13:53,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/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(G ! call(reach_error())) ) 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 -> 0f721563b23ef637d292551ef1a662f821e744b5 [2020-11-28 03:13:53,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:13:53,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:13:53,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:13:53,443 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:13:53,445 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:13:53,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/../../sv-benchmarks/c/systemc/toy2.cil.c [2020-11-28 03:13:53,534 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/data/dbef21c60/23fa93f48cc94e07962bcdedd73fa041/FLAG20ad252c4 [2020-11-28 03:13:54,031 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:13:54,032 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/sv-benchmarks/c/systemc/toy2.cil.c [2020-11-28 03:13:54,049 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/data/dbef21c60/23fa93f48cc94e07962bcdedd73fa041/FLAG20ad252c4 [2020-11-28 03:13:54,376 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/data/dbef21c60/23fa93f48cc94e07962bcdedd73fa041 [2020-11-28 03:13:54,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:13:54,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:13:54,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:13:54,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:13:54,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:13:54,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1f5988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54, skipping insertion in model container [2020-11-28 03:13:54,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:13:54,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:13:54,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:13:54,679 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:13:54,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:13:54,746 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:13:54,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54 WrapperNode [2020-11-28 03:13:54,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:13:54,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:13:54,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:13:54,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:13:54,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:13:54,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:13:54,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:13:54,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:13:54,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (1/1) ... [2020-11-28 03:13:54,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:13:54,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:13:54,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:13:54,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:13:54,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:13:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:13:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:13:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:13:54,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:13:55,736 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:13:55,742 INFO L298 CfgBuilder]: Removed 28 assume(true) statements. [2020-11-28 03:13:55,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:55 BoogieIcfgContainer [2020-11-28 03:13:55,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:13:55,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:13:55,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:13:55,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:13:55,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:13:54" (1/3) ... [2020-11-28 03:13:55,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc91bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:13:55, skipping insertion in model container [2020-11-28 03:13:55,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:54" (2/3) ... [2020-11-28 03:13:55,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc91bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:13:55, skipping insertion in model container [2020-11-28 03:13:55,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:55" (3/3) ... [2020-11-28 03:13:55,757 INFO L111 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2020-11-28 03:13:55,767 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:13:55,772 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-28 03:13:55,784 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-28 03:13:55,819 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:13:55,820 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:13:55,820 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:13:55,820 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:13:55,820 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:13:55,821 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:13:55,821 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:13:55,821 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:13:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2020-11-28 03:13:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:55,851 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:55,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:55,852 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:55,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1633671955, now seen corresponding path program 1 times [2020-11-28 03:13:55,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:55,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014457797] [2020-11-28 03:13:55,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:56,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014457797] [2020-11-28 03:13:56,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:56,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:56,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239545799] [2020-11-28 03:13:56,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:56,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:56,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:56,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:56,077 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2020-11-28 03:13:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:56,141 INFO L93 Difference]: Finished difference Result 243 states and 450 transitions. [2020-11-28 03:13:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:56,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-28 03:13:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:56,160 INFO L225 Difference]: With dead ends: 243 [2020-11-28 03:13:56,161 INFO L226 Difference]: Without dead ends: 121 [2020-11-28 03:13:56,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-28 03:13:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-11-28 03:13:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-28 03:13:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2020-11-28 03:13:56,243 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 35 [2020-11-28 03:13:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:56,244 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2020-11-28 03:13:56,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2020-11-28 03:13:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:56,250 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:56,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:56,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:13:56,251 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1611039701, now seen corresponding path program 1 times [2020-11-28 03:13:56,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:56,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814825470] [2020-11-28 03:13:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:56,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814825470] [2020-11-28 03:13:56,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:56,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:56,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756397848] [2020-11-28 03:13:56,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:56,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:56,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:56,386 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 4 states. [2020-11-28 03:13:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:56,459 INFO L93 Difference]: Finished difference Result 325 states and 571 transitions. [2020-11-28 03:13:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:13:56,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-28 03:13:56,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:56,464 INFO L225 Difference]: With dead ends: 325 [2020-11-28 03:13:56,464 INFO L226 Difference]: Without dead ends: 207 [2020-11-28 03:13:56,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-11-28 03:13:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2020-11-28 03:13:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-28 03:13:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 357 transitions. [2020-11-28 03:13:56,501 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 357 transitions. Word has length 35 [2020-11-28 03:13:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:56,502 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 357 transitions. [2020-11-28 03:13:56,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 357 transitions. [2020-11-28 03:13:56,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:56,504 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:56,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:56,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:13:56,504 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:56,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1101566611, now seen corresponding path program 1 times [2020-11-28 03:13:56,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:56,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782604894] [2020-11-28 03:13:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:56,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782604894] [2020-11-28 03:13:56,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:56,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:56,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955756531] [2020-11-28 03:13:56,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:56,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:56,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:56,580 INFO L87 Difference]: Start difference. First operand 204 states and 357 transitions. Second operand 3 states. [2020-11-28 03:13:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:56,648 INFO L93 Difference]: Finished difference Result 399 states and 701 transitions. [2020-11-28 03:13:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:56,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-28 03:13:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:56,651 INFO L225 Difference]: With dead ends: 399 [2020-11-28 03:13:56,651 INFO L226 Difference]: Without dead ends: 204 [2020-11-28 03:13:56,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-11-28 03:13:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2020-11-28 03:13:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-28 03:13:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 345 transitions. [2020-11-28 03:13:56,692 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 345 transitions. Word has length 35 [2020-11-28 03:13:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:56,693 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 345 transitions. [2020-11-28 03:13:56,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 345 transitions. [2020-11-28 03:13:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:56,695 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:56,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:56,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:13:56,695 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1744930967, now seen corresponding path program 1 times [2020-11-28 03:13:56,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:56,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472591246] [2020-11-28 03:13:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:56,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472591246] [2020-11-28 03:13:56,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:56,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:56,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842443971] [2020-11-28 03:13:56,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:56,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:56,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:56,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:56,796 INFO L87 Difference]: Start difference. First operand 204 states and 345 transitions. Second operand 4 states. [2020-11-28 03:13:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:56,967 INFO L93 Difference]: Finished difference Result 553 states and 938 transitions. [2020-11-28 03:13:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:13:56,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-28 03:13:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:56,971 INFO L225 Difference]: With dead ends: 553 [2020-11-28 03:13:56,971 INFO L226 Difference]: Without dead ends: 359 [2020-11-28 03:13:56,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-11-28 03:13:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 204. [2020-11-28 03:13:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-28 03:13:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 342 transitions. [2020-11-28 03:13:56,994 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 342 transitions. Word has length 35 [2020-11-28 03:13:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:56,995 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 342 transitions. [2020-11-28 03:13:56,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 342 transitions. [2020-11-28 03:13:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:56,997 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:56,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:56,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:13:56,997 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:56,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:56,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1806970581, now seen corresponding path program 1 times [2020-11-28 03:13:56,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:56,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003099103] [2020-11-28 03:13:56,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:57,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003099103] [2020-11-28 03:13:57,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:57,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:57,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825336615] [2020-11-28 03:13:57,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:57,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:57,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:57,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:57,050 INFO L87 Difference]: Start difference. First operand 204 states and 342 transitions. Second operand 4 states. [2020-11-28 03:13:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:57,158 INFO L93 Difference]: Finished difference Result 556 states and 934 transitions. [2020-11-28 03:13:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:13:57,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-28 03:13:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:57,166 INFO L225 Difference]: With dead ends: 556 [2020-11-28 03:13:57,166 INFO L226 Difference]: Without dead ends: 363 [2020-11-28 03:13:57,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-11-28 03:13:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 204. [2020-11-28 03:13:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-28 03:13:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 339 transitions. [2020-11-28 03:13:57,188 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 339 transitions. Word has length 35 [2020-11-28 03:13:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:57,188 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 339 transitions. [2020-11-28 03:13:57,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 339 transitions. [2020-11-28 03:13:57,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:57,190 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:57,190 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:57,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:13:57,191 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:57,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1947519191, now seen corresponding path program 1 times [2020-11-28 03:13:57,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:57,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295706068] [2020-11-28 03:13:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:57,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295706068] [2020-11-28 03:13:57,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:57,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:57,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242204102] [2020-11-28 03:13:57,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:57,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:57,266 INFO L87 Difference]: Start difference. First operand 204 states and 339 transitions. Second operand 4 states. [2020-11-28 03:13:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:57,382 INFO L93 Difference]: Finished difference Result 568 states and 945 transitions. [2020-11-28 03:13:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:13:57,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-28 03:13:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:57,385 INFO L225 Difference]: With dead ends: 568 [2020-11-28 03:13:57,385 INFO L226 Difference]: Without dead ends: 376 [2020-11-28 03:13:57,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-11-28 03:13:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 210. [2020-11-28 03:13:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-28 03:13:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 343 transitions. [2020-11-28 03:13:57,408 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 343 transitions. Word has length 35 [2020-11-28 03:13:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:57,413 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 343 transitions. [2020-11-28 03:13:57,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 343 transitions. [2020-11-28 03:13:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:57,422 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:57,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:57,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:13:57,424 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:57,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:57,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1813505685, now seen corresponding path program 1 times [2020-11-28 03:13:57,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:57,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90270653] [2020-11-28 03:13:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:57,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90270653] [2020-11-28 03:13:57,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:57,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:57,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690295098] [2020-11-28 03:13:57,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:57,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:57,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:57,484 INFO L87 Difference]: Start difference. First operand 210 states and 343 transitions. Second operand 4 states. [2020-11-28 03:13:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:57,607 INFO L93 Difference]: Finished difference Result 713 states and 1165 transitions. [2020-11-28 03:13:57,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:13:57,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-28 03:13:57,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:57,611 INFO L225 Difference]: With dead ends: 713 [2020-11-28 03:13:57,611 INFO L226 Difference]: Without dead ends: 516 [2020-11-28 03:13:57,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-11-28 03:13:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 341. [2020-11-28 03:13:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-11-28 03:13:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 554 transitions. [2020-11-28 03:13:57,638 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 554 transitions. Word has length 35 [2020-11-28 03:13:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:57,639 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 554 transitions. [2020-11-28 03:13:57,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 554 transitions. [2020-11-28 03:13:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:57,640 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:57,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:57,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:13:57,640 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash 8067351, now seen corresponding path program 1 times [2020-11-28 03:13:57,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:57,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707702834] [2020-11-28 03:13:57,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:57,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707702834] [2020-11-28 03:13:57,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:57,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:57,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849465351] [2020-11-28 03:13:57,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:57,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:57,697 INFO L87 Difference]: Start difference. First operand 341 states and 554 transitions. Second operand 3 states. [2020-11-28 03:13:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:57,756 INFO L93 Difference]: Finished difference Result 812 states and 1325 transitions. [2020-11-28 03:13:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:57,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-28 03:13:57,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:57,761 INFO L225 Difference]: With dead ends: 812 [2020-11-28 03:13:57,761 INFO L226 Difference]: Without dead ends: 495 [2020-11-28 03:13:57,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-11-28 03:13:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2020-11-28 03:13:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-11-28 03:13:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 800 transitions. [2020-11-28 03:13:57,809 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 800 transitions. Word has length 35 [2020-11-28 03:13:57,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:57,810 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 800 transitions. [2020-11-28 03:13:57,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 800 transitions. [2020-11-28 03:13:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:57,811 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:57,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:57,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:13:57,811 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2127880731, now seen corresponding path program 1 times [2020-11-28 03:13:57,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:57,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700094564] [2020-11-28 03:13:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:57,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700094564] [2020-11-28 03:13:57,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:57,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:57,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71011373] [2020-11-28 03:13:57,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:57,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:57,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:57,874 INFO L87 Difference]: Start difference. First operand 493 states and 800 transitions. Second operand 4 states. [2020-11-28 03:13:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:57,982 INFO L93 Difference]: Finished difference Result 1255 states and 2037 transitions. [2020-11-28 03:13:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:13:57,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-28 03:13:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:57,988 INFO L225 Difference]: With dead ends: 1255 [2020-11-28 03:13:57,988 INFO L226 Difference]: Without dead ends: 779 [2020-11-28 03:13:57,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-11-28 03:13:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 493. [2020-11-28 03:13:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-11-28 03:13:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 792 transitions. [2020-11-28 03:13:58,023 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 792 transitions. Word has length 35 [2020-11-28 03:13:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:58,024 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 792 transitions. [2020-11-28 03:13:58,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 792 transitions. [2020-11-28 03:13:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:58,024 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:58,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:58,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:13:58,025 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:58,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1106812377, now seen corresponding path program 1 times [2020-11-28 03:13:58,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:58,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062939557] [2020-11-28 03:13:58,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:58,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062939557] [2020-11-28 03:13:58,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:58,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:58,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98274758] [2020-11-28 03:13:58,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:58,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:58,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:58,060 INFO L87 Difference]: Start difference. First operand 493 states and 792 transitions. Second operand 4 states. [2020-11-28 03:13:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:58,192 INFO L93 Difference]: Finished difference Result 1251 states and 2010 transitions. [2020-11-28 03:13:58,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:13:58,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-28 03:13:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:58,200 INFO L225 Difference]: With dead ends: 1251 [2020-11-28 03:13:58,201 INFO L226 Difference]: Without dead ends: 781 [2020-11-28 03:13:58,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-11-28 03:13:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 493. [2020-11-28 03:13:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-11-28 03:13:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 784 transitions. [2020-11-28 03:13:58,238 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 784 transitions. Word has length 35 [2020-11-28 03:13:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:58,240 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 784 transitions. [2020-11-28 03:13:58,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 784 transitions. [2020-11-28 03:13:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:58,241 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:58,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:58,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:13:58,242 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:58,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:58,242 INFO L82 PathProgramCache]: Analyzing trace with hash 95695127, now seen corresponding path program 1 times [2020-11-28 03:13:58,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:58,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423737463] [2020-11-28 03:13:58,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:58,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423737463] [2020-11-28 03:13:58,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:58,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:58,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986591952] [2020-11-28 03:13:58,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:58,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:58,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:58,315 INFO L87 Difference]: Start difference. First operand 493 states and 784 transitions. Second operand 4 states. [2020-11-28 03:13:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:58,442 INFO L93 Difference]: Finished difference Result 1192 states and 1892 transitions. [2020-11-28 03:13:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:13:58,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-28 03:13:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:58,448 INFO L225 Difference]: With dead ends: 1192 [2020-11-28 03:13:58,448 INFO L226 Difference]: Without dead ends: 716 [2020-11-28 03:13:58,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-11-28 03:13:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 541. [2020-11-28 03:13:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-11-28 03:13:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 841 transitions. [2020-11-28 03:13:58,493 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 841 transitions. Word has length 35 [2020-11-28 03:13:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:58,494 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 841 transitions. [2020-11-28 03:13:58,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 841 transitions. [2020-11-28 03:13:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 03:13:58,494 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:58,494 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:58,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:13:58,495 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash 353860565, now seen corresponding path program 1 times [2020-11-28 03:13:58,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:58,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112312296] [2020-11-28 03:13:58,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:58,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112312296] [2020-11-28 03:13:58,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:58,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:58,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151751336] [2020-11-28 03:13:58,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:58,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:58,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:58,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:58,537 INFO L87 Difference]: Start difference. First operand 541 states and 841 transitions. Second operand 3 states. [2020-11-28 03:13:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:58,618 INFO L93 Difference]: Finished difference Result 1288 states and 2008 transitions. [2020-11-28 03:13:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:58,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-28 03:13:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:58,624 INFO L225 Difference]: With dead ends: 1288 [2020-11-28 03:13:58,624 INFO L226 Difference]: Without dead ends: 761 [2020-11-28 03:13:58,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-11-28 03:13:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 758. [2020-11-28 03:13:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2020-11-28 03:13:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1165 transitions. [2020-11-28 03:13:58,673 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1165 transitions. Word has length 35 [2020-11-28 03:13:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:58,673 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 1165 transitions. [2020-11-28 03:13:58,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1165 transitions. [2020-11-28 03:13:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-28 03:13:58,674 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:58,674 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1] [2020-11-28 03:13:58,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:13:58,675 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:58,675 INFO L82 PathProgramCache]: Analyzing trace with hash -230098911, now seen corresponding path program 1 times [2020-11-28 03:13:58,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:58,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243573272] [2020-11-28 03:13:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:58,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243573272] [2020-11-28 03:13:58,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:58,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:58,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306305668] [2020-11-28 03:13:58,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:58,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:58,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:58,707 INFO L87 Difference]: Start difference. First operand 758 states and 1165 transitions. Second operand 3 states. [2020-11-28 03:13:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:58,807 INFO L93 Difference]: Finished difference Result 1864 states and 2903 transitions. [2020-11-28 03:13:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:58,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-11-28 03:13:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:58,814 INFO L225 Difference]: With dead ends: 1864 [2020-11-28 03:13:58,815 INFO L226 Difference]: Without dead ends: 1133 [2020-11-28 03:13:58,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2020-11-28 03:13:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2020-11-28 03:13:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2020-11-28 03:13:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1752 transitions. [2020-11-28 03:13:58,890 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1752 transitions. Word has length 45 [2020-11-28 03:13:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:58,890 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1752 transitions. [2020-11-28 03:13:58,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1752 transitions. [2020-11-28 03:13:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-28 03:13:58,892 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:58,893 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1] [2020-11-28 03:13:58,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:13:58,894 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:58,894 INFO L82 PathProgramCache]: Analyzing trace with hash 193547811, now seen corresponding path program 1 times [2020-11-28 03:13:58,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:58,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482343143] [2020-11-28 03:13:58,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-28 03:13:58,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482343143] [2020-11-28 03:13:58,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:58,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:58,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433242804] [2020-11-28 03:13:58,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:58,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:58,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:58,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:58,937 INFO L87 Difference]: Start difference. First operand 1131 states and 1752 transitions. Second operand 3 states. [2020-11-28 03:13:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:59,014 INFO L93 Difference]: Finished difference Result 2213 states and 3445 transitions. [2020-11-28 03:13:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:59,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-11-28 03:13:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:59,022 INFO L225 Difference]: With dead ends: 2213 [2020-11-28 03:13:59,022 INFO L226 Difference]: Without dead ends: 1109 [2020-11-28 03:13:59,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2020-11-28 03:13:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2020-11-28 03:13:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2020-11-28 03:13:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1725 transitions. [2020-11-28 03:13:59,118 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1725 transitions. Word has length 45 [2020-11-28 03:13:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:59,118 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 1725 transitions. [2020-11-28 03:13:59,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1725 transitions. [2020-11-28 03:13:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-28 03:13:59,120 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:59,120 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1] [2020-11-28 03:13:59,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:13:59,120 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:59,121 INFO L82 PathProgramCache]: Analyzing trace with hash 668512427, now seen corresponding path program 1 times [2020-11-28 03:13:59,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:59,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551187610] [2020-11-28 03:13:59,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:59,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551187610] [2020-11-28 03:13:59,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:59,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:59,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148086531] [2020-11-28 03:13:59,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:59,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:59,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:59,158 INFO L87 Difference]: Start difference. First operand 1109 states and 1725 transitions. Second operand 3 states. [2020-11-28 03:13:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:59,284 INFO L93 Difference]: Finished difference Result 2813 states and 4432 transitions. [2020-11-28 03:13:59,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:59,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-11-28 03:13:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:59,295 INFO L225 Difference]: With dead ends: 2813 [2020-11-28 03:13:59,295 INFO L226 Difference]: Without dead ends: 1731 [2020-11-28 03:13:59,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2020-11-28 03:13:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1729. [2020-11-28 03:13:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2020-11-28 03:13:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2711 transitions. [2020-11-28 03:13:59,452 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2711 transitions. Word has length 46 [2020-11-28 03:13:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:59,453 INFO L481 AbstractCegarLoop]: Abstraction has 1729 states and 2711 transitions. [2020-11-28 03:13:59,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2711 transitions. [2020-11-28 03:13:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-28 03:13:59,455 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:59,455 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2020-11-28 03:13:59,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:13:59,455 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:59,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash -710212426, now seen corresponding path program 1 times [2020-11-28 03:13:59,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:59,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364159472] [2020-11-28 03:13:59,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:59,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364159472] [2020-11-28 03:13:59,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:59,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:59,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420043057] [2020-11-28 03:13:59,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:59,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:59,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:59,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:59,499 INFO L87 Difference]: Start difference. First operand 1729 states and 2711 transitions. Second operand 3 states. [2020-11-28 03:13:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:59,709 INFO L93 Difference]: Finished difference Result 4644 states and 7373 transitions. [2020-11-28 03:13:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:59,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-11-28 03:13:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:59,727 INFO L225 Difference]: With dead ends: 4644 [2020-11-28 03:13:59,727 INFO L226 Difference]: Without dead ends: 2944 [2020-11-28 03:13:59,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-11-28 03:13:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2942. [2020-11-28 03:13:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2020-11-28 03:13:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4650 transitions. [2020-11-28 03:13:59,959 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4650 transitions. Word has length 47 [2020-11-28 03:13:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:59,959 INFO L481 AbstractCegarLoop]: Abstraction has 2942 states and 4650 transitions. [2020-11-28 03:13:59,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4650 transitions. [2020-11-28 03:13:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-28 03:13:59,961 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:59,961 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2020-11-28 03:13:59,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:13:59,963 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash -286565704, now seen corresponding path program 1 times [2020-11-28 03:13:59,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:59,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758152460] [2020-11-28 03:13:59,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-28 03:14:00,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758152460] [2020-11-28 03:14:00,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:00,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:14:00,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007298994] [2020-11-28 03:14:00,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:00,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:00,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:00,005 INFO L87 Difference]: Start difference. First operand 2942 states and 4650 transitions. Second operand 3 states. [2020-11-28 03:14:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:00,224 INFO L93 Difference]: Finished difference Result 5833 states and 9241 transitions. [2020-11-28 03:14:00,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:00,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-11-28 03:14:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:00,241 INFO L225 Difference]: With dead ends: 5833 [2020-11-28 03:14:00,242 INFO L226 Difference]: Without dead ends: 2920 [2020-11-28 03:14:00,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:00,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-11-28 03:14:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2020-11-28 03:14:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2020-11-28 03:14:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4624 transitions. [2020-11-28 03:14:00,492 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4624 transitions. Word has length 47 [2020-11-28 03:14:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:00,492 INFO L481 AbstractCegarLoop]: Abstraction has 2920 states and 4624 transitions. [2020-11-28 03:14:00,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4624 transitions. [2020-11-28 03:14:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-28 03:14:00,494 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:00,495 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1] [2020-11-28 03:14:00,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:14:00,495 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:00,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:00,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1167001578, now seen corresponding path program 1 times [2020-11-28 03:14:00,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:00,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065719435] [2020-11-28 03:14:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:14:00,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065719435] [2020-11-28 03:14:00,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:00,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:14:00,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903126383] [2020-11-28 03:14:00,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:14:00,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:00,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:14:00,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:14:00,538 INFO L87 Difference]: Start difference. First operand 2920 states and 4624 transitions. Second operand 4 states. [2020-11-28 03:14:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:00,967 INFO L93 Difference]: Finished difference Result 7421 states and 11813 transitions. [2020-11-28 03:14:00,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:14:00,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-11-28 03:14:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:00,990 INFO L225 Difference]: With dead ends: 7421 [2020-11-28 03:14:00,991 INFO L226 Difference]: Without dead ends: 3797 [2020-11-28 03:14:00,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:14:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2020-11-28 03:14:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3797. [2020-11-28 03:14:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2020-11-28 03:14:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 5990 transitions. [2020-11-28 03:14:01,316 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 5990 transitions. Word has length 48 [2020-11-28 03:14:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:01,316 INFO L481 AbstractCegarLoop]: Abstraction has 3797 states and 5990 transitions. [2020-11-28 03:14:01,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:14:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 5990 transitions. [2020-11-28 03:14:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-28 03:14:01,318 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:01,318 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:01,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:14:01,318 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1620471122, now seen corresponding path program 1 times [2020-11-28 03:14:01,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:01,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755518722] [2020-11-28 03:14:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:14:01,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755518722] [2020-11-28 03:14:01,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:01,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:14:01,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033865888] [2020-11-28 03:14:01,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:14:01,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:01,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:14:01,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:14:01,385 INFO L87 Difference]: Start difference. First operand 3797 states and 5990 transitions. Second operand 5 states. [2020-11-28 03:14:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:01,887 INFO L93 Difference]: Finished difference Result 9692 states and 15178 transitions. [2020-11-28 03:14:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:14:01,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-11-28 03:14:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:01,937 INFO L225 Difference]: With dead ends: 9692 [2020-11-28 03:14:01,937 INFO L226 Difference]: Without dead ends: 5918 [2020-11-28 03:14:01,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:14:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2020-11-28 03:14:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 4440. [2020-11-28 03:14:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4440 states. [2020-11-28 03:14:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6847 transitions. [2020-11-28 03:14:02,368 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6847 transitions. Word has length 53 [2020-11-28 03:14:02,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:02,368 INFO L481 AbstractCegarLoop]: Abstraction has 4440 states and 6847 transitions. [2020-11-28 03:14:02,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:14:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6847 transitions. [2020-11-28 03:14:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-28 03:14:02,372 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:02,373 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:02,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 03:14:02,373 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:02,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:02,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2101139439, now seen corresponding path program 1 times [2020-11-28 03:14:02,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:02,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300775023] [2020-11-28 03:14:02,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:14:02,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300775023] [2020-11-28 03:14:02,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:02,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:14:02,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447653877] [2020-11-28 03:14:02,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:02,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:02,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:02,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:02,428 INFO L87 Difference]: Start difference. First operand 4440 states and 6847 transitions. Second operand 3 states. [2020-11-28 03:14:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:02,841 INFO L93 Difference]: Finished difference Result 9203 states and 14160 transitions. [2020-11-28 03:14:02,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:02,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-11-28 03:14:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:02,851 INFO L225 Difference]: With dead ends: 9203 [2020-11-28 03:14:02,852 INFO L226 Difference]: Without dead ends: 4792 [2020-11-28 03:14:02,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2020-11-28 03:14:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4760. [2020-11-28 03:14:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4760 states. [2020-11-28 03:14:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 7096 transitions. [2020-11-28 03:14:03,128 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 7096 transitions. Word has length 85 [2020-11-28 03:14:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:03,129 INFO L481 AbstractCegarLoop]: Abstraction has 4760 states and 7096 transitions. [2020-11-28 03:14:03,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 7096 transitions. [2020-11-28 03:14:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-28 03:14:03,133 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:03,133 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:03,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 03:14:03,134 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:03,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:03,134 INFO L82 PathProgramCache]: Analyzing trace with hash 378663463, now seen corresponding path program 1 times [2020-11-28 03:14:03,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:03,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193602750] [2020-11-28 03:14:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:14:03,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193602750] [2020-11-28 03:14:03,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:03,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:14:03,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36267513] [2020-11-28 03:14:03,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:03,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:03,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:03,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:03,179 INFO L87 Difference]: Start difference. First operand 4760 states and 7096 transitions. Second operand 3 states. [2020-11-28 03:14:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:03,489 INFO L93 Difference]: Finished difference Result 10001 states and 14870 transitions. [2020-11-28 03:14:03,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:03,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-11-28 03:14:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:03,500 INFO L225 Difference]: With dead ends: 10001 [2020-11-28 03:14:03,500 INFO L226 Difference]: Without dead ends: 5282 [2020-11-28 03:14:03,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2020-11-28 03:14:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5234. [2020-11-28 03:14:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2020-11-28 03:14:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7539 transitions. [2020-11-28 03:14:03,795 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7539 transitions. Word has length 86 [2020-11-28 03:14:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:03,795 INFO L481 AbstractCegarLoop]: Abstraction has 5234 states and 7539 transitions. [2020-11-28 03:14:03,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7539 transitions. [2020-11-28 03:14:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-28 03:14:03,800 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:03,801 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:03,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-28 03:14:03,801 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:03,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2102863697, now seen corresponding path program 1 times [2020-11-28 03:14:03,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:03,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788293293] [2020-11-28 03:14:03,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:14:03,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788293293] [2020-11-28 03:14:03,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:03,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:14:03,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675472560] [2020-11-28 03:14:03,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:03,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:03,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:03,855 INFO L87 Difference]: Start difference. First operand 5234 states and 7539 transitions. Second operand 3 states. [2020-11-28 03:14:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:04,257 INFO L93 Difference]: Finished difference Result 10775 states and 15529 transitions. [2020-11-28 03:14:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:04,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-11-28 03:14:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:04,268 INFO L225 Difference]: With dead ends: 10775 [2020-11-28 03:14:04,268 INFO L226 Difference]: Without dead ends: 5602 [2020-11-28 03:14:04,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2020-11-28 03:14:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 5024. [2020-11-28 03:14:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5024 states. [2020-11-28 03:14:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5024 states to 5024 states and 6917 transitions. [2020-11-28 03:14:04,720 INFO L78 Accepts]: Start accepts. Automaton has 5024 states and 6917 transitions. Word has length 87 [2020-11-28 03:14:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:04,720 INFO L481 AbstractCegarLoop]: Abstraction has 5024 states and 6917 transitions. [2020-11-28 03:14:04,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5024 states and 6917 transitions. [2020-11-28 03:14:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-28 03:14:04,726 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:04,726 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:04,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-28 03:14:04,727 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:04,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:04,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1080949445, now seen corresponding path program 1 times [2020-11-28 03:14:04,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:04,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010311484] [2020-11-28 03:14:04,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-28 03:14:04,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010311484] [2020-11-28 03:14:04,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:04,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:14:04,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129331616] [2020-11-28 03:14:04,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:14:04,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:04,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:14:04,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:14:04,798 INFO L87 Difference]: Start difference. First operand 5024 states and 6917 transitions. Second operand 4 states. [2020-11-28 03:14:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:05,512 INFO L93 Difference]: Finished difference Result 9412 states and 12909 transitions. [2020-11-28 03:14:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:14:05,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-28 03:14:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:05,524 INFO L225 Difference]: With dead ends: 9412 [2020-11-28 03:14:05,524 INFO L226 Difference]: Without dead ends: 4839 [2020-11-28 03:14:05,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:14:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2020-11-28 03:14:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4725. [2020-11-28 03:14:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2020-11-28 03:14:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 6299 transitions. [2020-11-28 03:14:05,894 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 6299 transitions. Word has length 88 [2020-11-28 03:14:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:05,894 INFO L481 AbstractCegarLoop]: Abstraction has 4725 states and 6299 transitions. [2020-11-28 03:14:05,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:14:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 6299 transitions. [2020-11-28 03:14:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-28 03:14:05,906 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:05,906 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:05,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-28 03:14:05,906 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:05,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash -273115530, now seen corresponding path program 1 times [2020-11-28 03:14:05,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:05,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265522619] [2020-11-28 03:14:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-28 03:14:05,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265522619] [2020-11-28 03:14:05,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:05,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:14:05,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705252525] [2020-11-28 03:14:05,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:05,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:05,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:05,955 INFO L87 Difference]: Start difference. First operand 4725 states and 6299 transitions. Second operand 3 states. [2020-11-28 03:14:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:06,247 INFO L93 Difference]: Finished difference Result 9005 states and 11995 transitions. [2020-11-28 03:14:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:06,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-11-28 03:14:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:06,257 INFO L225 Difference]: With dead ends: 9005 [2020-11-28 03:14:06,257 INFO L226 Difference]: Without dead ends: 4671 [2020-11-28 03:14:06,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2020-11-28 03:14:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4671. [2020-11-28 03:14:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4671 states. [2020-11-28 03:14:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 6193 transitions. [2020-11-28 03:14:06,625 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 6193 transitions. Word has length 115 [2020-11-28 03:14:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:06,625 INFO L481 AbstractCegarLoop]: Abstraction has 4671 states and 6193 transitions. [2020-11-28 03:14:06,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 6193 transitions. [2020-11-28 03:14:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-11-28 03:14:06,633 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:06,633 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:06,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-28 03:14:06,634 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:06,634 INFO L82 PathProgramCache]: Analyzing trace with hash -471932119, now seen corresponding path program 1 times [2020-11-28 03:14:06,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:06,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116817512] [2020-11-28 03:14:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-28 03:14:06,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116817512] [2020-11-28 03:14:06,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:06,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:14:06,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386966458] [2020-11-28 03:14:06,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:14:06,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:06,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:14:06,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:14:06,689 INFO L87 Difference]: Start difference. First operand 4671 states and 6193 transitions. Second operand 4 states. [2020-11-28 03:14:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:07,128 INFO L93 Difference]: Finished difference Result 8293 states and 11017 transitions. [2020-11-28 03:14:07,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:14:07,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2020-11-28 03:14:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:07,136 INFO L225 Difference]: With dead ends: 8293 [2020-11-28 03:14:07,137 INFO L226 Difference]: Without dead ends: 4591 [2020-11-28 03:14:07,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:14:07,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2020-11-28 03:14:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4589. [2020-11-28 03:14:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4589 states. [2020-11-28 03:14:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 5972 transitions. [2020-11-28 03:14:07,523 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 5972 transitions. Word has length 127 [2020-11-28 03:14:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:07,524 INFO L481 AbstractCegarLoop]: Abstraction has 4589 states and 5972 transitions. [2020-11-28 03:14:07,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:14:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 5972 transitions. [2020-11-28 03:14:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-28 03:14:07,531 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:07,531 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:07,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-28 03:14:07,532 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1801789853, now seen corresponding path program 1 times [2020-11-28 03:14:07,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:07,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604708366] [2020-11-28 03:14:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-28 03:14:07,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604708366] [2020-11-28 03:14:07,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:07,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:14:07,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247124862] [2020-11-28 03:14:07,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:07,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:07,588 INFO L87 Difference]: Start difference. First operand 4589 states and 5972 transitions. Second operand 3 states. [2020-11-28 03:14:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:07,911 INFO L93 Difference]: Finished difference Result 8791 states and 11432 transitions. [2020-11-28 03:14:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:07,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-11-28 03:14:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:07,921 INFO L225 Difference]: With dead ends: 8791 [2020-11-28 03:14:07,921 INFO L226 Difference]: Without dead ends: 4588 [2020-11-28 03:14:07,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2020-11-28 03:14:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 4548. [2020-11-28 03:14:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2020-11-28 03:14:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 5889 transitions. [2020-11-28 03:14:08,264 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 5889 transitions. Word has length 133 [2020-11-28 03:14:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:08,264 INFO L481 AbstractCegarLoop]: Abstraction has 4548 states and 5889 transitions. [2020-11-28 03:14:08,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 5889 transitions. [2020-11-28 03:14:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-28 03:14:08,271 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:08,271 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:08,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-28 03:14:08,272 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:08,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash -142067203, now seen corresponding path program 1 times [2020-11-28 03:14:08,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:08,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863284854] [2020-11-28 03:14:08,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-28 03:14:08,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863284854] [2020-11-28 03:14:08,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:08,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:14:08,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531541514] [2020-11-28 03:14:08,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:08,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:08,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:08,330 INFO L87 Difference]: Start difference. First operand 4548 states and 5889 transitions. Second operand 3 states. [2020-11-28 03:14:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:08,684 INFO L93 Difference]: Finished difference Result 8730 states and 11293 transitions. [2020-11-28 03:14:08,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:08,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-11-28 03:14:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:08,688 INFO L225 Difference]: With dead ends: 8730 [2020-11-28 03:14:08,689 INFO L226 Difference]: Without dead ends: 4558 [2020-11-28 03:14:08,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2020-11-28 03:14:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 4518. [2020-11-28 03:14:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2020-11-28 03:14:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5818 transitions. [2020-11-28 03:14:09,071 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5818 transitions. Word has length 133 [2020-11-28 03:14:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:09,072 INFO L481 AbstractCegarLoop]: Abstraction has 4518 states and 5818 transitions. [2020-11-28 03:14:09,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5818 transitions. [2020-11-28 03:14:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-28 03:14:09,080 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:09,080 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:09,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-28 03:14:09,081 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:09,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1934957922, now seen corresponding path program 1 times [2020-11-28 03:14:09,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:09,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836217562] [2020-11-28 03:14:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-28 03:14:09,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836217562] [2020-11-28 03:14:09,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:09,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:14:09,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426200452] [2020-11-28 03:14:09,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:14:09,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:09,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:14:09,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:14:09,161 INFO L87 Difference]: Start difference. First operand 4518 states and 5818 transitions. Second operand 4 states. [2020-11-28 03:14:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:09,549 INFO L93 Difference]: Finished difference Result 7327 states and 9468 transitions. [2020-11-28 03:14:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:14:09,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-11-28 03:14:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:09,554 INFO L225 Difference]: With dead ends: 7327 [2020-11-28 03:14:09,554 INFO L226 Difference]: Without dead ends: 3182 [2020-11-28 03:14:09,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:14:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2020-11-28 03:14:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3180. [2020-11-28 03:14:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3180 states. [2020-11-28 03:14:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4000 transitions. [2020-11-28 03:14:09,904 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4000 transitions. Word has length 136 [2020-11-28 03:14:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:09,904 INFO L481 AbstractCegarLoop]: Abstraction has 3180 states and 4000 transitions. [2020-11-28 03:14:09,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:14:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4000 transitions. [2020-11-28 03:14:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-28 03:14:09,910 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:09,910 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:09,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-28 03:14:09,911 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:09,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash 133231117, now seen corresponding path program 1 times [2020-11-28 03:14:09,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:09,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607785025] [2020-11-28 03:14:09,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-28 03:14:09,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607785025] [2020-11-28 03:14:09,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:09,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:14:09,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726757018] [2020-11-28 03:14:09,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:14:09,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:09,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:14:09,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:14:09,979 INFO L87 Difference]: Start difference. First operand 3180 states and 4000 transitions. Second operand 4 states. [2020-11-28 03:14:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:10,207 INFO L93 Difference]: Finished difference Result 5150 states and 6486 transitions. [2020-11-28 03:14:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:14:10,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-11-28 03:14:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:10,209 INFO L225 Difference]: With dead ends: 5150 [2020-11-28 03:14:10,209 INFO L226 Difference]: Without dead ends: 2043 [2020-11-28 03:14:10,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:14:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2020-11-28 03:14:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2020-11-28 03:14:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2020-11-28 03:14:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2486 transitions. [2020-11-28 03:14:10,324 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2486 transitions. Word has length 136 [2020-11-28 03:14:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:10,324 INFO L481 AbstractCegarLoop]: Abstraction has 2041 states and 2486 transitions. [2020-11-28 03:14:10,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:14:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2486 transitions. [2020-11-28 03:14:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-11-28 03:14:10,325 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:10,326 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:10,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-28 03:14:10,326 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1652555523, now seen corresponding path program 1 times [2020-11-28 03:14:10,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:10,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361563449] [2020-11-28 03:14:10,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-28 03:14:10,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361563449] [2020-11-28 03:14:10,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:10,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:14:10,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341126097] [2020-11-28 03:14:10,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:10,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:10,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:10,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:10,394 INFO L87 Difference]: Start difference. First operand 2041 states and 2486 transitions. Second operand 3 states. [2020-11-28 03:14:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:10,542 INFO L93 Difference]: Finished difference Result 3699 states and 4535 transitions. [2020-11-28 03:14:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:10,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-11-28 03:14:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:10,545 INFO L225 Difference]: With dead ends: 3699 [2020-11-28 03:14:10,545 INFO L226 Difference]: Without dead ends: 1999 [2020-11-28 03:14:10,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2020-11-28 03:14:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1931. [2020-11-28 03:14:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2020-11-28 03:14:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2328 transitions. [2020-11-28 03:14:10,725 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2328 transitions. Word has length 175 [2020-11-28 03:14:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:10,725 INFO L481 AbstractCegarLoop]: Abstraction has 1931 states and 2328 transitions. [2020-11-28 03:14:10,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2328 transitions. [2020-11-28 03:14:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-11-28 03:14:10,727 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:10,727 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:10,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-28 03:14:10,727 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash 919917832, now seen corresponding path program 1 times [2020-11-28 03:14:10,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:10,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801799617] [2020-11-28 03:14:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-28 03:14:10,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801799617] [2020-11-28 03:14:10,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:10,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:14:10,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837373940] [2020-11-28 03:14:10,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:10,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:10,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:10,788 INFO L87 Difference]: Start difference. First operand 1931 states and 2328 transitions. Second operand 3 states. [2020-11-28 03:14:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:11,004 INFO L93 Difference]: Finished difference Result 4154 states and 5043 transitions. [2020-11-28 03:14:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:11,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2020-11-28 03:14:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:11,008 INFO L225 Difference]: With dead ends: 4154 [2020-11-28 03:14:11,008 INFO L226 Difference]: Without dead ends: 2560 [2020-11-28 03:14:11,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2020-11-28 03:14:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2209. [2020-11-28 03:14:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2020-11-28 03:14:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2628 transitions. [2020-11-28 03:14:11,139 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2628 transitions. Word has length 181 [2020-11-28 03:14:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:11,139 INFO L481 AbstractCegarLoop]: Abstraction has 2209 states and 2628 transitions. [2020-11-28 03:14:11,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2628 transitions. [2020-11-28 03:14:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-28 03:14:11,141 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:11,141 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:11,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-28 03:14:11,142 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:11,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash 929862786, now seen corresponding path program 1 times [2020-11-28 03:14:11,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:11,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491886553] [2020-11-28 03:14:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:14:11,178 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:14:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:14:11,204 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:14:11,294 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:14:11,295 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:14:11,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-28 03:14:11,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:14:11 BoogieIcfgContainer [2020-11-28 03:14:11,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:14:11,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:14:11,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:14:11,548 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:14:11,549 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:55" (3/4) ... [2020-11-28 03:14:11,551 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:14:11,792 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9438237f-5fd8-4b61-8803-71c4bb69b98e/bin/uautomizer/witness.graphml [2020-11-28 03:14:11,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:14:11,794 INFO L168 Benchmark]: Toolchain (without parser) took 17413.43 ms. Allocated memory was 96.5 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 67.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 426.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:11,794 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 96.5 MB. Free memory was 55.4 MB in the beginning and 55.4 MB in the end (delta: 42.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:14:11,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.44 ms. Allocated memory is still 96.5 MB. Free memory was 67.0 MB in the beginning and 68.9 MB in the end (delta: -1.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:11,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.30 ms. Allocated memory is still 96.5 MB. Free memory was 68.9 MB in the beginning and 66.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:11,795 INFO L168 Benchmark]: Boogie Preprocessor took 76.18 ms. Allocated memory is still 96.5 MB. Free memory was 66.8 MB in the beginning and 64.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:11,796 INFO L168 Benchmark]: RCFGBuilder took 865.62 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 64.7 MB in the beginning and 72.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:11,796 INFO L168 Benchmark]: TraceAbstraction took 15798.32 ms. Allocated memory was 117.4 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 71.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 373.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:11,797 INFO L168 Benchmark]: Witness Printer took 245.29 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.6 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:11,799 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 96.5 MB. Free memory was 55.4 MB in the beginning and 55.4 MB in the end (delta: 42.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 366.44 ms. Allocated memory is still 96.5 MB. Free memory was 67.0 MB in the beginning and 68.9 MB in the end (delta: -1.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.30 ms. Allocated memory is still 96.5 MB. Free memory was 68.9 MB in the beginning and 66.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 76.18 ms. Allocated memory is still 96.5 MB. Free memory was 66.8 MB in the beginning and 64.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 865.62 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 64.7 MB in the beginning and 72.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15798.32 ms. Allocated memory was 117.4 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 71.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 373.5 MB. Max. memory is 16.1 GB. * Witness Printer took 245.29 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.6 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L396] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L475] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L484] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L493] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L502] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L507] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L512] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L517] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L129] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L174] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L219] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L540] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L567] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND TRUE (int )e_wl == 0 [L573] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L578] COND TRUE (int )e_wl == 1 [L579] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L595] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L596] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L604] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L605] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L613] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L614] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L622] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L627] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L632] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L637] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND TRUE (int )e_wl == 1 [L648] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L129] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L132] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L147] COND TRUE ! processed [L148] data += 1 [L149] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L150] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L151] COND TRUE (int )e_g == 1 [L152] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L159] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L174] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L177] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L192] COND TRUE ! processed [L193] data += 1 [L194] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L195] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L196] COND TRUE (int )e_g == 1 [L197] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L219] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L222] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L237] c_t = data [L238] c_req_up = 1 [L239] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L540] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L541] COND TRUE c != c_t [L542] c = c_t [L543] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L547] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] COND TRUE (int )e_c == 0 [L568] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L585] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L586] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L596] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L604] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L613] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L614] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L622] COND TRUE (int )e_c == 1 [L623] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L627] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L632] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L637] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND TRUE (int )e_c == 1 [L643] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L655] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L658] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L661] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L533] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L339] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L354] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND TRUE (int )r_st == 0 [L371] tmp___3 = __VERIFIER_nondet_int() [L373] COND TRUE \read(tmp___3) [L375] r_st = 1 [L251] d = c [L252] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L253] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L261] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L262] COND TRUE (int )e_e == 1 [L263] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L271] e_e = 2 [L272] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L3] __assert_fail("0", "toy2.cil.c", 3, "reach_error") VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.4s, OverallIterations: 32, TraceHistogramMax: 6, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6240 SDtfs, 7475 SDslu, 3708 SDs, 0 SdLazy, 663 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5234occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 4173 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2417 NumberOfCodeBlocks, 2417 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2202 ConstructedInterpolants, 0 QuantifiedInterpolants, 341936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 597/597 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...