./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy2.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f721563b23ef637d292551ef1a662f821e744b5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-69874e2 [2020-12-01 15:35:38,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:35:38,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:35:38,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:35:38,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:35:38,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:35:38,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:35:38,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:35:38,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:35:38,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:35:38,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:35:38,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:35:38,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:35:38,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:35:38,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:35:38,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:35:38,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:35:38,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:35:38,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:35:38,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:35:38,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:35:38,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:35:38,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:35:38,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:35:38,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:35:38,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:35:38,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:35:38,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:35:38,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:35:38,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:35:38,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:35:38,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:35:38,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:35:38,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:35:38,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:35:38,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:35:38,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:35:38,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:35:38,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:35:38,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:35:38,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:35:38,612 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:35:38,649 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:35:38,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:35:38,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:35:38,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:35:38,655 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:35:38,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:35:38,655 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:35:38,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:35:38,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:35:38,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:35:38,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:35:38,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:35:38,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:35:38,658 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:35:38,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:35:38,658 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:35:38,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:35:38,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:35:38,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:35:38,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:35:38,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:35:38,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:35:38,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:35:38,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:35:38,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:35:38,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:35:38,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:35:38,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:35:38,662 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:35:38,662 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_4d485f8b-1e1e-450e-be62-cb0552fda9ef/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_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f721563b23ef637d292551ef1a662f821e744b5 [2020-12-01 15:35:39,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:35:39,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:35:39,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:35:39,054 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:35:39,056 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:35:39,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/../../sv-benchmarks/c/systemc/toy2.cil.c [2020-12-01 15:35:39,142 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/data/17bf992e3/9a238474ec624d49bdc01c925899acc1/FLAG473566ad8 [2020-12-01 15:35:39,699 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:35:39,700 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/sv-benchmarks/c/systemc/toy2.cil.c [2020-12-01 15:35:39,710 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/data/17bf992e3/9a238474ec624d49bdc01c925899acc1/FLAG473566ad8 [2020-12-01 15:35:40,074 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/data/17bf992e3/9a238474ec624d49bdc01c925899acc1 [2020-12-01 15:35:40,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:35:40,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:35:40,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:35:40,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:35:40,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:35:40,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dbebe5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40, skipping insertion in model container [2020-12-01 15:35:40,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:35:40,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:35:40,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:35:40,535 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:35:40,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:35:40,601 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:35:40,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40 WrapperNode [2020-12-01 15:35:40,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:35:40,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:35:40,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:35:40,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:35:40,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:35:40,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:35:40,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:35:40,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:35:40,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (1/1) ... [2020-12-01 15:35:40,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:35:40,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:35:40,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:35:40,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:35:40,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/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-12-01 15:35:40,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:35:40,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:35:40,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:35:40,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:35:41,421 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:35:41,421 INFO L298 CfgBuilder]: Removed 28 assume(true) statements. [2020-12-01 15:35:41,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:35:41 BoogieIcfgContainer [2020-12-01 15:35:41,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:35:41,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:35:41,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:35:41,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:35:41,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:35:40" (1/3) ... [2020-12-01 15:35:41,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a9101b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:35:41, skipping insertion in model container [2020-12-01 15:35:41,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:35:40" (2/3) ... [2020-12-01 15:35:41,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a9101b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:35:41, skipping insertion in model container [2020-12-01 15:35:41,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:35:41" (3/3) ... [2020-12-01 15:35:41,439 INFO L111 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2020-12-01 15:35:41,455 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:35:41,461 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-01 15:35:41,472 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-01 15:35:41,520 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:35:41,520 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:35:41,520 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:35:41,520 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:35:41,520 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:35:41,521 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:35:41,521 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:35:41,521 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:35:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2020-12-01 15:35:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:41,545 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:41,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:41,557 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1633671955, now seen corresponding path program 1 times [2020-12-01 15:35:41,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:41,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662091870] [2020-12-01 15:35:41,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:41,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662091870] [2020-12-01 15:35:41,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:41,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:41,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712324221] [2020-12-01 15:35:41,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:41,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:41,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:41,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:41,800 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2020-12-01 15:35:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:41,852 INFO L93 Difference]: Finished difference Result 243 states and 450 transitions. [2020-12-01 15:35:41,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:41,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-01 15:35:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:41,867 INFO L225 Difference]: With dead ends: 243 [2020-12-01 15:35:41,867 INFO L226 Difference]: Without dead ends: 121 [2020-12-01 15:35:41,871 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-12-01 15:35:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-01 15:35:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-12-01 15:35:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-01 15:35:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2020-12-01 15:35:41,925 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 35 [2020-12-01 15:35:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:41,925 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2020-12-01 15:35:41,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2020-12-01 15:35:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:41,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:41,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:41,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:35:41,929 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:41,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:41,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1611039701, now seen corresponding path program 1 times [2020-12-01 15:35:41,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:41,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793682753] [2020-12-01 15:35:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:42,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793682753] [2020-12-01 15:35:42,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:42,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:42,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380852997] [2020-12-01 15:35:42,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:42,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:42,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:42,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:42,017 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 4 states. [2020-12-01 15:35:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:42,138 INFO L93 Difference]: Finished difference Result 325 states and 571 transitions. [2020-12-01 15:35:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:35:42,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-01 15:35:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:42,142 INFO L225 Difference]: With dead ends: 325 [2020-12-01 15:35:42,142 INFO L226 Difference]: Without dead ends: 207 [2020-12-01 15:35:42,143 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-12-01 15:35:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-01 15:35:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2020-12-01 15:35:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-01 15:35:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 357 transitions. [2020-12-01 15:35:42,190 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 357 transitions. Word has length 35 [2020-12-01 15:35:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:42,190 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 357 transitions. [2020-12-01 15:35:42,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 357 transitions. [2020-12-01 15:35:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:42,200 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:42,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:42,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:35:42,202 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1101566611, now seen corresponding path program 1 times [2020-12-01 15:35:42,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:42,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015552465] [2020-12-01 15:35:42,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:42,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015552465] [2020-12-01 15:35:42,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:42,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:42,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920547161] [2020-12-01 15:35:42,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:42,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:42,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:42,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:42,300 INFO L87 Difference]: Start difference. First operand 204 states and 357 transitions. Second operand 3 states. [2020-12-01 15:35:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:42,366 INFO L93 Difference]: Finished difference Result 399 states and 701 transitions. [2020-12-01 15:35:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:42,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-01 15:35:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:42,374 INFO L225 Difference]: With dead ends: 399 [2020-12-01 15:35:42,374 INFO L226 Difference]: Without dead ends: 204 [2020-12-01 15:35:42,378 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-12-01 15:35:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-01 15:35:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2020-12-01 15:35:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-01 15:35:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 345 transitions. [2020-12-01 15:35:42,399 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 345 transitions. Word has length 35 [2020-12-01 15:35:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:42,399 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 345 transitions. [2020-12-01 15:35:42,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 345 transitions. [2020-12-01 15:35:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:42,401 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:42,401 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:42,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:35:42,402 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1744930967, now seen corresponding path program 1 times [2020-12-01 15:35:42,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:42,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659062649] [2020-12-01 15:35:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:42,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659062649] [2020-12-01 15:35:42,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:42,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:42,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275358260] [2020-12-01 15:35:42,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:42,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:42,469 INFO L87 Difference]: Start difference. First operand 204 states and 345 transitions. Second operand 4 states. [2020-12-01 15:35:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:42,693 INFO L93 Difference]: Finished difference Result 553 states and 938 transitions. [2020-12-01 15:35:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:35:42,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-01 15:35:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:42,696 INFO L225 Difference]: With dead ends: 553 [2020-12-01 15:35:42,696 INFO L226 Difference]: Without dead ends: 359 [2020-12-01 15:35:42,697 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-12-01 15:35:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-12-01 15:35:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 204. [2020-12-01 15:35:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-01 15:35:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 342 transitions. [2020-12-01 15:35:42,732 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 342 transitions. Word has length 35 [2020-12-01 15:35:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:42,732 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 342 transitions. [2020-12-01 15:35:42,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 342 transitions. [2020-12-01 15:35:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:42,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:42,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:42,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:35:42,737 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:42,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:42,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1806970581, now seen corresponding path program 1 times [2020-12-01 15:35:42,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:42,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887082338] [2020-12-01 15:35:42,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:42,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887082338] [2020-12-01 15:35:42,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:42,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:42,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604868466] [2020-12-01 15:35:42,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:42,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:42,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:42,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:42,811 INFO L87 Difference]: Start difference. First operand 204 states and 342 transitions. Second operand 4 states. [2020-12-01 15:35:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:42,917 INFO L93 Difference]: Finished difference Result 556 states and 934 transitions. [2020-12-01 15:35:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:35:42,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-01 15:35:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:42,923 INFO L225 Difference]: With dead ends: 556 [2020-12-01 15:35:42,923 INFO L226 Difference]: Without dead ends: 363 [2020-12-01 15:35:42,924 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-12-01 15:35:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-12-01 15:35:42,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 204. [2020-12-01 15:35:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-01 15:35:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 339 transitions. [2020-12-01 15:35:42,960 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 339 transitions. Word has length 35 [2020-12-01 15:35:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:42,961 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 339 transitions. [2020-12-01 15:35:42,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 339 transitions. [2020-12-01 15:35:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:42,962 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:42,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:42,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:35:42,962 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1947519191, now seen corresponding path program 1 times [2020-12-01 15:35:42,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:42,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311165468] [2020-12-01 15:35:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:43,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311165468] [2020-12-01 15:35:43,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:43,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:43,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393398205] [2020-12-01 15:35:43,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:43,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:43,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:43,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:43,031 INFO L87 Difference]: Start difference. First operand 204 states and 339 transitions. Second operand 4 states. [2020-12-01 15:35:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:43,111 INFO L93 Difference]: Finished difference Result 568 states and 945 transitions. [2020-12-01 15:35:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:35:43,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-01 15:35:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:43,115 INFO L225 Difference]: With dead ends: 568 [2020-12-01 15:35:43,116 INFO L226 Difference]: Without dead ends: 376 [2020-12-01 15:35:43,116 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-12-01 15:35:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-12-01 15:35:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 210. [2020-12-01 15:35:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-01 15:35:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 343 transitions. [2020-12-01 15:35:43,143 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 343 transitions. Word has length 35 [2020-12-01 15:35:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:43,150 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 343 transitions. [2020-12-01 15:35:43,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 343 transitions. [2020-12-01 15:35:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:43,153 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:43,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:43,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:35:43,154 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1813505685, now seen corresponding path program 1 times [2020-12-01 15:35:43,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:43,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237121631] [2020-12-01 15:35:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:43,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237121631] [2020-12-01 15:35:43,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:43,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:43,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544334046] [2020-12-01 15:35:43,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:43,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:43,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:43,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:43,210 INFO L87 Difference]: Start difference. First operand 210 states and 343 transitions. Second operand 4 states. [2020-12-01 15:35:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:43,321 INFO L93 Difference]: Finished difference Result 713 states and 1165 transitions. [2020-12-01 15:35:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:35:43,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-01 15:35:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:43,326 INFO L225 Difference]: With dead ends: 713 [2020-12-01 15:35:43,327 INFO L226 Difference]: Without dead ends: 516 [2020-12-01 15:35:43,328 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-12-01 15:35:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-12-01 15:35:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 341. [2020-12-01 15:35:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-12-01 15:35:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 554 transitions. [2020-12-01 15:35:43,354 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 554 transitions. Word has length 35 [2020-12-01 15:35:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:43,354 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 554 transitions. [2020-12-01 15:35:43,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 554 transitions. [2020-12-01 15:35:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:43,356 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:43,357 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:43,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:35:43,358 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:43,358 INFO L82 PathProgramCache]: Analyzing trace with hash 8067351, now seen corresponding path program 1 times [2020-12-01 15:35:43,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:43,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009323702] [2020-12-01 15:35:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:43,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009323702] [2020-12-01 15:35:43,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:43,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:43,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787312041] [2020-12-01 15:35:43,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:43,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:43,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:43,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:43,446 INFO L87 Difference]: Start difference. First operand 341 states and 554 transitions. Second operand 3 states. [2020-12-01 15:35:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:43,496 INFO L93 Difference]: Finished difference Result 812 states and 1325 transitions. [2020-12-01 15:35:43,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:43,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-01 15:35:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:43,500 INFO L225 Difference]: With dead ends: 812 [2020-12-01 15:35:43,500 INFO L226 Difference]: Without dead ends: 495 [2020-12-01 15:35:43,501 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-12-01 15:35:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-01 15:35:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2020-12-01 15:35:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-01 15:35:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 800 transitions. [2020-12-01 15:35:43,529 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 800 transitions. Word has length 35 [2020-12-01 15:35:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:43,530 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 800 transitions. [2020-12-01 15:35:43,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 800 transitions. [2020-12-01 15:35:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:43,530 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:43,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:43,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:35:43,531 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:43,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:43,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2127880731, now seen corresponding path program 1 times [2020-12-01 15:35:43,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:43,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467790642] [2020-12-01 15:35:43,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:43,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467790642] [2020-12-01 15:35:43,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:43,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:43,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127460455] [2020-12-01 15:35:43,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:43,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:43,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:43,610 INFO L87 Difference]: Start difference. First operand 493 states and 800 transitions. Second operand 4 states. [2020-12-01 15:35:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:43,727 INFO L93 Difference]: Finished difference Result 1255 states and 2037 transitions. [2020-12-01 15:35:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:35:43,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-01 15:35:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:43,733 INFO L225 Difference]: With dead ends: 1255 [2020-12-01 15:35:43,733 INFO L226 Difference]: Without dead ends: 779 [2020-12-01 15:35:43,734 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-12-01 15:35:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-12-01 15:35:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 493. [2020-12-01 15:35:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-01 15:35:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 792 transitions. [2020-12-01 15:35:43,769 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 792 transitions. Word has length 35 [2020-12-01 15:35:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:43,769 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 792 transitions. [2020-12-01 15:35:43,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 792 transitions. [2020-12-01 15:35:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:43,770 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:43,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:43,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:35:43,770 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:43,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:43,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1106812377, now seen corresponding path program 1 times [2020-12-01 15:35:43,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:43,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137189528] [2020-12-01 15:35:43,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:43,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137189528] [2020-12-01 15:35:43,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:43,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:43,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302623048] [2020-12-01 15:35:43,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:43,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:43,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:43,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:43,844 INFO L87 Difference]: Start difference. First operand 493 states and 792 transitions. Second operand 4 states. [2020-12-01 15:35:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:43,989 INFO L93 Difference]: Finished difference Result 1251 states and 2010 transitions. [2020-12-01 15:35:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:35:43,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-01 15:35:43,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:43,997 INFO L225 Difference]: With dead ends: 1251 [2020-12-01 15:35:43,997 INFO L226 Difference]: Without dead ends: 781 [2020-12-01 15:35:43,999 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-12-01 15:35:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-12-01 15:35:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 493. [2020-12-01 15:35:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-01 15:35:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 784 transitions. [2020-12-01 15:35:44,041 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 784 transitions. Word has length 35 [2020-12-01 15:35:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:44,043 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 784 transitions. [2020-12-01 15:35:44,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 784 transitions. [2020-12-01 15:35:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:44,045 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:44,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:44,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:35:44,046 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:44,047 INFO L82 PathProgramCache]: Analyzing trace with hash 95695127, now seen corresponding path program 1 times [2020-12-01 15:35:44,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:44,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706928052] [2020-12-01 15:35:44,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:44,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706928052] [2020-12-01 15:35:44,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:44,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:44,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137038627] [2020-12-01 15:35:44,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:44,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:44,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:44,118 INFO L87 Difference]: Start difference. First operand 493 states and 784 transitions. Second operand 4 states. [2020-12-01 15:35:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:44,244 INFO L93 Difference]: Finished difference Result 1192 states and 1892 transitions. [2020-12-01 15:35:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:35:44,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-01 15:35:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:44,249 INFO L225 Difference]: With dead ends: 1192 [2020-12-01 15:35:44,249 INFO L226 Difference]: Without dead ends: 716 [2020-12-01 15:35:44,251 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-12-01 15:35:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-01 15:35:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 541. [2020-12-01 15:35:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-12-01 15:35:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 841 transitions. [2020-12-01 15:35:44,290 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 841 transitions. Word has length 35 [2020-12-01 15:35:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:44,291 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 841 transitions. [2020-12-01 15:35:44,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 841 transitions. [2020-12-01 15:35:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 15:35:44,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:44,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:44,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:35:44,292 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash 353860565, now seen corresponding path program 1 times [2020-12-01 15:35:44,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:44,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011050239] [2020-12-01 15:35:44,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:44,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011050239] [2020-12-01 15:35:44,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:44,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:44,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804728531] [2020-12-01 15:35:44,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:44,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:44,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:44,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:44,338 INFO L87 Difference]: Start difference. First operand 541 states and 841 transitions. Second operand 3 states. [2020-12-01 15:35:44,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:44,435 INFO L93 Difference]: Finished difference Result 1288 states and 2008 transitions. [2020-12-01 15:35:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:44,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-01 15:35:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:44,440 INFO L225 Difference]: With dead ends: 1288 [2020-12-01 15:35:44,440 INFO L226 Difference]: Without dead ends: 761 [2020-12-01 15:35:44,441 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-12-01 15:35:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-12-01 15:35:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 758. [2020-12-01 15:35:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2020-12-01 15:35:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1165 transitions. [2020-12-01 15:35:44,487 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1165 transitions. Word has length 35 [2020-12-01 15:35:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:44,488 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 1165 transitions. [2020-12-01 15:35:44,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1165 transitions. [2020-12-01 15:35:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-01 15:35:44,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:44,489 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:44,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:35:44,490 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash -230098911, now seen corresponding path program 1 times [2020-12-01 15:35:44,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:44,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417915593] [2020-12-01 15:35:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:44,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417915593] [2020-12-01 15:35:44,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:44,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:44,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76882700] [2020-12-01 15:35:44,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:44,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:44,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:44,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:44,529 INFO L87 Difference]: Start difference. First operand 758 states and 1165 transitions. Second operand 3 states. [2020-12-01 15:35:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:44,622 INFO L93 Difference]: Finished difference Result 1864 states and 2903 transitions. [2020-12-01 15:35:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:44,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-01 15:35:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:44,630 INFO L225 Difference]: With dead ends: 1864 [2020-12-01 15:35:44,631 INFO L226 Difference]: Without dead ends: 1133 [2020-12-01 15:35:44,632 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-12-01 15:35:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2020-12-01 15:35:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2020-12-01 15:35:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2020-12-01 15:35:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1752 transitions. [2020-12-01 15:35:44,709 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1752 transitions. Word has length 45 [2020-12-01 15:35:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:44,709 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1752 transitions. [2020-12-01 15:35:44,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1752 transitions. [2020-12-01 15:35:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-01 15:35:44,712 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:44,712 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:44,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 15:35:44,713 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:44,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:44,714 INFO L82 PathProgramCache]: Analyzing trace with hash 193547811, now seen corresponding path program 1 times [2020-12-01 15:35:44,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:44,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443509899] [2020-12-01 15:35:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-01 15:35:44,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443509899] [2020-12-01 15:35:44,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:44,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:44,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852459204] [2020-12-01 15:35:44,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:44,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:44,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:44,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:44,764 INFO L87 Difference]: Start difference. First operand 1131 states and 1752 transitions. Second operand 3 states. [2020-12-01 15:35:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:44,845 INFO L93 Difference]: Finished difference Result 2213 states and 3445 transitions. [2020-12-01 15:35:44,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:44,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-01 15:35:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:44,852 INFO L225 Difference]: With dead ends: 2213 [2020-12-01 15:35:44,853 INFO L226 Difference]: Without dead ends: 1109 [2020-12-01 15:35:44,858 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-12-01 15:35:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2020-12-01 15:35:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2020-12-01 15:35:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2020-12-01 15:35:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1725 transitions. [2020-12-01 15:35:44,936 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1725 transitions. Word has length 45 [2020-12-01 15:35:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:44,936 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 1725 transitions. [2020-12-01 15:35:44,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1725 transitions. [2020-12-01 15:35:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-01 15:35:44,938 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:44,938 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-12-01 15:35:44,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:35:44,938 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:44,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:44,939 INFO L82 PathProgramCache]: Analyzing trace with hash 668512427, now seen corresponding path program 1 times [2020-12-01 15:35:44,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:44,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988243866] [2020-12-01 15:35:44,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:44,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988243866] [2020-12-01 15:35:44,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:44,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:44,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097664056] [2020-12-01 15:35:44,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:44,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:44,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:44,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:44,981 INFO L87 Difference]: Start difference. First operand 1109 states and 1725 transitions. Second operand 3 states. [2020-12-01 15:35:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:45,123 INFO L93 Difference]: Finished difference Result 2813 states and 4432 transitions. [2020-12-01 15:35:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:45,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-01 15:35:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:45,135 INFO L225 Difference]: With dead ends: 2813 [2020-12-01 15:35:45,136 INFO L226 Difference]: Without dead ends: 1731 [2020-12-01 15:35:45,139 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-12-01 15:35:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2020-12-01 15:35:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1729. [2020-12-01 15:35:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2020-12-01 15:35:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2711 transitions. [2020-12-01 15:35:45,268 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2711 transitions. Word has length 46 [2020-12-01 15:35:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:45,270 INFO L481 AbstractCegarLoop]: Abstraction has 1729 states and 2711 transitions. [2020-12-01 15:35:45,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2711 transitions. [2020-12-01 15:35:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-01 15:35:45,271 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:45,272 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-12-01 15:35:45,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 15:35:45,272 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash -710212426, now seen corresponding path program 1 times [2020-12-01 15:35:45,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:45,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203811451] [2020-12-01 15:35:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:45,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203811451] [2020-12-01 15:35:45,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:45,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:45,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45809183] [2020-12-01 15:35:45,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:45,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:45,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:45,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:45,335 INFO L87 Difference]: Start difference. First operand 1729 states and 2711 transitions. Second operand 3 states. [2020-12-01 15:35:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:45,531 INFO L93 Difference]: Finished difference Result 4644 states and 7373 transitions. [2020-12-01 15:35:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:45,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-01 15:35:45,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:45,548 INFO L225 Difference]: With dead ends: 4644 [2020-12-01 15:35:45,549 INFO L226 Difference]: Without dead ends: 2944 [2020-12-01 15:35:45,552 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-12-01 15:35:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-12-01 15:35:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2942. [2020-12-01 15:35:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2020-12-01 15:35:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4650 transitions. [2020-12-01 15:35:45,814 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4650 transitions. Word has length 47 [2020-12-01 15:35:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:45,814 INFO L481 AbstractCegarLoop]: Abstraction has 2942 states and 4650 transitions. [2020-12-01 15:35:45,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4650 transitions. [2020-12-01 15:35:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-01 15:35:45,816 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:45,816 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-12-01 15:35:45,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 15:35:45,819 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:45,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:45,819 INFO L82 PathProgramCache]: Analyzing trace with hash -286565704, now seen corresponding path program 1 times [2020-12-01 15:35:45,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:45,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901809955] [2020-12-01 15:35:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-01 15:35:45,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901809955] [2020-12-01 15:35:45,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:45,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:45,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673272701] [2020-12-01 15:35:45,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:45,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:45,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:45,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:45,863 INFO L87 Difference]: Start difference. First operand 2942 states and 4650 transitions. Second operand 3 states. [2020-12-01 15:35:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:46,059 INFO L93 Difference]: Finished difference Result 5833 states and 9241 transitions. [2020-12-01 15:35:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:46,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-01 15:35:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:46,075 INFO L225 Difference]: With dead ends: 5833 [2020-12-01 15:35:46,076 INFO L226 Difference]: Without dead ends: 2920 [2020-12-01 15:35:46,081 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-12-01 15:35:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-12-01 15:35:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2020-12-01 15:35:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2020-12-01 15:35:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4624 transitions. [2020-12-01 15:35:46,296 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4624 transitions. Word has length 47 [2020-12-01 15:35:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:46,296 INFO L481 AbstractCegarLoop]: Abstraction has 2920 states and 4624 transitions. [2020-12-01 15:35:46,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4624 transitions. [2020-12-01 15:35:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 15:35:46,298 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:46,298 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-12-01 15:35:46,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-01 15:35:46,299 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:46,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1167001578, now seen corresponding path program 1 times [2020-12-01 15:35:46,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:46,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84930151] [2020-12-01 15:35:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:46,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84930151] [2020-12-01 15:35:46,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:46,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:46,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794043837] [2020-12-01 15:35:46,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:46,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:46,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:46,343 INFO L87 Difference]: Start difference. First operand 2920 states and 4624 transitions. Second operand 4 states. [2020-12-01 15:35:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:46,762 INFO L93 Difference]: Finished difference Result 7421 states and 11813 transitions. [2020-12-01 15:35:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:35:46,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-12-01 15:35:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:46,784 INFO L225 Difference]: With dead ends: 7421 [2020-12-01 15:35:46,784 INFO L226 Difference]: Without dead ends: 3797 [2020-12-01 15:35:46,789 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-12-01 15:35:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2020-12-01 15:35:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3797. [2020-12-01 15:35:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2020-12-01 15:35:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 5990 transitions. [2020-12-01 15:35:47,127 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 5990 transitions. Word has length 48 [2020-12-01 15:35:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:47,127 INFO L481 AbstractCegarLoop]: Abstraction has 3797 states and 5990 transitions. [2020-12-01 15:35:47,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 5990 transitions. [2020-12-01 15:35:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-01 15:35:47,129 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:47,130 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:47,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-01 15:35:47,130 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1620471122, now seen corresponding path program 1 times [2020-12-01 15:35:47,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:47,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748978708] [2020-12-01 15:35:47,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:47,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748978708] [2020-12-01 15:35:47,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:47,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:35:47,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179860686] [2020-12-01 15:35:47,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:35:47,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:35:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:35:47,195 INFO L87 Difference]: Start difference. First operand 3797 states and 5990 transitions. Second operand 5 states. [2020-12-01 15:35:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:47,758 INFO L93 Difference]: Finished difference Result 9692 states and 15178 transitions. [2020-12-01 15:35:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:35:47,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-12-01 15:35:47,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:47,793 INFO L225 Difference]: With dead ends: 9692 [2020-12-01 15:35:47,793 INFO L226 Difference]: Without dead ends: 5918 [2020-12-01 15:35:47,800 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-12-01 15:35:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2020-12-01 15:35:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 4440. [2020-12-01 15:35:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4440 states. [2020-12-01 15:35:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6847 transitions. [2020-12-01 15:35:48,173 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6847 transitions. Word has length 53 [2020-12-01 15:35:48,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:48,174 INFO L481 AbstractCegarLoop]: Abstraction has 4440 states and 6847 transitions. [2020-12-01 15:35:48,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:35:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6847 transitions. [2020-12-01 15:35:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-01 15:35:48,180 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:48,180 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:48,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-01 15:35:48,181 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2101139439, now seen corresponding path program 1 times [2020-12-01 15:35:48,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:48,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087075828] [2020-12-01 15:35:48,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:48,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087075828] [2020-12-01 15:35:48,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:48,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:48,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144717904] [2020-12-01 15:35:48,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:48,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:48,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:48,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:48,260 INFO L87 Difference]: Start difference. First operand 4440 states and 6847 transitions. Second operand 3 states. [2020-12-01 15:35:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:48,635 INFO L93 Difference]: Finished difference Result 9203 states and 14160 transitions. [2020-12-01 15:35:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:48,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-01 15:35:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:48,665 INFO L225 Difference]: With dead ends: 9203 [2020-12-01 15:35:48,665 INFO L226 Difference]: Without dead ends: 4792 [2020-12-01 15:35:48,670 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-12-01 15:35:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2020-12-01 15:35:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4760. [2020-12-01 15:35:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4760 states. [2020-12-01 15:35:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 7096 transitions. [2020-12-01 15:35:49,146 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 7096 transitions. Word has length 85 [2020-12-01 15:35:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:49,146 INFO L481 AbstractCegarLoop]: Abstraction has 4760 states and 7096 transitions. [2020-12-01 15:35:49,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 7096 transitions. [2020-12-01 15:35:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-01 15:35:49,151 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:49,151 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-12-01 15:35:49,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-01 15:35:49,152 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash 378663463, now seen corresponding path program 1 times [2020-12-01 15:35:49,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:49,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750086350] [2020-12-01 15:35:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:49,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750086350] [2020-12-01 15:35:49,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:49,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:49,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170791961] [2020-12-01 15:35:49,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:49,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:49,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:49,200 INFO L87 Difference]: Start difference. First operand 4760 states and 7096 transitions. Second operand 3 states. [2020-12-01 15:35:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:49,667 INFO L93 Difference]: Finished difference Result 10001 states and 14870 transitions. [2020-12-01 15:35:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:49,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-01 15:35:49,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:49,682 INFO L225 Difference]: With dead ends: 10001 [2020-12-01 15:35:49,683 INFO L226 Difference]: Without dead ends: 5282 [2020-12-01 15:35:49,689 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-12-01 15:35:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2020-12-01 15:35:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5234. [2020-12-01 15:35:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2020-12-01 15:35:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7539 transitions. [2020-12-01 15:35:50,107 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7539 transitions. Word has length 86 [2020-12-01 15:35:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:50,107 INFO L481 AbstractCegarLoop]: Abstraction has 5234 states and 7539 transitions. [2020-12-01 15:35:50,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7539 transitions. [2020-12-01 15:35:50,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-01 15:35:50,113 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:50,114 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-12-01 15:35:50,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-01 15:35:50,114 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2102863697, now seen corresponding path program 1 times [2020-12-01 15:35:50,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:50,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650599952] [2020-12-01 15:35:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:35:50,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650599952] [2020-12-01 15:35:50,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:50,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:50,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811054662] [2020-12-01 15:35:50,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:50,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:50,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:50,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:50,153 INFO L87 Difference]: Start difference. First operand 5234 states and 7539 transitions. Second operand 3 states. [2020-12-01 15:35:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:50,543 INFO L93 Difference]: Finished difference Result 10775 states and 15529 transitions. [2020-12-01 15:35:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:50,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-01 15:35:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:50,556 INFO L225 Difference]: With dead ends: 10775 [2020-12-01 15:35:50,556 INFO L226 Difference]: Without dead ends: 5602 [2020-12-01 15:35:50,564 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-12-01 15:35:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2020-12-01 15:35:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 5024. [2020-12-01 15:35:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5024 states. [2020-12-01 15:35:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5024 states to 5024 states and 6917 transitions. [2020-12-01 15:35:51,040 INFO L78 Accepts]: Start accepts. Automaton has 5024 states and 6917 transitions. Word has length 87 [2020-12-01 15:35:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:51,040 INFO L481 AbstractCegarLoop]: Abstraction has 5024 states and 6917 transitions. [2020-12-01 15:35:51,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 5024 states and 6917 transitions. [2020-12-01 15:35:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 15:35:51,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:51,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, 1] [2020-12-01 15:35:51,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-01 15:35:51,047 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:51,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:51,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1080949445, now seen corresponding path program 1 times [2020-12-01 15:35:51,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:51,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124075713] [2020-12-01 15:35:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-01 15:35:51,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124075713] [2020-12-01 15:35:51,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:51,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:51,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362098250] [2020-12-01 15:35:51,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:51,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:51,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:51,113 INFO L87 Difference]: Start difference. First operand 5024 states and 6917 transitions. Second operand 4 states. [2020-12-01 15:35:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:51,712 INFO L93 Difference]: Finished difference Result 9412 states and 12909 transitions. [2020-12-01 15:35:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:35:51,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-01 15:35:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:51,725 INFO L225 Difference]: With dead ends: 9412 [2020-12-01 15:35:51,725 INFO L226 Difference]: Without dead ends: 4839 [2020-12-01 15:35:51,732 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-12-01 15:35:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2020-12-01 15:35:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4725. [2020-12-01 15:35:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2020-12-01 15:35:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 6299 transitions. [2020-12-01 15:35:52,206 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 6299 transitions. Word has length 88 [2020-12-01 15:35:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:52,207 INFO L481 AbstractCegarLoop]: Abstraction has 4725 states and 6299 transitions. [2020-12-01 15:35:52,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 6299 transitions. [2020-12-01 15:35:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-01 15:35:52,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:52,221 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:52,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-01 15:35:52,222 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:52,222 INFO L82 PathProgramCache]: Analyzing trace with hash -273115530, now seen corresponding path program 1 times [2020-12-01 15:35:52,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:52,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901141902] [2020-12-01 15:35:52,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 15:35:52,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901141902] [2020-12-01 15:35:52,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:52,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:52,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068621059] [2020-12-01 15:35:52,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:52,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:52,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:52,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:52,283 INFO L87 Difference]: Start difference. First operand 4725 states and 6299 transitions. Second operand 3 states. [2020-12-01 15:35:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:52,676 INFO L93 Difference]: Finished difference Result 9005 states and 11995 transitions. [2020-12-01 15:35:52,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:52,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-01 15:35:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:52,687 INFO L225 Difference]: With dead ends: 9005 [2020-12-01 15:35:52,688 INFO L226 Difference]: Without dead ends: 4671 [2020-12-01 15:35:52,694 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-12-01 15:35:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2020-12-01 15:35:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4671. [2020-12-01 15:35:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4671 states. [2020-12-01 15:35:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 6193 transitions. [2020-12-01 15:35:53,155 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 6193 transitions. Word has length 115 [2020-12-01 15:35:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:53,155 INFO L481 AbstractCegarLoop]: Abstraction has 4671 states and 6193 transitions. [2020-12-01 15:35:53,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 6193 transitions. [2020-12-01 15:35:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-01 15:35:53,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:53,167 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:53,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-01 15:35:53,167 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash -471932119, now seen corresponding path program 1 times [2020-12-01 15:35:53,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:53,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183561646] [2020-12-01 15:35:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 15:35:53,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183561646] [2020-12-01 15:35:53,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:53,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:53,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478795924] [2020-12-01 15:35:53,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:53,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:53,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:53,230 INFO L87 Difference]: Start difference. First operand 4671 states and 6193 transitions. Second operand 4 states. [2020-12-01 15:35:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:53,618 INFO L93 Difference]: Finished difference Result 8293 states and 11017 transitions. [2020-12-01 15:35:53,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:35:53,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2020-12-01 15:35:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:53,628 INFO L225 Difference]: With dead ends: 8293 [2020-12-01 15:35:53,628 INFO L226 Difference]: Without dead ends: 4591 [2020-12-01 15:35:53,633 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-12-01 15:35:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2020-12-01 15:35:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4589. [2020-12-01 15:35:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4589 states. [2020-12-01 15:35:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 5972 transitions. [2020-12-01 15:35:54,026 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 5972 transitions. Word has length 127 [2020-12-01 15:35:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:54,026 INFO L481 AbstractCegarLoop]: Abstraction has 4589 states and 5972 transitions. [2020-12-01 15:35:54,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 5972 transitions. [2020-12-01 15:35:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-01 15:35:54,037 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:54,038 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:54,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-01 15:35:54,038 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:54,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1801789853, now seen corresponding path program 1 times [2020-12-01 15:35:54,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:54,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311834856] [2020-12-01 15:35:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 15:35:54,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311834856] [2020-12-01 15:35:54,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:54,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:54,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315319392] [2020-12-01 15:35:54,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:54,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:54,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:54,099 INFO L87 Difference]: Start difference. First operand 4589 states and 5972 transitions. Second operand 3 states. [2020-12-01 15:35:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:54,533 INFO L93 Difference]: Finished difference Result 8791 states and 11432 transitions. [2020-12-01 15:35:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:54,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-01 15:35:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:54,543 INFO L225 Difference]: With dead ends: 8791 [2020-12-01 15:35:54,543 INFO L226 Difference]: Without dead ends: 4588 [2020-12-01 15:35:54,549 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-12-01 15:35:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2020-12-01 15:35:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 4548. [2020-12-01 15:35:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2020-12-01 15:35:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 5889 transitions. [2020-12-01 15:35:54,957 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 5889 transitions. Word has length 133 [2020-12-01 15:35:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:54,958 INFO L481 AbstractCegarLoop]: Abstraction has 4548 states and 5889 transitions. [2020-12-01 15:35:54,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 5889 transitions. [2020-12-01 15:35:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-01 15:35:54,969 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:54,969 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:54,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-01 15:35:54,969 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:54,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:54,970 INFO L82 PathProgramCache]: Analyzing trace with hash -142067203, now seen corresponding path program 1 times [2020-12-01 15:35:54,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:54,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469666384] [2020-12-01 15:35:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 15:35:55,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469666384] [2020-12-01 15:35:55,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:55,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:55,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087153362] [2020-12-01 15:35:55,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:55,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:55,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:55,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:55,024 INFO L87 Difference]: Start difference. First operand 4548 states and 5889 transitions. Second operand 3 states. [2020-12-01 15:35:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:55,417 INFO L93 Difference]: Finished difference Result 8730 states and 11293 transitions. [2020-12-01 15:35:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:55,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-01 15:35:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:55,429 INFO L225 Difference]: With dead ends: 8730 [2020-12-01 15:35:55,429 INFO L226 Difference]: Without dead ends: 4558 [2020-12-01 15:35:55,435 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-12-01 15:35:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2020-12-01 15:35:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 4518. [2020-12-01 15:35:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2020-12-01 15:35:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5818 transitions. [2020-12-01 15:35:55,835 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5818 transitions. Word has length 133 [2020-12-01 15:35:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:55,835 INFO L481 AbstractCegarLoop]: Abstraction has 4518 states and 5818 transitions. [2020-12-01 15:35:55,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5818 transitions. [2020-12-01 15:35:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-01 15:35:55,847 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:55,848 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:55,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-01 15:35:55,848 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:55,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1934957922, now seen corresponding path program 1 times [2020-12-01 15:35:55,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:55,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812842990] [2020-12-01 15:35:55,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-01 15:35:55,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812842990] [2020-12-01 15:35:55,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:55,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:55,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975153671] [2020-12-01 15:35:55,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:55,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:55,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:55,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:55,906 INFO L87 Difference]: Start difference. First operand 4518 states and 5818 transitions. Second operand 4 states. [2020-12-01 15:35:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:56,238 INFO L93 Difference]: Finished difference Result 7327 states and 9468 transitions. [2020-12-01 15:35:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:35:56,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-12-01 15:35:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:56,242 INFO L225 Difference]: With dead ends: 7327 [2020-12-01 15:35:56,242 INFO L226 Difference]: Without dead ends: 3182 [2020-12-01 15:35:56,245 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-12-01 15:35:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2020-12-01 15:35:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3180. [2020-12-01 15:35:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3180 states. [2020-12-01 15:35:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4000 transitions. [2020-12-01 15:35:56,526 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4000 transitions. Word has length 136 [2020-12-01 15:35:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:56,526 INFO L481 AbstractCegarLoop]: Abstraction has 3180 states and 4000 transitions. [2020-12-01 15:35:56,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4000 transitions. [2020-12-01 15:35:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-01 15:35:56,533 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:56,534 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:56,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-01 15:35:56,534 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 133231117, now seen corresponding path program 1 times [2020-12-01 15:35:56,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:56,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376164147] [2020-12-01 15:35:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 15:35:56,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376164147] [2020-12-01 15:35:56,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:56,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:35:56,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675804191] [2020-12-01 15:35:56,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:35:56,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:56,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:35:56,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:35:56,594 INFO L87 Difference]: Start difference. First operand 3180 states and 4000 transitions. Second operand 4 states. [2020-12-01 15:35:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:56,840 INFO L93 Difference]: Finished difference Result 5150 states and 6486 transitions. [2020-12-01 15:35:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:35:56,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-12-01 15:35:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:56,844 INFO L225 Difference]: With dead ends: 5150 [2020-12-01 15:35:56,844 INFO L226 Difference]: Without dead ends: 2043 [2020-12-01 15:35:56,853 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-12-01 15:35:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2020-12-01 15:35:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2020-12-01 15:35:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2020-12-01 15:35:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2486 transitions. [2020-12-01 15:35:57,030 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2486 transitions. Word has length 136 [2020-12-01 15:35:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:57,030 INFO L481 AbstractCegarLoop]: Abstraction has 2041 states and 2486 transitions. [2020-12-01 15:35:57,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:35:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2486 transitions. [2020-12-01 15:35:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-12-01 15:35:57,033 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:57,034 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:57,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-01 15:35:57,034 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:57,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:57,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1652555523, now seen corresponding path program 1 times [2020-12-01 15:35:57,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:57,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750931332] [2020-12-01 15:35:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-01 15:35:57,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750931332] [2020-12-01 15:35:57,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:57,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:57,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374112727] [2020-12-01 15:35:57,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:57,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:57,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:57,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:57,109 INFO L87 Difference]: Start difference. First operand 2041 states and 2486 transitions. Second operand 3 states. [2020-12-01 15:35:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:57,301 INFO L93 Difference]: Finished difference Result 3699 states and 4535 transitions. [2020-12-01 15:35:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:57,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-12-01 15:35:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:57,305 INFO L225 Difference]: With dead ends: 3699 [2020-12-01 15:35:57,305 INFO L226 Difference]: Without dead ends: 1999 [2020-12-01 15:35:57,307 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-12-01 15:35:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2020-12-01 15:35:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1931. [2020-12-01 15:35:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2020-12-01 15:35:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2328 transitions. [2020-12-01 15:35:57,488 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2328 transitions. Word has length 175 [2020-12-01 15:35:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:57,489 INFO L481 AbstractCegarLoop]: Abstraction has 1931 states and 2328 transitions. [2020-12-01 15:35:57,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2328 transitions. [2020-12-01 15:35:57,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-12-01 15:35:57,492 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:57,492 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:57,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-01 15:35:57,493 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:57,493 INFO L82 PathProgramCache]: Analyzing trace with hash 919917832, now seen corresponding path program 1 times [2020-12-01 15:35:57,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:57,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335530559] [2020-12-01 15:35:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:35:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-01 15:35:57,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335530559] [2020-12-01 15:35:57,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:35:57,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:35:57,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050667154] [2020-12-01 15:35:57,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:35:57,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:35:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:35:57,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:35:57,602 INFO L87 Difference]: Start difference. First operand 1931 states and 2328 transitions. Second operand 3 states. [2020-12-01 15:35:57,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:35:57,905 INFO L93 Difference]: Finished difference Result 4154 states and 5043 transitions. [2020-12-01 15:35:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:35:57,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2020-12-01 15:35:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:35:57,910 INFO L225 Difference]: With dead ends: 4154 [2020-12-01 15:35:57,910 INFO L226 Difference]: Without dead ends: 2560 [2020-12-01 15:35:57,912 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-12-01 15:35:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2020-12-01 15:35:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2209. [2020-12-01 15:35:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2020-12-01 15:35:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2628 transitions. [2020-12-01 15:35:58,138 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2628 transitions. Word has length 181 [2020-12-01 15:35:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:35:58,138 INFO L481 AbstractCegarLoop]: Abstraction has 2209 states and 2628 transitions. [2020-12-01 15:35:58,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:35:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2628 transitions. [2020-12-01 15:35:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-01 15:35:58,142 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:35:58,143 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:35:58,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-01 15:35:58,143 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:35:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:35:58,144 INFO L82 PathProgramCache]: Analyzing trace with hash 929862786, now seen corresponding path program 1 times [2020-12-01 15:35:58,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:35:58,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049858961] [2020-12-01 15:35:58,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:35:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:35:58,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:35:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:35:58,199 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:35:58,285 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:35:58,285 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 15:35:58,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-01 15:35:58,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:35:58 BoogieIcfgContainer [2020-12-01 15:35:58,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:35:58,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:35:58,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:35:58,599 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:35:58,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:35:41" (3/4) ... [2020-12-01 15:35:58,600 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 15:35:58,828 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4d485f8b-1e1e-450e-be62-cb0552fda9ef/bin/uautomizer/witness.graphml [2020-12-01 15:35:58,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:35:58,830 INFO L168 Benchmark]: Toolchain (without parser) took 18748.84 ms. Allocated memory was 107.0 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 74.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 368.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:35:58,831 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 73.4 MB. Free memory was 35.8 MB in the beginning and 35.8 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:35:58,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.84 ms. Allocated memory is still 107.0 MB. Free memory was 74.5 MB in the beginning and 79.1 MB in the end (delta: -4.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:35:58,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.19 ms. Allocated memory is still 107.0 MB. Free memory was 79.1 MB in the beginning and 76.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:35:58,832 INFO L168 Benchmark]: Boogie Preprocessor took 51.70 ms. Allocated memory is still 107.0 MB. Free memory was 76.2 MB in the beginning and 74.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:35:58,833 INFO L168 Benchmark]: RCFGBuilder took 695.43 ms. Allocated memory is still 107.0 MB. Free memory was 74.3 MB in the beginning and 34.4 MB in the end (delta: 39.9 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2020-12-01 15:35:58,833 INFO L168 Benchmark]: TraceAbstraction took 17172.82 ms. Allocated memory was 107.0 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 33.8 MB in the beginning and 1.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 291.8 MB. Max. memory is 16.1 GB. [2020-12-01 15:35:58,834 INFO L168 Benchmark]: Witness Printer took 230.05 ms. Allocated memory is still 2.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 36.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:35:58,836 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 73.4 MB. Free memory was 35.8 MB in the beginning and 35.8 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 516.84 ms. Allocated memory is still 107.0 MB. Free memory was 74.5 MB in the beginning and 79.1 MB in the end (delta: -4.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 69.19 ms. Allocated memory is still 107.0 MB. Free memory was 79.1 MB in the beginning and 76.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.70 ms. Allocated memory is still 107.0 MB. Free memory was 76.2 MB in the beginning and 74.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 695.43 ms. Allocated memory is still 107.0 MB. Free memory was 74.3 MB in the beginning and 34.4 MB in the end (delta: 39.9 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17172.82 ms. Allocated memory was 107.0 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 33.8 MB in the beginning and 1.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 291.8 MB. Max. memory is 16.1 GB. * Witness Printer took 230.05 ms. Allocated memory is still 2.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 36.9 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] [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L396] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L475] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L484] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L493] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L502] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L507] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L512] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L517] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L129] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L174] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L219] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L540] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L567] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND TRUE (int )e_wl == 0 [L573] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L578] COND TRUE (int )e_wl == 1 [L579] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L595] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L596] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L604] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L605] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L613] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L614] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L622] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L627] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L632] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L637] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND TRUE (int )e_wl == 1 [L648] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L129] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L132] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L147] COND TRUE ! processed [L148] data += 1 [L149] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L150] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L151] COND TRUE (int )e_g == 1 [L152] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L159] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L174] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L177] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L192] COND TRUE ! processed [L193] data += 1 [L194] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L195] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L196] COND TRUE (int )e_g == 1 [L197] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L219] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L222] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L237] c_t = data [L238] c_req_up = 1 [L239] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L540] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L541] COND TRUE c != c_t [L542] c = c_t [L543] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L547] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] COND TRUE (int )e_c == 0 [L568] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L585] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L586] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L596] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L604] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L613] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L614] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L622] COND TRUE (int )e_c == 1 [L623] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L627] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L632] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L637] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND TRUE (int )e_c == 1 [L643] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L655] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L658] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L661] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L533] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L339] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L354] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND TRUE (int )r_st == 0 [L371] tmp___3 = __VERIFIER_nondet_int() [L373] COND TRUE \read(tmp___3) [L375] r_st = 1 [L251] d = c [L252] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L253] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L261] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L262] COND TRUE (int )e_e == 1 [L263] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L271] e_e = 2 [L272] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L3] __assert_fail("0", "toy2.cil.c", 3, "reach_error") VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.7s, OverallIterations: 32, TraceHistogramMax: 6, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6240 SDtfs, 7475 SDslu, 3708 SDs, 0 SdLazy, 663 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5234occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 4173 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2417 NumberOfCodeBlocks, 2417 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2202 ConstructedInterpolants, 0 QuantifiedInterpolants, 341936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 597/597 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...