./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy1.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_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/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 f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-29 20:09:21,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:09:21,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:09:21,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:09:21,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:09:21,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:09:21,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:09:21,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:09:21,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:09:21,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:09:21,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:09:21,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:09:21,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:09:21,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:09:21,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:09:21,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:09:21,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:09:21,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:09:21,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:09:21,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:09:21,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:09:21,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:09:21,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:09:21,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:09:21,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:09:21,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:09:21,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:09:21,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:09:21,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:09:21,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:09:21,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:09:21,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:09:21,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:09:21,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:09:21,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:09:21,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:09:21,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:09:21,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:09:21,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:09:21,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:09:21,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:09:21,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 20:09:21,232 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:09:21,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:09:21,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:09:21,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:09:21,241 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:09:21,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:09:21,242 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:09:21,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:09:21,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:09:21,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:09:21,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 20:09:21,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 20:09:21,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 20:09:21,245 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:09:21,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 20:09:21,245 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:09:21,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 20:09:21,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:09:21,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:09:21,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 20:09:21,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 20:09:21,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 20:09:21,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:09:21,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 20:09:21,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 20:09:21,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:09:21,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 20:09:21,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 20:09:21,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:09:21,250 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_506d6b53-7e43-49d5-ae19-5df1c84f930f/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_506d6b53-7e43-49d5-ae19-5df1c84f930f/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 -> f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 [2020-11-29 20:09:21,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:09:21,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:09:21,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:09:21,714 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:09:21,716 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:09:21,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/../../sv-benchmarks/c/systemc/toy1.cil.c [2020-11-29 20:09:21,818 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/data/335d221c2/673b52d3ebb34041bdcd0aafb51d6318/FLAG003e2bf4b [2020-11-29 20:09:22,467 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:09:22,467 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/sv-benchmarks/c/systemc/toy1.cil.c [2020-11-29 20:09:22,483 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/data/335d221c2/673b52d3ebb34041bdcd0aafb51d6318/FLAG003e2bf4b [2020-11-29 20:09:22,811 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/data/335d221c2/673b52d3ebb34041bdcd0aafb51d6318 [2020-11-29 20:09:22,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:09:22,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 20:09:22,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:09:22,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:09:22,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:09:22,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:09:22" (1/1) ... [2020-11-29 20:09:22,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ca1c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:22, skipping insertion in model container [2020-11-29 20:09:22,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:09:22" (1/1) ... [2020-11-29 20:09:22,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:09:22,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:09:23,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:09:23,198 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:09:23,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:09:23,284 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:09:23,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23 WrapperNode [2020-11-29 20:09:23,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:09:23,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 20:09:23,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 20:09:23,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 20:09:23,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (1/1) ... [2020-11-29 20:09:23,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (1/1) ... [2020-11-29 20:09:23,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 20:09:23,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:09:23,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:09:23,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:09:23,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (1/1) ... [2020-11-29 20:09:23,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (1/1) ... [2020-11-29 20:09:23,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (1/1) ... [2020-11-29 20:09:23,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (1/1) ... [2020-11-29 20:09:23,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (1/1) ... [2020-11-29 20:09:23,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (1/1) ... [2020-11-29 20:09:23,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (1/1) ... [2020-11-29 20:09:23,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:09:23,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:09:23,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:09:23,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:09:23,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/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-29 20:09:23,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:09:23,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:09:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:09:23,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:09:24,765 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:09:24,766 INFO L298 CfgBuilder]: Removed 32 assume(true) statements. [2020-11-29 20:09:24,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:09:24 BoogieIcfgContainer [2020-11-29 20:09:24,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:09:24,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 20:09:24,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 20:09:24,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 20:09:24,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:09:22" (1/3) ... [2020-11-29 20:09:24,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d35815d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:09:24, skipping insertion in model container [2020-11-29 20:09:24,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:09:23" (2/3) ... [2020-11-29 20:09:24,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d35815d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:09:24, skipping insertion in model container [2020-11-29 20:09:24,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:09:24" (3/3) ... [2020-11-29 20:09:24,784 INFO L111 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2020-11-29 20:09:24,804 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 20:09:24,811 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 20:09:24,826 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-29 20:09:24,881 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 20:09:24,881 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 20:09:24,881 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 20:09:24,881 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:09:24,882 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:09:24,882 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 20:09:24,882 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:09:24,882 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 20:09:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2020-11-29 20:09:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:24,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:24,963 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, 1] [2020-11-29 20:09:24,964 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:24,970 INFO L82 PathProgramCache]: Analyzing trace with hash -895778102, now seen corresponding path program 1 times [2020-11-29 20:09:24,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:24,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239586427] [2020-11-29 20:09:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:25,221 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-29 20:09:25,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239586427] [2020-11-29 20:09:25,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:25,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:25,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623216190] [2020-11-29 20:09:25,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:25,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:25,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:25,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:25,253 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2020-11-29 20:09:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:25,318 INFO L93 Difference]: Finished difference Result 252 states and 463 transitions. [2020-11-29 20:09:25,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:25,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-29 20:09:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:25,352 INFO L225 Difference]: With dead ends: 252 [2020-11-29 20:09:25,352 INFO L226 Difference]: Without dead ends: 125 [2020-11-29 20:09:25,356 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-29 20:09:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-29 20:09:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-11-29 20:09:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-29 20:09:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2020-11-29 20:09:25,425 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 218 transitions. Word has length 36 [2020-11-29 20:09:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:25,425 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 218 transitions. [2020-11-29 20:09:25,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:25,426 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 218 transitions. [2020-11-29 20:09:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:25,428 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:25,428 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, 1] [2020-11-29 20:09:25,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 20:09:25,429 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1597377976, now seen corresponding path program 1 times [2020-11-29 20:09:25,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:25,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595297910] [2020-11-29 20:09:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:25,526 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-29 20:09:25,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595297910] [2020-11-29 20:09:25,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:25,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:25,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495684941] [2020-11-29 20:09:25,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:25,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:25,531 INFO L87 Difference]: Start difference. First operand 125 states and 218 transitions. Second operand 4 states. [2020-11-29 20:09:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:25,668 INFO L93 Difference]: Finished difference Result 337 states and 586 transitions. [2020-11-29 20:09:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:09:25,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-29 20:09:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:25,674 INFO L225 Difference]: With dead ends: 337 [2020-11-29 20:09:25,680 INFO L226 Difference]: Without dead ends: 215 [2020-11-29 20:09:25,682 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-29 20:09:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-11-29 20:09:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2020-11-29 20:09:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-29 20:09:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 366 transitions. [2020-11-29 20:09:25,737 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 366 transitions. Word has length 36 [2020-11-29 20:09:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:25,737 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 366 transitions. [2020-11-29 20:09:25,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 366 transitions. [2020-11-29 20:09:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:25,739 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:25,740 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, 1] [2020-11-29 20:09:25,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 20:09:25,740 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:25,742 INFO L82 PathProgramCache]: Analyzing trace with hash -211174582, now seen corresponding path program 1 times [2020-11-29 20:09:25,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:25,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965528516] [2020-11-29 20:09:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:25,884 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-29 20:09:25,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965528516] [2020-11-29 20:09:25,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:25,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:25,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471006990] [2020-11-29 20:09:25,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:25,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:25,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:25,887 INFO L87 Difference]: Start difference. First operand 210 states and 366 transitions. Second operand 3 states. [2020-11-29 20:09:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:26,029 INFO L93 Difference]: Finished difference Result 411 states and 719 transitions. [2020-11-29 20:09:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:26,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-29 20:09:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:26,033 INFO L225 Difference]: With dead ends: 411 [2020-11-29 20:09:26,033 INFO L226 Difference]: Without dead ends: 210 [2020-11-29 20:09:26,036 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-29 20:09:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-11-29 20:09:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2020-11-29 20:09:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-29 20:09:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 354 transitions. [2020-11-29 20:09:26,063 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 354 transitions. Word has length 36 [2020-11-29 20:09:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:26,063 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 354 transitions. [2020-11-29 20:09:26,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 354 transitions. [2020-11-29 20:09:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:26,066 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:26,066 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, 1] [2020-11-29 20:09:26,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 20:09:26,067 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:26,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1741716026, now seen corresponding path program 1 times [2020-11-29 20:09:26,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:26,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137156168] [2020-11-29 20:09:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:26,132 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-29 20:09:26,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137156168] [2020-11-29 20:09:26,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:26,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:26,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157538539] [2020-11-29 20:09:26,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:26,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:26,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:26,136 INFO L87 Difference]: Start difference. First operand 210 states and 354 transitions. Second operand 4 states. [2020-11-29 20:09:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:26,364 INFO L93 Difference]: Finished difference Result 571 states and 965 transitions. [2020-11-29 20:09:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:09:26,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-29 20:09:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:26,370 INFO L225 Difference]: With dead ends: 571 [2020-11-29 20:09:26,370 INFO L226 Difference]: Without dead ends: 371 [2020-11-29 20:09:26,373 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-29 20:09:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-11-29 20:09:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 210. [2020-11-29 20:09:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-29 20:09:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2020-11-29 20:09:26,430 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 36 [2020-11-29 20:09:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:26,430 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2020-11-29 20:09:26,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2020-11-29 20:09:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:26,436 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:26,437 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, 1] [2020-11-29 20:09:26,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 20:09:26,438 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:26,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash 181512008, now seen corresponding path program 1 times [2020-11-29 20:09:26,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:26,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917284081] [2020-11-29 20:09:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:26,555 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-29 20:09:26,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917284081] [2020-11-29 20:09:26,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:26,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:26,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251118378] [2020-11-29 20:09:26,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:26,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:26,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:26,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:26,558 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 4 states. [2020-11-29 20:09:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:26,715 INFO L93 Difference]: Finished difference Result 574 states and 961 transitions. [2020-11-29 20:09:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:09:26,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-29 20:09:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:26,719 INFO L225 Difference]: With dead ends: 574 [2020-11-29 20:09:26,719 INFO L226 Difference]: Without dead ends: 375 [2020-11-29 20:09:26,720 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-29 20:09:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-11-29 20:09:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 210. [2020-11-29 20:09:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-29 20:09:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2020-11-29 20:09:26,754 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 36 [2020-11-29 20:09:26,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:26,755 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2020-11-29 20:09:26,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2020-11-29 20:09:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:26,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:26,763 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, 1] [2020-11-29 20:09:26,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 20:09:26,764 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:26,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash 243551622, now seen corresponding path program 1 times [2020-11-29 20:09:26,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:26,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570569503] [2020-11-29 20:09:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:26,849 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-29 20:09:26,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570569503] [2020-11-29 20:09:26,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:26,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:26,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493283475] [2020-11-29 20:09:26,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:26,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:26,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:26,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:26,858 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 4 states. [2020-11-29 20:09:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:27,001 INFO L93 Difference]: Finished difference Result 586 states and 972 transitions. [2020-11-29 20:09:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:09:27,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-29 20:09:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:27,006 INFO L225 Difference]: With dead ends: 586 [2020-11-29 20:09:27,007 INFO L226 Difference]: Without dead ends: 388 [2020-11-29 20:09:27,008 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-29 20:09:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-11-29 20:09:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 216. [2020-11-29 20:09:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-11-29 20:09:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 352 transitions. [2020-11-29 20:09:27,034 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 352 transitions. Word has length 36 [2020-11-29 20:09:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:27,040 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 352 transitions. [2020-11-29 20:09:27,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 352 transitions. [2020-11-29 20:09:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:27,042 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:27,042 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, 1] [2020-11-29 20:09:27,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 20:09:27,042 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:27,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash 384100232, now seen corresponding path program 1 times [2020-11-29 20:09:27,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:27,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107607554] [2020-11-29 20:09:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:27,123 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-29 20:09:27,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107607554] [2020-11-29 20:09:27,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:27,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:27,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320088090] [2020-11-29 20:09:27,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:27,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:27,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:27,127 INFO L87 Difference]: Start difference. First operand 216 states and 352 transitions. Second operand 4 states. [2020-11-29 20:09:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:27,312 INFO L93 Difference]: Finished difference Result 737 states and 1201 transitions. [2020-11-29 20:09:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:09:27,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-29 20:09:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:27,319 INFO L225 Difference]: With dead ends: 737 [2020-11-29 20:09:27,319 INFO L226 Difference]: Without dead ends: 534 [2020-11-29 20:09:27,322 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-29 20:09:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-11-29 20:09:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 351. [2020-11-29 20:09:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-11-29 20:09:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 571 transitions. [2020-11-29 20:09:27,358 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 571 transitions. Word has length 36 [2020-11-29 20:09:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:27,360 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 571 transitions. [2020-11-29 20:09:27,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 571 transitions. [2020-11-29 20:09:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:27,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:27,364 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, 1] [2020-11-29 20:09:27,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 20:09:27,365 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:27,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:27,366 INFO L82 PathProgramCache]: Analyzing trace with hash 250086726, now seen corresponding path program 1 times [2020-11-29 20:09:27,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:27,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751967845] [2020-11-29 20:09:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:27,467 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-29 20:09:27,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751967845] [2020-11-29 20:09:27,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:27,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:27,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045850535] [2020-11-29 20:09:27,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:27,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:27,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:27,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:27,472 INFO L87 Difference]: Start difference. First operand 351 states and 571 transitions. Second operand 3 states. [2020-11-29 20:09:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:27,550 INFO L93 Difference]: Finished difference Result 838 states and 1368 transitions. [2020-11-29 20:09:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:27,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-29 20:09:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:27,558 INFO L225 Difference]: With dead ends: 838 [2020-11-29 20:09:27,558 INFO L226 Difference]: Without dead ends: 511 [2020-11-29 20:09:27,560 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-29 20:09:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-11-29 20:09:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2020-11-29 20:09:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-11-29 20:09:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 825 transitions. [2020-11-29 20:09:27,605 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 825 transitions. Word has length 36 [2020-11-29 20:09:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:27,608 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 825 transitions. [2020-11-29 20:09:27,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 825 transitions. [2020-11-29 20:09:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:27,611 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:27,611 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, 1] [2020-11-29 20:09:27,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 20:09:27,612 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1539792066, now seen corresponding path program 1 times [2020-11-29 20:09:27,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:27,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154562042] [2020-11-29 20:09:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:27,692 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-29 20:09:27,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154562042] [2020-11-29 20:09:27,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:27,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:27,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691807863] [2020-11-29 20:09:27,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:27,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:27,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:27,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:27,697 INFO L87 Difference]: Start difference. First operand 507 states and 825 transitions. Second operand 4 states. [2020-11-29 20:09:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:27,867 INFO L93 Difference]: Finished difference Result 1293 states and 2104 transitions. [2020-11-29 20:09:27,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:09:27,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-29 20:09:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:27,875 INFO L225 Difference]: With dead ends: 1293 [2020-11-29 20:09:27,875 INFO L226 Difference]: Without dead ends: 803 [2020-11-29 20:09:27,877 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-29 20:09:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2020-11-29 20:09:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 507. [2020-11-29 20:09:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-11-29 20:09:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 817 transitions. [2020-11-29 20:09:27,924 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 817 transitions. Word has length 36 [2020-11-29 20:09:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:27,925 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 817 transitions. [2020-11-29 20:09:27,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 817 transitions. [2020-11-29 20:09:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:27,926 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:27,926 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, 1] [2020-11-29 20:09:27,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 20:09:27,927 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:27,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash -48555836, now seen corresponding path program 1 times [2020-11-29 20:09:27,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:27,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737034299] [2020-11-29 20:09:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:28,012 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-29 20:09:28,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737034299] [2020-11-29 20:09:28,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:28,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:28,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344907497] [2020-11-29 20:09:28,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:28,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:28,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:28,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:28,015 INFO L87 Difference]: Start difference. First operand 507 states and 817 transitions. Second operand 4 states. [2020-11-29 20:09:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:28,200 INFO L93 Difference]: Finished difference Result 1289 states and 2077 transitions. [2020-11-29 20:09:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:09:28,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-29 20:09:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:28,216 INFO L225 Difference]: With dead ends: 1289 [2020-11-29 20:09:28,216 INFO L226 Difference]: Without dead ends: 805 [2020-11-29 20:09:28,218 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-29 20:09:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-11-29 20:09:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 507. [2020-11-29 20:09:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-11-29 20:09:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 809 transitions. [2020-11-29 20:09:28,268 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 809 transitions. Word has length 36 [2020-11-29 20:09:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:28,270 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 809 transitions. [2020-11-29 20:09:28,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 809 transitions. [2020-11-29 20:09:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:28,271 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:28,272 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, 1] [2020-11-29 20:09:28,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 20:09:28,274 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:28,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1328419514, now seen corresponding path program 1 times [2020-11-29 20:09:28,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:28,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491127242] [2020-11-29 20:09:28,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:28,356 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-29 20:09:28,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491127242] [2020-11-29 20:09:28,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:28,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:28,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46463945] [2020-11-29 20:09:28,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:28,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:28,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:28,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:28,359 INFO L87 Difference]: Start difference. First operand 507 states and 809 transitions. Second operand 4 states. [2020-11-29 20:09:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:28,516 INFO L93 Difference]: Finished difference Result 1226 states and 1951 transitions. [2020-11-29 20:09:28,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:09:28,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-11-29 20:09:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:28,524 INFO L225 Difference]: With dead ends: 1226 [2020-11-29 20:09:28,524 INFO L226 Difference]: Without dead ends: 736 [2020-11-29 20:09:28,528 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-29 20:09:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2020-11-29 20:09:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 555. [2020-11-29 20:09:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-11-29 20:09:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 866 transitions. [2020-11-29 20:09:28,588 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 866 transitions. Word has length 36 [2020-11-29 20:09:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:28,589 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 866 transitions. [2020-11-29 20:09:28,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 866 transitions. [2020-11-29 20:09:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:09:28,590 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:28,590 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, 1] [2020-11-29 20:09:28,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 20:09:28,591 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:28,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1915225528, now seen corresponding path program 1 times [2020-11-29 20:09:28,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:28,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741932529] [2020-11-29 20:09:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:28,647 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-29 20:09:28,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741932529] [2020-11-29 20:09:28,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:28,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:28,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901718474] [2020-11-29 20:09:28,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:28,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:28,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:28,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:28,650 INFO L87 Difference]: Start difference. First operand 555 states and 866 transitions. Second operand 3 states. [2020-11-29 20:09:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:28,780 INFO L93 Difference]: Finished difference Result 1316 states and 2058 transitions. [2020-11-29 20:09:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:28,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-29 20:09:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:28,788 INFO L225 Difference]: With dead ends: 1316 [2020-11-29 20:09:28,788 INFO L226 Difference]: Without dead ends: 775 [2020-11-29 20:09:28,790 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-29 20:09:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-11-29 20:09:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 772. [2020-11-29 20:09:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-11-29 20:09:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1190 transitions. [2020-11-29 20:09:28,856 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1190 transitions. Word has length 36 [2020-11-29 20:09:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:28,856 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1190 transitions. [2020-11-29 20:09:28,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1190 transitions. [2020-11-29 20:09:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-29 20:09:28,857 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:28,858 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-29 20:09:28,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 20:09:28,858 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:28,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:28,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1824541764, now seen corresponding path program 1 times [2020-11-29 20:09:28,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:28,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592007126] [2020-11-29 20:09:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:28,902 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-29 20:09:28,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592007126] [2020-11-29 20:09:28,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:28,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:28,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932557340] [2020-11-29 20:09:28,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:28,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:28,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:28,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:28,905 INFO L87 Difference]: Start difference. First operand 772 states and 1190 transitions. Second operand 3 states. [2020-11-29 20:09:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:29,029 INFO L93 Difference]: Finished difference Result 1906 states and 2978 transitions. [2020-11-29 20:09:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:29,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-11-29 20:09:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:29,040 INFO L225 Difference]: With dead ends: 1906 [2020-11-29 20:09:29,040 INFO L226 Difference]: Without dead ends: 1161 [2020-11-29 20:09:29,042 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-29 20:09:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-11-29 20:09:29,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1157. [2020-11-29 20:09:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2020-11-29 20:09:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1801 transitions. [2020-11-29 20:09:29,145 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1801 transitions. Word has length 46 [2020-11-29 20:09:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:29,146 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1801 transitions. [2020-11-29 20:09:29,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1801 transitions. [2020-11-29 20:09:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-29 20:09:29,150 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:29,150 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-29 20:09:29,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 20:09:29,150 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1576395270, now seen corresponding path program 1 times [2020-11-29 20:09:29,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:29,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434576142] [2020-11-29 20:09:29,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:29,199 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-29 20:09:29,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434576142] [2020-11-29 20:09:29,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:29,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:29,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465719839] [2020-11-29 20:09:29,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:29,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:29,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:29,201 INFO L87 Difference]: Start difference. First operand 1157 states and 1801 transitions. Second operand 3 states. [2020-11-29 20:09:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:29,328 INFO L93 Difference]: Finished difference Result 2265 states and 3543 transitions. [2020-11-29 20:09:29,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:29,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-11-29 20:09:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:29,338 INFO L225 Difference]: With dead ends: 2265 [2020-11-29 20:09:29,339 INFO L226 Difference]: Without dead ends: 1135 [2020-11-29 20:09:29,344 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-29 20:09:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2020-11-29 20:09:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2020-11-29 20:09:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2020-11-29 20:09:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1774 transitions. [2020-11-29 20:09:29,439 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1774 transitions. Word has length 46 [2020-11-29 20:09:29,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:29,439 INFO L481 AbstractCegarLoop]: Abstraction has 1135 states and 1774 transitions. [2020-11-29 20:09:29,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1774 transitions. [2020-11-29 20:09:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-29 20:09:29,441 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:29,441 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-29 20:09:29,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 20:09:29,442 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:29,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:29,443 INFO L82 PathProgramCache]: Analyzing trace with hash 121182915, now seen corresponding path program 1 times [2020-11-29 20:09:29,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:29,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421546143] [2020-11-29 20:09:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:29,500 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-29 20:09:29,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421546143] [2020-11-29 20:09:29,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:29,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:29,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587644363] [2020-11-29 20:09:29,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:29,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:29,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:29,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:29,503 INFO L87 Difference]: Start difference. First operand 1135 states and 1774 transitions. Second operand 3 states. [2020-11-29 20:09:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:29,683 INFO L93 Difference]: Finished difference Result 2891 states and 4579 transitions. [2020-11-29 20:09:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:29,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-11-29 20:09:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:29,699 INFO L225 Difference]: With dead ends: 2891 [2020-11-29 20:09:29,699 INFO L226 Difference]: Without dead ends: 1783 [2020-11-29 20:09:29,704 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-29 20:09:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2020-11-29 20:09:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1779. [2020-11-29 20:09:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2020-11-29 20:09:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2808 transitions. [2020-11-29 20:09:29,860 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2808 transitions. Word has length 47 [2020-11-29 20:09:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:29,862 INFO L481 AbstractCegarLoop]: Abstraction has 1779 states and 2808 transitions. [2020-11-29 20:09:29,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2808 transitions. [2020-11-29 20:09:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-29 20:09:29,864 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:29,864 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-29 20:09:29,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 20:09:29,865 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash 241239015, now seen corresponding path program 1 times [2020-11-29 20:09:29,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:29,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705590969] [2020-11-29 20:09:29,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:29,968 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-29 20:09:29,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705590969] [2020-11-29 20:09:29,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:29,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:29,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291016139] [2020-11-29 20:09:29,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:29,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:29,971 INFO L87 Difference]: Start difference. First operand 1779 states and 2808 transitions. Second operand 3 states. [2020-11-29 20:09:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:30,262 INFO L93 Difference]: Finished difference Result 4794 states and 7664 transitions. [2020-11-29 20:09:30,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:30,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-11-29 20:09:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:30,287 INFO L225 Difference]: With dead ends: 4794 [2020-11-29 20:09:30,287 INFO L226 Difference]: Without dead ends: 3044 [2020-11-29 20:09:30,291 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-29 20:09:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2020-11-29 20:09:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3040. [2020-11-29 20:09:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3040 states. [2020-11-29 20:09:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 4843 transitions. [2020-11-29 20:09:30,602 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 4843 transitions. Word has length 48 [2020-11-29 20:09:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:30,603 INFO L481 AbstractCegarLoop]: Abstraction has 3040 states and 4843 transitions. [2020-11-29 20:09:30,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 4843 transitions. [2020-11-29 20:09:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-29 20:09:30,605 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:30,606 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-29 20:09:30,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 20:09:30,606 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:30,607 INFO L82 PathProgramCache]: Analyzing trace with hash 489385509, now seen corresponding path program 1 times [2020-11-29 20:09:30,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:30,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351557180] [2020-11-29 20:09:30,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:30,649 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-29 20:09:30,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351557180] [2020-11-29 20:09:30,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:30,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:30,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296575457] [2020-11-29 20:09:30,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:30,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:30,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:30,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:30,654 INFO L87 Difference]: Start difference. First operand 3040 states and 4843 transitions. Second operand 3 states. [2020-11-29 20:09:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:30,954 INFO L93 Difference]: Finished difference Result 6029 states and 9627 transitions. [2020-11-29 20:09:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:30,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-11-29 20:09:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:31,015 INFO L225 Difference]: With dead ends: 6029 [2020-11-29 20:09:31,016 INFO L226 Difference]: Without dead ends: 3018 [2020-11-29 20:09:31,021 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-29 20:09:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-11-29 20:09:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2020-11-29 20:09:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-11-29 20:09:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4817 transitions. [2020-11-29 20:09:31,300 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4817 transitions. Word has length 48 [2020-11-29 20:09:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:31,300 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4817 transitions. [2020-11-29 20:09:31,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4817 transitions. [2020-11-29 20:09:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 20:09:31,303 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:31,303 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] [2020-11-29 20:09:31,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 20:09:31,303 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash 497105560, now seen corresponding path program 1 times [2020-11-29 20:09:31,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:31,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986911040] [2020-11-29 20:09:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:31,353 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-29 20:09:31,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986911040] [2020-11-29 20:09:31,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:31,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:31,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849959080] [2020-11-29 20:09:31,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:31,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:31,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:31,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:31,365 INFO L87 Difference]: Start difference. First operand 3018 states and 4817 transitions. Second operand 4 states. [2020-11-29 20:09:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:31,898 INFO L93 Difference]: Finished difference Result 7617 states and 12199 transitions. [2020-11-29 20:09:31,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:09:31,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-11-29 20:09:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:31,932 INFO L225 Difference]: With dead ends: 7617 [2020-11-29 20:09:31,933 INFO L226 Difference]: Without dead ends: 3895 [2020-11-29 20:09:31,939 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-29 20:09:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2020-11-29 20:09:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3895. [2020-11-29 20:09:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3895 states. [2020-11-29 20:09:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 6183 transitions. [2020-11-29 20:09:32,389 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 6183 transitions. Word has length 49 [2020-11-29 20:09:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:32,390 INFO L481 AbstractCegarLoop]: Abstraction has 3895 states and 6183 transitions. [2020-11-29 20:09:32,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 6183 transitions. [2020-11-29 20:09:32,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-29 20:09:32,394 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:32,394 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, 1] [2020-11-29 20:09:32,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 20:09:32,395 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:32,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1266326705, now seen corresponding path program 1 times [2020-11-29 20:09:32,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:32,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225508470] [2020-11-29 20:09:32,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:32,490 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-29 20:09:32,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225508470] [2020-11-29 20:09:32,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:32,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:09:32,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806946582] [2020-11-29 20:09:32,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:09:32,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:32,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:09:32,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:09:32,495 INFO L87 Difference]: Start difference. First operand 3895 states and 6183 transitions. Second operand 5 states. [2020-11-29 20:09:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:33,241 INFO L93 Difference]: Finished difference Result 9940 states and 15662 transitions. [2020-11-29 20:09:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 20:09:33,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-11-29 20:09:33,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:33,305 INFO L225 Difference]: With dead ends: 9940 [2020-11-29 20:09:33,310 INFO L226 Difference]: Without dead ends: 6068 [2020-11-29 20:09:33,318 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-29 20:09:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-11-29 20:09:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 4554. [2020-11-29 20:09:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4554 states. [2020-11-29 20:09:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 7072 transitions. [2020-11-29 20:09:33,833 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 7072 transitions. Word has length 54 [2020-11-29 20:09:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:33,833 INFO L481 AbstractCegarLoop]: Abstraction has 4554 states and 7072 transitions. [2020-11-29 20:09:33,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:09:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 7072 transitions. [2020-11-29 20:09:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-29 20:09:33,843 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:33,843 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-29 20:09:33,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 20:09:33,844 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1019387986, now seen corresponding path program 1 times [2020-11-29 20:09:33,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:33,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685790617] [2020-11-29 20:09:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:33,909 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-29 20:09:33,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685790617] [2020-11-29 20:09:33,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:33,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:33,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154657574] [2020-11-29 20:09:33,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:33,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:33,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:33,912 INFO L87 Difference]: Start difference. First operand 4554 states and 7072 transitions. Second operand 3 states. [2020-11-29 20:09:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:34,393 INFO L93 Difference]: Finished difference Result 9431 states and 14610 transitions. [2020-11-29 20:09:34,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:34,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-11-29 20:09:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:34,409 INFO L225 Difference]: With dead ends: 9431 [2020-11-29 20:09:34,410 INFO L226 Difference]: Without dead ends: 4906 [2020-11-29 20:09:34,418 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-29 20:09:34,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2020-11-29 20:09:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4874. [2020-11-29 20:09:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4874 states. [2020-11-29 20:09:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 7321 transitions. [2020-11-29 20:09:35,038 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 7321 transitions. Word has length 86 [2020-11-29 20:09:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:35,039 INFO L481 AbstractCegarLoop]: Abstraction has 4874 states and 7321 transitions. [2020-11-29 20:09:35,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7321 transitions. [2020-11-29 20:09:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-29 20:09:35,046 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:35,046 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-29 20:09:35,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 20:09:35,046 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:35,047 INFO L82 PathProgramCache]: Analyzing trace with hash 359155335, now seen corresponding path program 1 times [2020-11-29 20:09:35,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:35,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524917170] [2020-11-29 20:09:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:35,112 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-29 20:09:35,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524917170] [2020-11-29 20:09:35,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:35,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:35,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621512788] [2020-11-29 20:09:35,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:35,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:35,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:35,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:35,115 INFO L87 Difference]: Start difference. First operand 4874 states and 7321 transitions. Second operand 3 states. [2020-11-29 20:09:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:35,738 INFO L93 Difference]: Finished difference Result 10229 states and 15320 transitions. [2020-11-29 20:09:35,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:35,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-11-29 20:09:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:35,753 INFO L225 Difference]: With dead ends: 10229 [2020-11-29 20:09:35,753 INFO L226 Difference]: Without dead ends: 5396 [2020-11-29 20:09:35,761 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-29 20:09:35,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2020-11-29 20:09:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5348. [2020-11-29 20:09:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5348 states. [2020-11-29 20:09:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7764 transitions. [2020-11-29 20:09:36,215 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7764 transitions. Word has length 87 [2020-11-29 20:09:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:36,215 INFO L481 AbstractCegarLoop]: Abstraction has 5348 states and 7764 transitions. [2020-11-29 20:09:36,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7764 transitions. [2020-11-29 20:09:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 20:09:36,222 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:36,222 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-29 20:09:36,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 20:09:36,223 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash -503038292, now seen corresponding path program 1 times [2020-11-29 20:09:36,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:36,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286570770] [2020-11-29 20:09:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:36,273 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-29 20:09:36,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286570770] [2020-11-29 20:09:36,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:36,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:36,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473736554] [2020-11-29 20:09:36,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:36,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:36,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:36,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:36,275 INFO L87 Difference]: Start difference. First operand 5348 states and 7764 transitions. Second operand 3 states. [2020-11-29 20:09:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:36,782 INFO L93 Difference]: Finished difference Result 11003 states and 15979 transitions. [2020-11-29 20:09:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:36,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-11-29 20:09:36,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:36,798 INFO L225 Difference]: With dead ends: 11003 [2020-11-29 20:09:36,798 INFO L226 Difference]: Without dead ends: 5716 [2020-11-29 20:09:36,807 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-29 20:09:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2020-11-29 20:09:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5130. [2020-11-29 20:09:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5130 states. [2020-11-29 20:09:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5130 states to 5130 states and 7126 transitions. [2020-11-29 20:09:37,268 INFO L78 Accepts]: Start accepts. Automaton has 5130 states and 7126 transitions. Word has length 88 [2020-11-29 20:09:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:37,268 INFO L481 AbstractCegarLoop]: Abstraction has 5130 states and 7126 transitions. [2020-11-29 20:09:37,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5130 states and 7126 transitions. [2020-11-29 20:09:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-29 20:09:37,275 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:37,276 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, 1] [2020-11-29 20:09:37,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 20:09:37,276 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:37,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:37,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2120110985, now seen corresponding path program 1 times [2020-11-29 20:09:37,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:37,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990631032] [2020-11-29 20:09:37,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:37,358 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-29 20:09:37,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990631032] [2020-11-29 20:09:37,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:37,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:37,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760328182] [2020-11-29 20:09:37,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:37,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:37,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:37,364 INFO L87 Difference]: Start difference. First operand 5130 states and 7126 transitions. Second operand 4 states. [2020-11-29 20:09:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:38,112 INFO L93 Difference]: Finished difference Result 9554 states and 13184 transitions. [2020-11-29 20:09:38,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:09:38,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-11-29 20:09:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:38,124 INFO L225 Difference]: With dead ends: 9554 [2020-11-29 20:09:38,124 INFO L226 Difference]: Without dead ends: 4875 [2020-11-29 20:09:38,131 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-29 20:09:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2020-11-29 20:09:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4759. [2020-11-29 20:09:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4759 states. [2020-11-29 20:09:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6364 transitions. [2020-11-29 20:09:38,538 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6364 transitions. Word has length 89 [2020-11-29 20:09:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:38,538 INFO L481 AbstractCegarLoop]: Abstraction has 4759 states and 6364 transitions. [2020-11-29 20:09:38,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6364 transitions. [2020-11-29 20:09:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-29 20:09:38,553 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:38,553 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, 1] [2020-11-29 20:09:38,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 20:09:38,554 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:38,554 INFO L82 PathProgramCache]: Analyzing trace with hash 520985863, now seen corresponding path program 1 times [2020-11-29 20:09:38,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:38,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067721241] [2020-11-29 20:09:38,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:38,621 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-29 20:09:38,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067721241] [2020-11-29 20:09:38,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:38,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:38,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439912097] [2020-11-29 20:09:38,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:38,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:38,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:38,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:38,624 INFO L87 Difference]: Start difference. First operand 4759 states and 6364 transitions. Second operand 3 states. [2020-11-29 20:09:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:39,221 INFO L93 Difference]: Finished difference Result 9073 states and 12125 transitions. [2020-11-29 20:09:39,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:39,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-11-29 20:09:39,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:39,232 INFO L225 Difference]: With dead ends: 9073 [2020-11-29 20:09:39,233 INFO L226 Difference]: Without dead ends: 4705 [2020-11-29 20:09:39,238 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-29 20:09:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2020-11-29 20:09:39,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 4705. [2020-11-29 20:09:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4705 states. [2020-11-29 20:09:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 6258 transitions. [2020-11-29 20:09:39,812 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 6258 transitions. Word has length 116 [2020-11-29 20:09:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:39,812 INFO L481 AbstractCegarLoop]: Abstraction has 4705 states and 6258 transitions. [2020-11-29 20:09:39,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 6258 transitions. [2020-11-29 20:09:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-11-29 20:09:39,826 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:39,826 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] [2020-11-29 20:09:39,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 20:09:39,827 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:39,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash -778538235, now seen corresponding path program 1 times [2020-11-29 20:09:39,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:39,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422096974] [2020-11-29 20:09:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:39,929 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-29 20:09:39,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422096974] [2020-11-29 20:09:39,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:39,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:39,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899497530] [2020-11-29 20:09:39,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:39,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:39,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:39,931 INFO L87 Difference]: Start difference. First operand 4705 states and 6258 transitions. Second operand 4 states. [2020-11-29 20:09:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:40,383 INFO L93 Difference]: Finished difference Result 8363 states and 11148 transitions. [2020-11-29 20:09:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:09:40,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2020-11-29 20:09:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:40,396 INFO L225 Difference]: With dead ends: 8363 [2020-11-29 20:09:40,397 INFO L226 Difference]: Without dead ends: 4627 [2020-11-29 20:09:40,402 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-29 20:09:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2020-11-29 20:09:40,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4623. [2020-11-29 20:09:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4623 states. [2020-11-29 20:09:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6037 transitions. [2020-11-29 20:09:40,811 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6037 transitions. Word has length 128 [2020-11-29 20:09:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:40,812 INFO L481 AbstractCegarLoop]: Abstraction has 4623 states and 6037 transitions. [2020-11-29 20:09:40,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6037 transitions. [2020-11-29 20:09:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-29 20:09:40,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:40,825 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, 1] [2020-11-29 20:09:40,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 20:09:40,825 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:40,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:40,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1096157553, now seen corresponding path program 1 times [2020-11-29 20:09:40,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:40,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590770021] [2020-11-29 20:09:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:40,881 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-29 20:09:40,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590770021] [2020-11-29 20:09:40,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:40,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:40,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803419901] [2020-11-29 20:09:40,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:40,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:40,884 INFO L87 Difference]: Start difference. First operand 4623 states and 6037 transitions. Second operand 3 states. [2020-11-29 20:09:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:41,485 INFO L93 Difference]: Finished difference Result 8859 states and 11562 transitions. [2020-11-29 20:09:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:41,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-11-29 20:09:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:41,498 INFO L225 Difference]: With dead ends: 8859 [2020-11-29 20:09:41,499 INFO L226 Difference]: Without dead ends: 4622 [2020-11-29 20:09:41,505 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-29 20:09:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2020-11-29 20:09:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 4582. [2020-11-29 20:09:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4582 states. [2020-11-29 20:09:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 5954 transitions. [2020-11-29 20:09:41,954 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 5954 transitions. Word has length 134 [2020-11-29 20:09:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:41,954 INFO L481 AbstractCegarLoop]: Abstraction has 4582 states and 5954 transitions. [2020-11-29 20:09:41,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 5954 transitions. [2020-11-29 20:09:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-29 20:09:41,964 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:41,965 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, 1] [2020-11-29 20:09:41,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-29 20:09:41,965 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:41,966 INFO L82 PathProgramCache]: Analyzing trace with hash 966130961, now seen corresponding path program 1 times [2020-11-29 20:09:41,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:41,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761223567] [2020-11-29 20:09:41,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:42,032 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-29 20:09:42,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761223567] [2020-11-29 20:09:42,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:42,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:42,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50017390] [2020-11-29 20:09:42,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:42,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:42,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:42,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:42,034 INFO L87 Difference]: Start difference. First operand 4582 states and 5954 transitions. Second operand 3 states. [2020-11-29 20:09:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:42,433 INFO L93 Difference]: Finished difference Result 8798 states and 11423 transitions. [2020-11-29 20:09:42,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:42,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-11-29 20:09:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:42,443 INFO L225 Difference]: With dead ends: 8798 [2020-11-29 20:09:42,444 INFO L226 Difference]: Without dead ends: 4592 [2020-11-29 20:09:42,450 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-29 20:09:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2020-11-29 20:09:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 4552. [2020-11-29 20:09:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2020-11-29 20:09:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 5883 transitions. [2020-11-29 20:09:42,895 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 5883 transitions. Word has length 134 [2020-11-29 20:09:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:42,896 INFO L481 AbstractCegarLoop]: Abstraction has 4552 states and 5883 transitions. [2020-11-29 20:09:42,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 5883 transitions. [2020-11-29 20:09:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-29 20:09:42,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:42,905 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, 1] [2020-11-29 20:09:42,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-29 20:09:42,906 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash -710463440, now seen corresponding path program 1 times [2020-11-29 20:09:42,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:42,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069208402] [2020-11-29 20:09:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:42,984 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-29 20:09:42,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069208402] [2020-11-29 20:09:42,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:42,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:42,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960522740] [2020-11-29 20:09:42,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:42,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:42,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:42,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:42,986 INFO L87 Difference]: Start difference. First operand 4552 states and 5883 transitions. Second operand 4 states. [2020-11-29 20:09:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:43,339 INFO L93 Difference]: Finished difference Result 7425 states and 9645 transitions. [2020-11-29 20:09:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:09:43,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-11-29 20:09:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:43,345 INFO L225 Difference]: With dead ends: 7425 [2020-11-29 20:09:43,345 INFO L226 Difference]: Without dead ends: 3245 [2020-11-29 20:09:43,350 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-29 20:09:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2020-11-29 20:09:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 3241. [2020-11-29 20:09:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2020-11-29 20:09:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4085 transitions. [2020-11-29 20:09:43,739 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4085 transitions. Word has length 137 [2020-11-29 20:09:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:43,740 INFO L481 AbstractCegarLoop]: Abstraction has 3241 states and 4085 transitions. [2020-11-29 20:09:43,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4085 transitions. [2020-11-29 20:09:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-29 20:09:43,746 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:43,746 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, 1] [2020-11-29 20:09:43,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-29 20:09:43,747 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:43,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash -691507333, now seen corresponding path program 1 times [2020-11-29 20:09:43,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:43,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053079993] [2020-11-29 20:09:43,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:43,809 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-29 20:09:43,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053079993] [2020-11-29 20:09:43,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:43,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:09:43,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064525879] [2020-11-29 20:09:43,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:09:43,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:43,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:09:43,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:09:43,812 INFO L87 Difference]: Start difference. First operand 3241 states and 4085 transitions. Second operand 4 states. [2020-11-29 20:09:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:44,051 INFO L93 Difference]: Finished difference Result 5244 states and 6615 transitions. [2020-11-29 20:09:44,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:09:44,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-11-29 20:09:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:44,054 INFO L225 Difference]: With dead ends: 5244 [2020-11-29 20:09:44,054 INFO L226 Difference]: Without dead ends: 2075 [2020-11-29 20:09:44,057 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-29 20:09:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2020-11-29 20:09:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2071. [2020-11-29 20:09:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-11-29 20:09:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2543 transitions. [2020-11-29 20:09:44,182 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2543 transitions. Word has length 137 [2020-11-29 20:09:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:44,183 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 2543 transitions. [2020-11-29 20:09:44,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:09:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2543 transitions. [2020-11-29 20:09:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-11-29 20:09:44,184 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:44,185 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, 1] [2020-11-29 20:09:44,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-29 20:09:44,185 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:44,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash -737827078, now seen corresponding path program 1 times [2020-11-29 20:09:44,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:44,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639681412] [2020-11-29 20:09:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:44,266 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-29 20:09:44,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639681412] [2020-11-29 20:09:44,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:44,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:44,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367891419] [2020-11-29 20:09:44,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:44,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:44,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:44,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:44,268 INFO L87 Difference]: Start difference. First operand 2071 states and 2543 transitions. Second operand 3 states. [2020-11-29 20:09:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:44,502 INFO L93 Difference]: Finished difference Result 3759 states and 4649 transitions. [2020-11-29 20:09:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:44,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-11-29 20:09:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:44,506 INFO L225 Difference]: With dead ends: 3759 [2020-11-29 20:09:44,506 INFO L226 Difference]: Without dead ends: 2029 [2020-11-29 20:09:44,508 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-29 20:09:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2020-11-29 20:09:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1941. [2020-11-29 20:09:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-11-29 20:09:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2345 transitions. [2020-11-29 20:09:44,646 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2345 transitions. Word has length 176 [2020-11-29 20:09:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:44,646 INFO L481 AbstractCegarLoop]: Abstraction has 1941 states and 2345 transitions. [2020-11-29 20:09:44,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2345 transitions. [2020-11-29 20:09:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-11-29 20:09:44,647 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:44,648 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] [2020-11-29 20:09:44,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-29 20:09:44,648 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:44,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1218463733, now seen corresponding path program 1 times [2020-11-29 20:09:44,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:44,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030424096] [2020-11-29 20:09:44,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:44,713 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-29 20:09:44,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030424096] [2020-11-29 20:09:44,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:44,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:44,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999371835] [2020-11-29 20:09:44,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:44,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:44,716 INFO L87 Difference]: Start difference. First operand 1941 states and 2345 transitions. Second operand 3 states. [2020-11-29 20:09:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:44,950 INFO L93 Difference]: Finished difference Result 4180 states and 5086 transitions. [2020-11-29 20:09:44,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:44,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-11-29 20:09:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:44,954 INFO L225 Difference]: With dead ends: 4180 [2020-11-29 20:09:44,955 INFO L226 Difference]: Without dead ends: 2576 [2020-11-29 20:09:44,957 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-29 20:09:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2020-11-29 20:09:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2219. [2020-11-29 20:09:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2020-11-29 20:09:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2645 transitions. [2020-11-29 20:09:45,270 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2645 transitions. Word has length 182 [2020-11-29 20:09:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:45,271 INFO L481 AbstractCegarLoop]: Abstraction has 2219 states and 2645 transitions. [2020-11-29 20:09:45,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2645 transitions. [2020-11-29 20:09:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-29 20:09:45,274 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:45,274 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, 1] [2020-11-29 20:09:45,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-29 20:09:45,275 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2019531348, now seen corresponding path program 1 times [2020-11-29 20:09:45,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:45,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328873459] [2020-11-29 20:09:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-11-29 20:09:45,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328873459] [2020-11-29 20:09:45,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:09:45,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:09:45,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427411385] [2020-11-29 20:09:45,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:09:45,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:45,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:09:45,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:09:45,414 INFO L87 Difference]: Start difference. First operand 2219 states and 2645 transitions. Second operand 3 states. [2020-11-29 20:09:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:45,827 INFO L93 Difference]: Finished difference Result 2233 states and 2662 transitions. [2020-11-29 20:09:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:09:45,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-11-29 20:09:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:45,832 INFO L225 Difference]: With dead ends: 2233 [2020-11-29 20:09:45,833 INFO L226 Difference]: Without dead ends: 2231 [2020-11-29 20:09:45,835 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-29 20:09:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2020-11-29 20:09:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2223. [2020-11-29 20:09:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2020-11-29 20:09:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2649 transitions. [2020-11-29 20:09:46,204 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2649 transitions. Word has length 185 [2020-11-29 20:09:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:46,205 INFO L481 AbstractCegarLoop]: Abstraction has 2223 states and 2649 transitions. [2020-11-29 20:09:46,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:09:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2649 transitions. [2020-11-29 20:09:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-29 20:09:46,208 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:46,208 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, 1] [2020-11-29 20:09:46,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-29 20:09:46,209 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:46,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:46,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2019529810, now seen corresponding path program 1 times [2020-11-29 20:09:46,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:46,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752684784] [2020-11-29 20:09:46,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 20:09:46,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752684784] [2020-11-29 20:09:46,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818829880] [2020-11-29 20:09:46,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:09:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:09:46,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-29 20:09:46,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:09:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 20:09:47,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:09:47,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-11-29 20:09:47,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975488986] [2020-11-29 20:09:47,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-29 20:09:47,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:09:47,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-29 20:09:47,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-11-29 20:09:47,498 INFO L87 Difference]: Start difference. First operand 2223 states and 2649 transitions. Second operand 19 states. [2020-11-29 20:09:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:09:50,101 INFO L93 Difference]: Finished difference Result 7200 states and 8561 transitions. [2020-11-29 20:09:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-29 20:09:50,102 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 185 [2020-11-29 20:09:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:09:50,121 INFO L225 Difference]: With dead ends: 7200 [2020-11-29 20:09:50,122 INFO L226 Difference]: Without dead ends: 5301 [2020-11-29 20:09:50,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=230, Invalid=1492, Unknown=0, NotChecked=0, Total=1722 [2020-11-29 20:09:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2020-11-29 20:09:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 2903. [2020-11-29 20:09:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2903 states. [2020-11-29 20:09:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 3446 transitions. [2020-11-29 20:09:50,568 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 3446 transitions. Word has length 185 [2020-11-29 20:09:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:09:50,568 INFO L481 AbstractCegarLoop]: Abstraction has 2903 states and 3446 transitions. [2020-11-29 20:09:50,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-29 20:09:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 3446 transitions. [2020-11-29 20:09:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-11-29 20:09:50,573 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:09:50,574 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, 1, 1] [2020-11-29 20:09:50,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-11-29 20:09:50,798 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:09:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:09:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1819084020, now seen corresponding path program 1 times [2020-11-29 20:09:50,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:09:50,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145018480] [2020-11-29 20:09:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:09:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:09:50,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:09:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:09:50,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:09:50,990 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:09:50,990 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 20:09:50,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-29 20:09:51,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 08:09:51 BoogieIcfgContainer [2020-11-29 20:09:51,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 20:09:51,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:09:51,290 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:09:51,290 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:09:51,291 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:09:24" (3/4) ... [2020-11-29 20:09:51,293 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 20:09:51,560 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_506d6b53-7e43-49d5-ae19-5df1c84f930f/bin/uautomizer/witness.graphml [2020-11-29 20:09:51,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:09:51,563 INFO L168 Benchmark]: Toolchain (without parser) took 28742.31 ms. Allocated memory was 81.8 MB in the beginning and 2.2 GB in the end (delta: 2.2 GB). Free memory was 52.9 MB in the beginning and 997.5 MB in the end (delta: -944.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. [2020-11-29 20:09:51,564 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 81.8 MB. Free memory is still 45.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:09:51,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.65 ms. Allocated memory is still 81.8 MB. Free memory was 52.6 MB in the beginning and 54.4 MB in the end (delta: -1.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 20:09:51,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.63 ms. Allocated memory is still 81.8 MB. Free memory was 54.4 MB in the beginning and 52.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:09:51,566 INFO L168 Benchmark]: Boogie Preprocessor took 69.81 ms. Allocated memory is still 81.8 MB. Free memory was 52.0 MB in the beginning and 49.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:09:51,567 INFO L168 Benchmark]: RCFGBuilder took 1324.24 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 49.9 MB in the beginning and 52.0 MB in the end (delta: -2.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. [2020-11-29 20:09:51,567 INFO L168 Benchmark]: TraceAbstraction took 26518.69 ms. Allocated memory was 100.7 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 51.5 MB in the beginning and 1.0 GB in the end (delta: -983.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. [2020-11-29 20:09:51,568 INFO L168 Benchmark]: Witness Printer took 271.11 ms. Allocated memory is still 2.2 GB. Free memory was 1.0 GB in the beginning and 997.5 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-11-29 20:09:51,570 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.32 ms. Allocated memory is still 81.8 MB. Free memory is still 45.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 462.65 ms. Allocated memory is still 81.8 MB. Free memory was 52.6 MB in the beginning and 54.4 MB in the end (delta: -1.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 86.63 ms. Allocated memory is still 81.8 MB. Free memory was 54.4 MB in the beginning and 52.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 69.81 ms. Allocated memory is still 81.8 MB. Free memory was 52.0 MB in the beginning and 49.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1324.24 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 49.9 MB in the beginning and 52.0 MB in the end (delta: -2.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26518.69 ms. Allocated memory was 100.7 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 51.5 MB in the beginning and 1.0 GB in the end (delta: -983.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. * Witness Printer took 271.11 ms. Allocated memory is still 2.2 GB. Free memory was 1.0 GB in the beginning and 997.5 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.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] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L404] int kernel_st ; [L407] kernel_st = 0 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] [L408] 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] [L419] COND TRUE (int )wl_i == 1 [L420] 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] [L424] COND TRUE (int )c1_i == 1 [L425] 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] [L429] COND TRUE (int )c2_i == 1 [L430] 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] [L434] COND TRUE (int )wb_i == 1 [L435] 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] [L439] COND FALSE !((int )r_i == 1) [L442] 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] [L444] 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] [L449] 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] [L454] 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] [L459] 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] [L464] 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] [L469] 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] [L477] 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] [L487] 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] [L496] 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] [L505] 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] [L514] 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] [L519] 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] [L524] 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] [L529] 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] [L534] 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] [L539] 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] [L545] 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] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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] [L298] 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] [L300] 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] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] 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] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] 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] [L141] 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] [L152] 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] [L154] c1_st = 2 [L155] 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] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] 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] [L186] 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] [L197] 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] [L199] c2_st = 2 [L200] 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] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] 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] [L231] 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] [L242] 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] [L244] wb_st = 2 [L245] 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] [L381] 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] [L298] 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] [L300] 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] [L303] 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] [L306] 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] [L309] 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] [L312] 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] [L551] 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] [L552] 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] [L563] 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] [L564] 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] [L569] 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] [L574] 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] [L579] 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] [L584] COND TRUE (int )e_wl == 0 [L585] 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] [L589] 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] [L590] COND TRUE (int )e_wl == 1 [L591] 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] [L607] 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] [L608] 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] [L616] 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] [L617] 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] [L625] 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] [L626] 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] [L634] 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] [L639] 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] [L644] 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] [L649] 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] [L654] 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] [L659] COND TRUE (int )e_wl == 1 [L660] 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] [L664] 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] [L545] 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] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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] [L298] 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] [L300] 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] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] 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] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] 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] [L141] 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] [L144] 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] [L159] COND TRUE ! processed [L160] data += 1 [L161] 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] [L162] 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] [L163] COND TRUE (int )e_g == 1 [L164] 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] [L171] 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] [L152] 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] [L154] c1_st = 2 [L155] 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] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] 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] [L186] 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] [L189] 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] [L204] COND TRUE ! processed [L205] data += 1 [L206] 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] [L207] 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] [L208] COND TRUE (int )e_g == 1 [L209] 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] [L216] 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] [L197] 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] [L199] c2_st = 2 [L200] 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] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] 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] [L231] 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] [L234] 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] [L249] c_t = data [L250] c_req_up = 1 [L251] 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] [L242] 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] [L244] wb_st = 2 [L245] 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] [L381] 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] [L298] 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] [L300] 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] [L303] 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] [L306] 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] [L309] 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] [L312] 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] [L551] 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] [L552] 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] [L553] COND TRUE c != c_t [L554] c = c_t [L555] 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] [L559] 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] [L563] 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] [L564] 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] [L569] 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] [L574] 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] [L579] COND TRUE (int )e_c == 0 [L580] 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] [L584] 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] [L589] 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] [L597] 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] [L598] 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] [L607] 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] [L608] 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] [L616] 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] [L617] 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] [L625] 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] [L626] 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] [L634] COND TRUE (int )e_c == 1 [L635] 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] [L639] 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] [L644] 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] [L649] 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] [L654] COND TRUE (int )e_c == 1 [L655] 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] [L659] 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] [L664] 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] [L667] 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] [L670] 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] [L673] 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] [L676] 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] [L545] 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] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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] [L298] 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] [L300] 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] [L303] 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] [L306] 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] [L309] 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] [L312] 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] [L321] 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] [L336] 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] [L351] 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] [L366] 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] [L381] COND TRUE (int )r_st == 0 [L383] tmp___3 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___3) [L387] r_st = 1 [L263] d = c [L264] 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] [L265] 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] [L273] 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] [L274] COND TRUE (int )e_e == 1 [L275] 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] [L283] e_e = 2 [L284] 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] [L298] 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] [L300] 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] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] 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] [L114] COND TRUE d == t + 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] [L122] 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", "toy1.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, 131 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.1s, OverallIterations: 34, TraceHistogramMax: 6, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7076 SDtfs, 10115 SDslu, 8985 SDs, 0 SdLazy, 1146 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5348occurred 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: 8.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 6719 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 3005 NumberOfCodeBlocks, 3005 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2785 ConstructedInterpolants, 0 QuantifiedInterpolants, 702999 SizeOfPredicates, 6 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 34 InterpolantComputations, 32 PerfectInterpolantSequences, 807/918 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...