./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 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/toy2.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-5485861 [2020-10-25 23:16:18,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:16:18,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:16:18,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:16:18,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:16:18,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:16:18,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:16:18,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:16:18,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:16:18,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:16:18,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:16:18,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:16:18,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:16:18,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:16:18,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:16:18,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:16:18,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:16:18,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:16:18,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:16:18,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:16:18,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:16:18,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:16:18,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:16:18,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:16:18,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:16:18,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:16:18,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:16:18,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:16:18,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:16:18,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:16:18,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:16:18,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:16:18,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:16:18,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:16:18,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:16:18,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:16:18,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:16:18,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:16:18,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:16:18,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:16:18,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:16:18,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:16:18,602 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:16:18,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:16:18,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:16:18,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:16:18,605 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:16:18,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:16:18,605 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:16:18,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:16:18,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:16:18,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:16:18,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:16:18,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:16:18,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:16:18,607 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:16:18,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:16:18,608 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:16:18,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:16:18,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:16:18,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:16:18,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:16:18,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:16:18,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:16:18,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:16:18,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:16:18,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:16:18,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:16:18,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:16:18,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:16:18,611 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:16:18,612 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-10-25 23:16:18,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:16:19,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:16:19,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:16:19,025 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:16:19,026 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:16:19,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2020-10-25 23:16:19,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28908833/73e92010ba2e4f589730542e4cb25b3b/FLAG518f2cc04 [2020-10-25 23:16:19,926 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:16:19,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2020-10-25 23:16:19,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28908833/73e92010ba2e4f589730542e4cb25b3b/FLAG518f2cc04 [2020-10-25 23:16:20,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28908833/73e92010ba2e4f589730542e4cb25b3b [2020-10-25 23:16:20,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:16:20,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:16:20,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:16:20,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:16:20,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:16:20,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:20,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c29cd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20, skipping insertion in model container [2020-10-25 23:16:20,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:20,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:16:20,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:16:20,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:16:20,789 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:16:20,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:16:20,941 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:16:20,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20 WrapperNode [2020-10-25 23:16:20,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:16:20,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:16:20,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:16:20,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:16:20,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:20,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:21,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:16:21,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:16:21,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:16:21,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:16:21,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:21,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:21,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:21,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:21,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:21,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:21,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (1/1) ... [2020-10-25 23:16:21,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:16:21,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:16:21,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:16:21,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:16:21,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-25 23:16:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:16:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:16:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:16:21,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:16:22,075 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:16:22,076 INFO L298 CfgBuilder]: Removed 28 assume(true) statements. [2020-10-25 23:16:22,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:16:22 BoogieIcfgContainer [2020-10-25 23:16:22,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:16:22,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:16:22,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:16:22,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:16:22,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:16:20" (1/3) ... [2020-10-25 23:16:22,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212963c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:16:22, skipping insertion in model container [2020-10-25 23:16:22,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:20" (2/3) ... [2020-10-25 23:16:22,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212963c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:16:22, skipping insertion in model container [2020-10-25 23:16:22,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:16:22" (3/3) ... [2020-10-25 23:16:22,088 INFO L111 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2020-10-25 23:16:22,100 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:16:22,106 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 23:16:22,121 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 23:16:22,150 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:16:22,151 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:16:22,151 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:16:22,151 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:16:22,151 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:16:22,152 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:16:22,152 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:16:22,152 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:16:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2020-10-25 23:16:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:22,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:22,182 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-10-25 23:16:22,182 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:22,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1633671955, now seen corresponding path program 1 times [2020-10-25 23:16:22,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:22,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567730286] [2020-10-25 23:16:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:22,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567730286] [2020-10-25 23:16:22,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:22,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:22,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435006658] [2020-10-25 23:16:22,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:22,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:22,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:22,481 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2020-10-25 23:16:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:22,545 INFO L93 Difference]: Finished difference Result 243 states and 450 transitions. [2020-10-25 23:16:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:22,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-25 23:16:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:22,562 INFO L225 Difference]: With dead ends: 243 [2020-10-25 23:16:22,563 INFO L226 Difference]: Without dead ends: 121 [2020-10-25 23:16:22,568 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-10-25 23:16:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-25 23:16:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-10-25 23:16:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-25 23:16:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2020-10-25 23:16:22,630 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 35 [2020-10-25 23:16:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:22,631 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2020-10-25 23:16:22,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2020-10-25 23:16:22,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:22,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:22,637 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-10-25 23:16:22,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:16:22,637 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:22,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1611039701, now seen corresponding path program 1 times [2020-10-25 23:16:22,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:22,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996234855] [2020-10-25 23:16:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:22,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996234855] [2020-10-25 23:16:22,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:22,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:22,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299935969] [2020-10-25 23:16:22,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:22,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:22,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:22,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:22,746 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 4 states. [2020-10-25 23:16:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:22,846 INFO L93 Difference]: Finished difference Result 325 states and 571 transitions. [2020-10-25 23:16:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:16:22,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-25 23:16:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:22,850 INFO L225 Difference]: With dead ends: 325 [2020-10-25 23:16:22,851 INFO L226 Difference]: Without dead ends: 207 [2020-10-25 23:16:22,852 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-10-25 23:16:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-10-25 23:16:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2020-10-25 23:16:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-25 23:16:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 357 transitions. [2020-10-25 23:16:22,881 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 357 transitions. Word has length 35 [2020-10-25 23:16:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:22,881 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 357 transitions. [2020-10-25 23:16:22,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 357 transitions. [2020-10-25 23:16:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:22,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:22,883 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-10-25 23:16:22,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:16:22,884 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:22,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1101566611, now seen corresponding path program 1 times [2020-10-25 23:16:22,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:22,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056715256] [2020-10-25 23:16:22,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:22,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056715256] [2020-10-25 23:16:22,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:22,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:22,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607331079] [2020-10-25 23:16:22,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:22,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:22,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:22,997 INFO L87 Difference]: Start difference. First operand 204 states and 357 transitions. Second operand 3 states. [2020-10-25 23:16:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:23,114 INFO L93 Difference]: Finished difference Result 399 states and 701 transitions. [2020-10-25 23:16:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:23,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-25 23:16:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:23,117 INFO L225 Difference]: With dead ends: 399 [2020-10-25 23:16:23,117 INFO L226 Difference]: Without dead ends: 204 [2020-10-25 23:16:23,119 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-10-25 23:16:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-25 23:16:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2020-10-25 23:16:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-25 23:16:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 345 transitions. [2020-10-25 23:16:23,139 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 345 transitions. Word has length 35 [2020-10-25 23:16:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:23,139 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 345 transitions. [2020-10-25 23:16:23,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 345 transitions. [2020-10-25 23:16:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:23,141 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:23,141 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-10-25 23:16:23,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 23:16:23,142 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1744930967, now seen corresponding path program 1 times [2020-10-25 23:16:23,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:23,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126189416] [2020-10-25 23:16:23,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:23,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126189416] [2020-10-25 23:16:23,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:23,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:23,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718831374] [2020-10-25 23:16:23,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:23,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:23,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:23,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:23,202 INFO L87 Difference]: Start difference. First operand 204 states and 345 transitions. Second operand 4 states. [2020-10-25 23:16:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:23,426 INFO L93 Difference]: Finished difference Result 553 states and 938 transitions. [2020-10-25 23:16:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:23,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-25 23:16:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:23,431 INFO L225 Difference]: With dead ends: 553 [2020-10-25 23:16:23,431 INFO L226 Difference]: Without dead ends: 359 [2020-10-25 23:16:23,435 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-10-25 23:16:23,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-10-25 23:16:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 204. [2020-10-25 23:16:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-25 23:16:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 342 transitions. [2020-10-25 23:16:23,485 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 342 transitions. Word has length 35 [2020-10-25 23:16:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:23,487 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 342 transitions. [2020-10-25 23:16:23,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 342 transitions. [2020-10-25 23:16:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:23,491 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:23,491 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-10-25 23:16:23,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 23:16:23,492 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1806970581, now seen corresponding path program 1 times [2020-10-25 23:16:23,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:23,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486435557] [2020-10-25 23:16:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:23,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486435557] [2020-10-25 23:16:23,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:23,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:23,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892350084] [2020-10-25 23:16:23,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:23,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:23,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:23,550 INFO L87 Difference]: Start difference. First operand 204 states and 342 transitions. Second operand 4 states. [2020-10-25 23:16:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:23,658 INFO L93 Difference]: Finished difference Result 556 states and 934 transitions. [2020-10-25 23:16:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:23,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-25 23:16:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:23,668 INFO L225 Difference]: With dead ends: 556 [2020-10-25 23:16:23,669 INFO L226 Difference]: Without dead ends: 363 [2020-10-25 23:16:23,670 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-10-25 23:16:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-10-25 23:16:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 204. [2020-10-25 23:16:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-25 23:16:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 339 transitions. [2020-10-25 23:16:23,685 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 339 transitions. Word has length 35 [2020-10-25 23:16:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:23,685 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 339 transitions. [2020-10-25 23:16:23,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 339 transitions. [2020-10-25 23:16:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:23,687 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:23,688 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-10-25 23:16:23,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 23:16:23,688 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:23,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1947519191, now seen corresponding path program 1 times [2020-10-25 23:16:23,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:23,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289259935] [2020-10-25 23:16:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:23,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289259935] [2020-10-25 23:16:23,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:23,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:23,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146364180] [2020-10-25 23:16:23,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:23,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:23,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:23,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:23,753 INFO L87 Difference]: Start difference. First operand 204 states and 339 transitions. Second operand 4 states. [2020-10-25 23:16:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:23,866 INFO L93 Difference]: Finished difference Result 568 states and 945 transitions. [2020-10-25 23:16:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:23,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-25 23:16:23,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:23,870 INFO L225 Difference]: With dead ends: 568 [2020-10-25 23:16:23,870 INFO L226 Difference]: Without dead ends: 376 [2020-10-25 23:16:23,871 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-10-25 23:16:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-10-25 23:16:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 210. [2020-10-25 23:16:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-25 23:16:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 343 transitions. [2020-10-25 23:16:23,887 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 343 transitions. Word has length 35 [2020-10-25 23:16:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:23,887 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 343 transitions. [2020-10-25 23:16:23,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 343 transitions. [2020-10-25 23:16:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:23,888 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:23,889 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-10-25 23:16:23,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 23:16:23,889 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:23,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1813505685, now seen corresponding path program 1 times [2020-10-25 23:16:23,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:23,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991248501] [2020-10-25 23:16:23,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:23,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991248501] [2020-10-25 23:16:23,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:23,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:23,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332021728] [2020-10-25 23:16:23,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:23,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:23,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:23,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:23,945 INFO L87 Difference]: Start difference. First operand 210 states and 343 transitions. Second operand 4 states. [2020-10-25 23:16:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:24,068 INFO L93 Difference]: Finished difference Result 713 states and 1165 transitions. [2020-10-25 23:16:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:24,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-25 23:16:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:24,072 INFO L225 Difference]: With dead ends: 713 [2020-10-25 23:16:24,072 INFO L226 Difference]: Without dead ends: 516 [2020-10-25 23:16:24,073 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-10-25 23:16:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-10-25 23:16:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 341. [2020-10-25 23:16:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-10-25 23:16:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 554 transitions. [2020-10-25 23:16:24,098 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 554 transitions. Word has length 35 [2020-10-25 23:16:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:24,098 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 554 transitions. [2020-10-25 23:16:24,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 554 transitions. [2020-10-25 23:16:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:24,100 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:24,100 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-10-25 23:16:24,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 23:16:24,100 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash 8067351, now seen corresponding path program 1 times [2020-10-25 23:16:24,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:24,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404432274] [2020-10-25 23:16:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:24,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404432274] [2020-10-25 23:16:24,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:24,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:24,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137444710] [2020-10-25 23:16:24,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:24,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:24,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:24,150 INFO L87 Difference]: Start difference. First operand 341 states and 554 transitions. Second operand 3 states. [2020-10-25 23:16:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:24,230 INFO L93 Difference]: Finished difference Result 812 states and 1325 transitions. [2020-10-25 23:16:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:24,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-25 23:16:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:24,234 INFO L225 Difference]: With dead ends: 812 [2020-10-25 23:16:24,234 INFO L226 Difference]: Without dead ends: 495 [2020-10-25 23:16:24,236 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-10-25 23:16:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-10-25 23:16:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2020-10-25 23:16:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-25 23:16:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 800 transitions. [2020-10-25 23:16:24,269 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 800 transitions. Word has length 35 [2020-10-25 23:16:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:24,269 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 800 transitions. [2020-10-25 23:16:24,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 800 transitions. [2020-10-25 23:16:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:24,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:24,270 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-10-25 23:16:24,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 23:16:24,271 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:24,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:24,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2127880731, now seen corresponding path program 1 times [2020-10-25 23:16:24,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:24,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428580475] [2020-10-25 23:16:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:24,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428580475] [2020-10-25 23:16:24,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:24,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:24,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236882135] [2020-10-25 23:16:24,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:24,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:24,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:24,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:24,314 INFO L87 Difference]: Start difference. First operand 493 states and 800 transitions. Second operand 4 states. [2020-10-25 23:16:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:24,438 INFO L93 Difference]: Finished difference Result 1255 states and 2037 transitions. [2020-10-25 23:16:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:16:24,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-25 23:16:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:24,443 INFO L225 Difference]: With dead ends: 1255 [2020-10-25 23:16:24,444 INFO L226 Difference]: Without dead ends: 779 [2020-10-25 23:16:24,445 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-10-25 23:16:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-10-25 23:16:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 493. [2020-10-25 23:16:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-25 23:16:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 792 transitions. [2020-10-25 23:16:24,480 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 792 transitions. Word has length 35 [2020-10-25 23:16:24,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:24,481 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 792 transitions. [2020-10-25 23:16:24,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 792 transitions. [2020-10-25 23:16:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:24,482 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:24,482 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-10-25 23:16:24,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 23:16:24,482 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:24,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1106812377, now seen corresponding path program 1 times [2020-10-25 23:16:24,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:24,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555021230] [2020-10-25 23:16:24,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:24,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555021230] [2020-10-25 23:16:24,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:24,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:24,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956529739] [2020-10-25 23:16:24,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:24,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:24,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:24,520 INFO L87 Difference]: Start difference. First operand 493 states and 792 transitions. Second operand 4 states. [2020-10-25 23:16:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:24,662 INFO L93 Difference]: Finished difference Result 1251 states and 2010 transitions. [2020-10-25 23:16:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:16:24,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-25 23:16:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:24,667 INFO L225 Difference]: With dead ends: 1251 [2020-10-25 23:16:24,667 INFO L226 Difference]: Without dead ends: 781 [2020-10-25 23:16:24,668 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-10-25 23:16:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-10-25 23:16:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 493. [2020-10-25 23:16:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-25 23:16:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 784 transitions. [2020-10-25 23:16:24,704 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 784 transitions. Word has length 35 [2020-10-25 23:16:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:24,704 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 784 transitions. [2020-10-25 23:16:24,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 784 transitions. [2020-10-25 23:16:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:24,705 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:24,705 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-10-25 23:16:24,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 23:16:24,706 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash 95695127, now seen corresponding path program 1 times [2020-10-25 23:16:24,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:24,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622779630] [2020-10-25 23:16:24,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:24,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622779630] [2020-10-25 23:16:24,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:24,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:24,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951439383] [2020-10-25 23:16:24,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:24,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:24,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:24,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:24,743 INFO L87 Difference]: Start difference. First operand 493 states and 784 transitions. Second operand 4 states. [2020-10-25 23:16:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:24,873 INFO L93 Difference]: Finished difference Result 1192 states and 1892 transitions. [2020-10-25 23:16:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:16:24,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-25 23:16:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:24,878 INFO L225 Difference]: With dead ends: 1192 [2020-10-25 23:16:24,878 INFO L226 Difference]: Without dead ends: 716 [2020-10-25 23:16:24,880 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-10-25 23:16:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-10-25 23:16:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 541. [2020-10-25 23:16:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-10-25 23:16:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 841 transitions. [2020-10-25 23:16:24,926 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 841 transitions. Word has length 35 [2020-10-25 23:16:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:24,926 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 841 transitions. [2020-10-25 23:16:24,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 841 transitions. [2020-10-25 23:16:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 23:16:24,927 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:24,927 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-10-25 23:16:24,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 23:16:24,927 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:24,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:24,928 INFO L82 PathProgramCache]: Analyzing trace with hash 353860565, now seen corresponding path program 1 times [2020-10-25 23:16:24,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:24,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552859471] [2020-10-25 23:16:24,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:24,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552859471] [2020-10-25 23:16:24,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:24,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:24,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498640066] [2020-10-25 23:16:24,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:24,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:24,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:24,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:24,960 INFO L87 Difference]: Start difference. First operand 541 states and 841 transitions. Second operand 3 states. [2020-10-25 23:16:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:25,059 INFO L93 Difference]: Finished difference Result 1288 states and 2008 transitions. [2020-10-25 23:16:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:25,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-25 23:16:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:25,064 INFO L225 Difference]: With dead ends: 1288 [2020-10-25 23:16:25,064 INFO L226 Difference]: Without dead ends: 761 [2020-10-25 23:16:25,065 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-10-25 23:16:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-10-25 23:16:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 758. [2020-10-25 23:16:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2020-10-25 23:16:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1165 transitions. [2020-10-25 23:16:25,128 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1165 transitions. Word has length 35 [2020-10-25 23:16:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:25,128 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 1165 transitions. [2020-10-25 23:16:25,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1165 transitions. [2020-10-25 23:16:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-25 23:16:25,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:25,129 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-10-25 23:16:25,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 23:16:25,130 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:25,130 INFO L82 PathProgramCache]: Analyzing trace with hash -230098911, now seen corresponding path program 1 times [2020-10-25 23:16:25,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:25,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208267554] [2020-10-25 23:16:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:25,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208267554] [2020-10-25 23:16:25,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:25,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:25,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191565912] [2020-10-25 23:16:25,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:25,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:25,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:25,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:25,166 INFO L87 Difference]: Start difference. First operand 758 states and 1165 transitions. Second operand 3 states. [2020-10-25 23:16:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:25,269 INFO L93 Difference]: Finished difference Result 1864 states and 2903 transitions. [2020-10-25 23:16:25,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:25,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-10-25 23:16:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:25,275 INFO L225 Difference]: With dead ends: 1864 [2020-10-25 23:16:25,275 INFO L226 Difference]: Without dead ends: 1133 [2020-10-25 23:16:25,277 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-10-25 23:16:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2020-10-25 23:16:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2020-10-25 23:16:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2020-10-25 23:16:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1752 transitions. [2020-10-25 23:16:25,371 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1752 transitions. Word has length 45 [2020-10-25 23:16:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:25,372 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1752 transitions. [2020-10-25 23:16:25,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1752 transitions. [2020-10-25 23:16:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-25 23:16:25,374 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:25,375 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-10-25 23:16:25,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 23:16:25,377 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:25,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:25,377 INFO L82 PathProgramCache]: Analyzing trace with hash 193547811, now seen corresponding path program 1 times [2020-10-25 23:16:25,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:25,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168247418] [2020-10-25 23:16:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:16:25,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168247418] [2020-10-25 23:16:25,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:25,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:25,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644576570] [2020-10-25 23:16:25,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:25,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:25,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:25,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:25,430 INFO L87 Difference]: Start difference. First operand 1131 states and 1752 transitions. Second operand 3 states. [2020-10-25 23:16:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:25,505 INFO L93 Difference]: Finished difference Result 2213 states and 3445 transitions. [2020-10-25 23:16:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:25,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-10-25 23:16:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:25,512 INFO L225 Difference]: With dead ends: 2213 [2020-10-25 23:16:25,512 INFO L226 Difference]: Without dead ends: 1109 [2020-10-25 23:16:25,514 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-10-25 23:16:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2020-10-25 23:16:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2020-10-25 23:16:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2020-10-25 23:16:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1725 transitions. [2020-10-25 23:16:25,599 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1725 transitions. Word has length 45 [2020-10-25 23:16:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:25,600 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 1725 transitions. [2020-10-25 23:16:25,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1725 transitions. [2020-10-25 23:16:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-25 23:16:25,601 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:25,601 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-10-25 23:16:25,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 23:16:25,601 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash 668512427, now seen corresponding path program 1 times [2020-10-25 23:16:25,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:25,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851282915] [2020-10-25 23:16:25,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:25,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851282915] [2020-10-25 23:16:25,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:25,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:25,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323040842] [2020-10-25 23:16:25,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:25,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:25,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:25,648 INFO L87 Difference]: Start difference. First operand 1109 states and 1725 transitions. Second operand 3 states. [2020-10-25 23:16:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:25,821 INFO L93 Difference]: Finished difference Result 2813 states and 4432 transitions. [2020-10-25 23:16:25,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:25,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-10-25 23:16:25,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:25,832 INFO L225 Difference]: With dead ends: 2813 [2020-10-25 23:16:25,832 INFO L226 Difference]: Without dead ends: 1731 [2020-10-25 23:16:25,836 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-10-25 23:16:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2020-10-25 23:16:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1729. [2020-10-25 23:16:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2020-10-25 23:16:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2711 transitions. [2020-10-25 23:16:25,990 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2711 transitions. Word has length 46 [2020-10-25 23:16:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:25,992 INFO L481 AbstractCegarLoop]: Abstraction has 1729 states and 2711 transitions. [2020-10-25 23:16:25,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2711 transitions. [2020-10-25 23:16:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-25 23:16:25,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:25,994 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-10-25 23:16:25,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 23:16:25,995 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:25,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:25,995 INFO L82 PathProgramCache]: Analyzing trace with hash -710212426, now seen corresponding path program 1 times [2020-10-25 23:16:25,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:25,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759925427] [2020-10-25 23:16:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:26,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759925427] [2020-10-25 23:16:26,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:26,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:26,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999307271] [2020-10-25 23:16:26,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:26,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:26,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:26,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:26,062 INFO L87 Difference]: Start difference. First operand 1729 states and 2711 transitions. Second operand 3 states. [2020-10-25 23:16:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:26,311 INFO L93 Difference]: Finished difference Result 4644 states and 7373 transitions. [2020-10-25 23:16:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:26,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-10-25 23:16:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:26,327 INFO L225 Difference]: With dead ends: 4644 [2020-10-25 23:16:26,327 INFO L226 Difference]: Without dead ends: 2944 [2020-10-25 23:16:26,330 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-10-25 23:16:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-10-25 23:16:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2942. [2020-10-25 23:16:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2020-10-25 23:16:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4650 transitions. [2020-10-25 23:16:26,573 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4650 transitions. Word has length 47 [2020-10-25 23:16:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:26,573 INFO L481 AbstractCegarLoop]: Abstraction has 2942 states and 4650 transitions. [2020-10-25 23:16:26,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4650 transitions. [2020-10-25 23:16:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-25 23:16:26,576 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:26,576 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-10-25 23:16:26,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 23:16:26,578 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash -286565704, now seen corresponding path program 1 times [2020-10-25 23:16:26,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:26,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992272103] [2020-10-25 23:16:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:16:26,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992272103] [2020-10-25 23:16:26,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:26,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:26,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574563153] [2020-10-25 23:16:26,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:26,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:26,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:26,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:26,616 INFO L87 Difference]: Start difference. First operand 2942 states and 4650 transitions. Second operand 3 states. [2020-10-25 23:16:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:26,819 INFO L93 Difference]: Finished difference Result 5833 states and 9241 transitions. [2020-10-25 23:16:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:26,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-10-25 23:16:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:26,835 INFO L225 Difference]: With dead ends: 5833 [2020-10-25 23:16:26,836 INFO L226 Difference]: Without dead ends: 2920 [2020-10-25 23:16:26,840 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-10-25 23:16:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-10-25 23:16:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2020-10-25 23:16:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2020-10-25 23:16:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4624 transitions. [2020-10-25 23:16:27,078 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4624 transitions. Word has length 47 [2020-10-25 23:16:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:27,078 INFO L481 AbstractCegarLoop]: Abstraction has 2920 states and 4624 transitions. [2020-10-25 23:16:27,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4624 transitions. [2020-10-25 23:16:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-25 23:16:27,080 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:27,080 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-10-25 23:16:27,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 23:16:27,080 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:27,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:27,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1167001578, now seen corresponding path program 1 times [2020-10-25 23:16:27,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:27,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013752503] [2020-10-25 23:16:27,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:27,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013752503] [2020-10-25 23:16:27,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:27,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:27,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202410380] [2020-10-25 23:16:27,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:27,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:27,127 INFO L87 Difference]: Start difference. First operand 2920 states and 4624 transitions. Second operand 4 states. [2020-10-25 23:16:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:27,569 INFO L93 Difference]: Finished difference Result 7421 states and 11813 transitions. [2020-10-25 23:16:27,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:27,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-10-25 23:16:27,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:27,589 INFO L225 Difference]: With dead ends: 7421 [2020-10-25 23:16:27,590 INFO L226 Difference]: Without dead ends: 3797 [2020-10-25 23:16:27,596 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-10-25 23:16:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2020-10-25 23:16:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3797. [2020-10-25 23:16:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2020-10-25 23:16:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 5990 transitions. [2020-10-25 23:16:27,879 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 5990 transitions. Word has length 48 [2020-10-25 23:16:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:27,879 INFO L481 AbstractCegarLoop]: Abstraction has 3797 states and 5990 transitions. [2020-10-25 23:16:27,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 5990 transitions. [2020-10-25 23:16:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-25 23:16:27,882 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:27,882 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-10-25 23:16:27,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 23:16:27,882 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:27,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1620471122, now seen corresponding path program 1 times [2020-10-25 23:16:27,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:27,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323613919] [2020-10-25 23:16:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:27,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323613919] [2020-10-25 23:16:27,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:27,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:16:27,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667004503] [2020-10-25 23:16:27,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:16:27,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:16:27,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:16:27,933 INFO L87 Difference]: Start difference. First operand 3797 states and 5990 transitions. Second operand 5 states. [2020-10-25 23:16:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:28,486 INFO L93 Difference]: Finished difference Result 9692 states and 15178 transitions. [2020-10-25 23:16:28,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 23:16:28,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-10-25 23:16:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:28,534 INFO L225 Difference]: With dead ends: 9692 [2020-10-25 23:16:28,534 INFO L226 Difference]: Without dead ends: 5918 [2020-10-25 23:16:28,541 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-10-25 23:16:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2020-10-25 23:16:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 4440. [2020-10-25 23:16:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4440 states. [2020-10-25 23:16:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6847 transitions. [2020-10-25 23:16:29,012 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6847 transitions. Word has length 53 [2020-10-25 23:16:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:29,013 INFO L481 AbstractCegarLoop]: Abstraction has 4440 states and 6847 transitions. [2020-10-25 23:16:29,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:16:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6847 transitions. [2020-10-25 23:16:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-25 23:16:29,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:29,018 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-10-25 23:16:29,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 23:16:29,018 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2101139439, now seen corresponding path program 1 times [2020-10-25 23:16:29,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:29,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630661165] [2020-10-25 23:16:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:29,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630661165] [2020-10-25 23:16:29,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:29,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:29,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006473955] [2020-10-25 23:16:29,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:29,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:29,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:29,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:29,069 INFO L87 Difference]: Start difference. First operand 4440 states and 6847 transitions. Second operand 3 states. [2020-10-25 23:16:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:29,487 INFO L93 Difference]: Finished difference Result 9203 states and 14160 transitions. [2020-10-25 23:16:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:29,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-10-25 23:16:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:29,497 INFO L225 Difference]: With dead ends: 9203 [2020-10-25 23:16:29,498 INFO L226 Difference]: Without dead ends: 4792 [2020-10-25 23:16:29,503 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-10-25 23:16:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2020-10-25 23:16:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4760. [2020-10-25 23:16:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4760 states. [2020-10-25 23:16:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 7096 transitions. [2020-10-25 23:16:29,872 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 7096 transitions. Word has length 85 [2020-10-25 23:16:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:29,872 INFO L481 AbstractCegarLoop]: Abstraction has 4760 states and 7096 transitions. [2020-10-25 23:16:29,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 7096 transitions. [2020-10-25 23:16:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-25 23:16:29,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:29,877 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-10-25 23:16:29,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 23:16:29,877 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:29,878 INFO L82 PathProgramCache]: Analyzing trace with hash 378663463, now seen corresponding path program 1 times [2020-10-25 23:16:29,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:29,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165795131] [2020-10-25 23:16:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:29,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165795131] [2020-10-25 23:16:29,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:29,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:29,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739023468] [2020-10-25 23:16:29,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:29,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:29,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:29,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:29,931 INFO L87 Difference]: Start difference. First operand 4760 states and 7096 transitions. Second operand 3 states. [2020-10-25 23:16:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:30,398 INFO L93 Difference]: Finished difference Result 10001 states and 14870 transitions. [2020-10-25 23:16:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:30,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-10-25 23:16:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:30,413 INFO L225 Difference]: With dead ends: 10001 [2020-10-25 23:16:30,414 INFO L226 Difference]: Without dead ends: 5282 [2020-10-25 23:16:30,421 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-10-25 23:16:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2020-10-25 23:16:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5234. [2020-10-25 23:16:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2020-10-25 23:16:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7539 transitions. [2020-10-25 23:16:30,816 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7539 transitions. Word has length 86 [2020-10-25 23:16:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:30,816 INFO L481 AbstractCegarLoop]: Abstraction has 5234 states and 7539 transitions. [2020-10-25 23:16:30,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7539 transitions. [2020-10-25 23:16:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-25 23:16:30,822 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:30,822 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-10-25 23:16:30,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 23:16:30,822 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2102863697, now seen corresponding path program 1 times [2020-10-25 23:16:30,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:30,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332636945] [2020-10-25 23:16:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:30,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332636945] [2020-10-25 23:16:30,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:30,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:30,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790420806] [2020-10-25 23:16:30,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:30,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:30,868 INFO L87 Difference]: Start difference. First operand 5234 states and 7539 transitions. Second operand 3 states. [2020-10-25 23:16:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:31,256 INFO L93 Difference]: Finished difference Result 10775 states and 15529 transitions. [2020-10-25 23:16:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:31,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-10-25 23:16:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:31,272 INFO L225 Difference]: With dead ends: 10775 [2020-10-25 23:16:31,272 INFO L226 Difference]: Without dead ends: 5602 [2020-10-25 23:16:31,280 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-10-25 23:16:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2020-10-25 23:16:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 5024. [2020-10-25 23:16:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5024 states. [2020-10-25 23:16:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5024 states to 5024 states and 6917 transitions. [2020-10-25 23:16:31,661 INFO L78 Accepts]: Start accepts. Automaton has 5024 states and 6917 transitions. Word has length 87 [2020-10-25 23:16:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:31,661 INFO L481 AbstractCegarLoop]: Abstraction has 5024 states and 6917 transitions. [2020-10-25 23:16:31,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5024 states and 6917 transitions. [2020-10-25 23:16:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-25 23:16:31,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:31,668 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-10-25 23:16:31,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 23:16:31,668 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:31,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1080949445, now seen corresponding path program 1 times [2020-10-25 23:16:31,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:31,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425858273] [2020-10-25 23:16:31,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 23:16:31,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425858273] [2020-10-25 23:16:31,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:31,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:31,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767272436] [2020-10-25 23:16:31,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:31,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:31,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:31,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:31,738 INFO L87 Difference]: Start difference. First operand 5024 states and 6917 transitions. Second operand 4 states. [2020-10-25 23:16:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:32,469 INFO L93 Difference]: Finished difference Result 9412 states and 12909 transitions. [2020-10-25 23:16:32,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:32,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-10-25 23:16:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:32,481 INFO L225 Difference]: With dead ends: 9412 [2020-10-25 23:16:32,482 INFO L226 Difference]: Without dead ends: 4839 [2020-10-25 23:16:32,489 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-10-25 23:16:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2020-10-25 23:16:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4725. [2020-10-25 23:16:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2020-10-25 23:16:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 6299 transitions. [2020-10-25 23:16:32,938 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 6299 transitions. Word has length 88 [2020-10-25 23:16:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:32,939 INFO L481 AbstractCegarLoop]: Abstraction has 4725 states and 6299 transitions. [2020-10-25 23:16:32,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 6299 transitions. [2020-10-25 23:16:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-10-25 23:16:32,949 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:32,949 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-10-25 23:16:32,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 23:16:32,949 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:32,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:32,950 INFO L82 PathProgramCache]: Analyzing trace with hash -273115530, now seen corresponding path program 1 times [2020-10-25 23:16:32,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:32,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230670198] [2020-10-25 23:16:32,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 23:16:32,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230670198] [2020-10-25 23:16:32,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:33,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:33,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526450306] [2020-10-25 23:16:33,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:33,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:33,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:33,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:33,005 INFO L87 Difference]: Start difference. First operand 4725 states and 6299 transitions. Second operand 3 states. [2020-10-25 23:16:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:33,513 INFO L93 Difference]: Finished difference Result 9005 states and 11995 transitions. [2020-10-25 23:16:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:33,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-10-25 23:16:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:33,532 INFO L225 Difference]: With dead ends: 9005 [2020-10-25 23:16:33,532 INFO L226 Difference]: Without dead ends: 4671 [2020-10-25 23:16:33,538 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-10-25 23:16:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2020-10-25 23:16:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4671. [2020-10-25 23:16:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4671 states. [2020-10-25 23:16:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 6193 transitions. [2020-10-25 23:16:33,961 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 6193 transitions. Word has length 115 [2020-10-25 23:16:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:33,961 INFO L481 AbstractCegarLoop]: Abstraction has 4671 states and 6193 transitions. [2020-10-25 23:16:33,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 6193 transitions. [2020-10-25 23:16:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-10-25 23:16:33,974 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:33,974 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-10-25 23:16:33,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 23:16:33,975 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash -471932119, now seen corresponding path program 1 times [2020-10-25 23:16:33,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:33,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415213607] [2020-10-25 23:16:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 23:16:34,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415213607] [2020-10-25 23:16:34,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:34,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:34,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217040687] [2020-10-25 23:16:34,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:34,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:34,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:34,038 INFO L87 Difference]: Start difference. First operand 4671 states and 6193 transitions. Second operand 4 states. [2020-10-25 23:16:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:34,508 INFO L93 Difference]: Finished difference Result 8293 states and 11017 transitions. [2020-10-25 23:16:34,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:34,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2020-10-25 23:16:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:34,522 INFO L225 Difference]: With dead ends: 8293 [2020-10-25 23:16:34,522 INFO L226 Difference]: Without dead ends: 4591 [2020-10-25 23:16:34,528 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-10-25 23:16:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2020-10-25 23:16:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4589. [2020-10-25 23:16:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4589 states. [2020-10-25 23:16:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 5972 transitions. [2020-10-25 23:16:34,853 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 5972 transitions. Word has length 127 [2020-10-25 23:16:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:34,854 INFO L481 AbstractCegarLoop]: Abstraction has 4589 states and 5972 transitions. [2020-10-25 23:16:34,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 5972 transitions. [2020-10-25 23:16:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-25 23:16:34,865 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:34,865 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-10-25 23:16:34,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 23:16:34,866 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:34,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:34,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1801789853, now seen corresponding path program 1 times [2020-10-25 23:16:34,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:34,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419088528] [2020-10-25 23:16:34,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-25 23:16:34,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419088528] [2020-10-25 23:16:34,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:34,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:34,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457707089] [2020-10-25 23:16:34,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:34,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:34,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:34,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:34,915 INFO L87 Difference]: Start difference. First operand 4589 states and 5972 transitions. Second operand 3 states. [2020-10-25 23:16:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:35,267 INFO L93 Difference]: Finished difference Result 8791 states and 11432 transitions. [2020-10-25 23:16:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:35,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-10-25 23:16:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:35,276 INFO L225 Difference]: With dead ends: 8791 [2020-10-25 23:16:35,276 INFO L226 Difference]: Without dead ends: 4588 [2020-10-25 23:16:35,281 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-10-25 23:16:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2020-10-25 23:16:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 4548. [2020-10-25 23:16:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2020-10-25 23:16:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 5889 transitions. [2020-10-25 23:16:35,684 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 5889 transitions. Word has length 133 [2020-10-25 23:16:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:35,685 INFO L481 AbstractCegarLoop]: Abstraction has 4548 states and 5889 transitions. [2020-10-25 23:16:35,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 5889 transitions. [2020-10-25 23:16:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-25 23:16:35,694 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:35,695 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-10-25 23:16:35,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 23:16:35,695 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:35,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:35,696 INFO L82 PathProgramCache]: Analyzing trace with hash -142067203, now seen corresponding path program 1 times [2020-10-25 23:16:35,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:35,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56946] [2020-10-25 23:16:35,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-25 23:16:35,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56946] [2020-10-25 23:16:35,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:35,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:35,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138243291] [2020-10-25 23:16:35,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:35,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:35,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:35,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:35,746 INFO L87 Difference]: Start difference. First operand 4548 states and 5889 transitions. Second operand 3 states. [2020-10-25 23:16:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:36,060 INFO L93 Difference]: Finished difference Result 8730 states and 11293 transitions. [2020-10-25 23:16:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:36,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-10-25 23:16:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:36,067 INFO L225 Difference]: With dead ends: 8730 [2020-10-25 23:16:36,067 INFO L226 Difference]: Without dead ends: 4558 [2020-10-25 23:16:36,074 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-10-25 23:16:36,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2020-10-25 23:16:36,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 4518. [2020-10-25 23:16:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2020-10-25 23:16:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5818 transitions. [2020-10-25 23:16:36,644 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5818 transitions. Word has length 133 [2020-10-25 23:16:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:36,645 INFO L481 AbstractCegarLoop]: Abstraction has 4518 states and 5818 transitions. [2020-10-25 23:16:36,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5818 transitions. [2020-10-25 23:16:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-25 23:16:36,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:36,661 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-10-25 23:16:36,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 23:16:36,661 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:36,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1934957922, now seen corresponding path program 1 times [2020-10-25 23:16:36,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:36,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100365182] [2020-10-25 23:16:36,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-25 23:16:36,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100365182] [2020-10-25 23:16:36,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:36,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:36,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524579688] [2020-10-25 23:16:36,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:36,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:36,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:36,754 INFO L87 Difference]: Start difference. First operand 4518 states and 5818 transitions. Second operand 4 states. [2020-10-25 23:16:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:37,202 INFO L93 Difference]: Finished difference Result 7327 states and 9468 transitions. [2020-10-25 23:16:37,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:37,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-10-25 23:16:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:37,207 INFO L225 Difference]: With dead ends: 7327 [2020-10-25 23:16:37,207 INFO L226 Difference]: Without dead ends: 3182 [2020-10-25 23:16:37,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:16:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2020-10-25 23:16:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3180. [2020-10-25 23:16:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3180 states. [2020-10-25 23:16:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4000 transitions. [2020-10-25 23:16:37,604 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4000 transitions. Word has length 136 [2020-10-25 23:16:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:37,604 INFO L481 AbstractCegarLoop]: Abstraction has 3180 states and 4000 transitions. [2020-10-25 23:16:37,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4000 transitions. [2020-10-25 23:16:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-25 23:16:37,612 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:37,612 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-10-25 23:16:37,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 23:16:37,613 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash 133231117, now seen corresponding path program 1 times [2020-10-25 23:16:37,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:37,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328374183] [2020-10-25 23:16:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-25 23:16:37,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328374183] [2020-10-25 23:16:37,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:37,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:37,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754681484] [2020-10-25 23:16:37,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:37,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:37,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:37,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:37,685 INFO L87 Difference]: Start difference. First operand 3180 states and 4000 transitions. Second operand 4 states. [2020-10-25 23:16:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:37,929 INFO L93 Difference]: Finished difference Result 5150 states and 6486 transitions. [2020-10-25 23:16:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:37,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-10-25 23:16:37,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:37,931 INFO L225 Difference]: With dead ends: 5150 [2020-10-25 23:16:37,931 INFO L226 Difference]: Without dead ends: 2043 [2020-10-25 23:16:37,935 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-10-25 23:16:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2020-10-25 23:16:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2020-10-25 23:16:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2020-10-25 23:16:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2486 transitions. [2020-10-25 23:16:38,093 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2486 transitions. Word has length 136 [2020-10-25 23:16:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:38,093 INFO L481 AbstractCegarLoop]: Abstraction has 2041 states and 2486 transitions. [2020-10-25 23:16:38,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2486 transitions. [2020-10-25 23:16:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-10-25 23:16:38,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:38,097 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-10-25 23:16:38,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 23:16:38,097 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1652555523, now seen corresponding path program 1 times [2020-10-25 23:16:38,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:38,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329239494] [2020-10-25 23:16:38,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 23:16:38,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329239494] [2020-10-25 23:16:38,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:38,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:38,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667990610] [2020-10-25 23:16:38,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:38,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:38,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:38,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:38,172 INFO L87 Difference]: Start difference. First operand 2041 states and 2486 transitions. Second operand 3 states. [2020-10-25 23:16:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:38,333 INFO L93 Difference]: Finished difference Result 3699 states and 4535 transitions. [2020-10-25 23:16:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:38,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-10-25 23:16:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:38,336 INFO L225 Difference]: With dead ends: 3699 [2020-10-25 23:16:38,337 INFO L226 Difference]: Without dead ends: 1999 [2020-10-25 23:16:38,339 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-10-25 23:16:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2020-10-25 23:16:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1931. [2020-10-25 23:16:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2020-10-25 23:16:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2328 transitions. [2020-10-25 23:16:38,453 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2328 transitions. Word has length 175 [2020-10-25 23:16:38,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:38,453 INFO L481 AbstractCegarLoop]: Abstraction has 1931 states and 2328 transitions. [2020-10-25 23:16:38,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2328 transitions. [2020-10-25 23:16:38,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-10-25 23:16:38,455 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:38,455 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-10-25 23:16:38,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-25 23:16:38,456 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:38,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:38,457 INFO L82 PathProgramCache]: Analyzing trace with hash 919917832, now seen corresponding path program 1 times [2020-10-25 23:16:38,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:38,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479309454] [2020-10-25 23:16:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-25 23:16:38,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479309454] [2020-10-25 23:16:38,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:38,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:38,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879240196] [2020-10-25 23:16:38,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:38,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:38,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:38,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:38,516 INFO L87 Difference]: Start difference. First operand 1931 states and 2328 transitions. Second operand 3 states. [2020-10-25 23:16:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:38,742 INFO L93 Difference]: Finished difference Result 4154 states and 5043 transitions. [2020-10-25 23:16:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:38,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2020-10-25 23:16:38,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:38,746 INFO L225 Difference]: With dead ends: 4154 [2020-10-25 23:16:38,746 INFO L226 Difference]: Without dead ends: 2560 [2020-10-25 23:16:38,747 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-10-25 23:16:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2020-10-25 23:16:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2209. [2020-10-25 23:16:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2020-10-25 23:16:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2628 transitions. [2020-10-25 23:16:38,881 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2628 transitions. Word has length 181 [2020-10-25 23:16:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:38,881 INFO L481 AbstractCegarLoop]: Abstraction has 2209 states and 2628 transitions. [2020-10-25 23:16:38,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2628 transitions. [2020-10-25 23:16:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-25 23:16:38,884 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:38,884 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-10-25 23:16:38,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-25 23:16:38,885 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:38,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash 929862786, now seen corresponding path program 1 times [2020-10-25 23:16:38,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:38,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850269690] [2020-10-25 23:16:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:16:38,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:16:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:16:38,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:16:39,022 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:16:39,023 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:16:39,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-25 23:16:39,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:16:39 BoogieIcfgContainer [2020-10-25 23:16:39,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:16:39,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:16:39,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:16:39,309 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:16:39,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:16:22" (3/4) ... [2020-10-25 23:16:39,312 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:16:39,515 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:16:39,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:16:39,518 INFO L168 Benchmark]: Toolchain (without parser) took 19253.99 ms. Allocated memory was 44.0 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 20.7 MB in the beginning and 1.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 250.2 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:39,519 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 44.0 MB. Free memory is still 22.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:16:39,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.45 ms. Allocated memory is still 60.8 MB. Free memory was 45.8 MB in the beginning and 31.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:39,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.04 ms. Allocated memory is still 60.8 MB. Free memory was 31.6 MB in the beginning and 29.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:39,520 INFO L168 Benchmark]: Boogie Preprocessor took 97.84 ms. Allocated memory is still 60.8 MB. Free memory was 29.5 MB in the beginning and 43.1 MB in the end (delta: -13.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:39,520 INFO L168 Benchmark]: RCFGBuilder took 935.39 ms. Allocated memory is still 60.8 MB. Free memory was 43.1 MB in the beginning and 34.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:39,521 INFO L168 Benchmark]: TraceAbstraction took 17227.27 ms. Allocated memory was 60.8 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 34.3 MB in the beginning and 1.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 208.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:39,521 INFO L168 Benchmark]: Witness Printer took 207.42 ms. Allocated memory is still 1.8 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 36.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:39,523 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.22 ms. Allocated memory is still 44.0 MB. Free memory is still 22.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 649.45 ms. Allocated memory is still 60.8 MB. Free memory was 45.8 MB in the beginning and 31.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 95.04 ms. Allocated memory is still 60.8 MB. Free memory was 31.6 MB in the beginning and 29.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 97.84 ms. Allocated memory is still 60.8 MB. Free memory was 29.5 MB in the beginning and 43.1 MB in the end (delta: -13.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 935.39 ms. Allocated memory is still 60.8 MB. Free memory was 43.1 MB in the beginning and 34.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17227.27 ms. Allocated memory was 60.8 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 34.3 MB in the beginning and 1.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 208.1 MB. Max. memory is 16.1 GB. * Witness Printer took 207.42 ms. Allocated memory is still 1.8 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 36.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L396] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L475] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L484] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L493] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L502] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L507] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L512] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L517] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L129] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L174] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L219] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L540] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L567] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND TRUE (int )e_wl == 0 [L573] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L578] COND TRUE (int )e_wl == 1 [L579] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L595] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L596] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L604] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L605] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L613] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L614] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L622] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L627] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L632] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L637] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND TRUE (int )e_wl == 1 [L648] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L129] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L132] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L147] COND TRUE ! processed [L148] data += 1 [L149] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L150] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L151] COND TRUE (int )e_g == 1 [L152] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L159] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L174] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L177] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L192] COND TRUE ! processed [L193] data += 1 [L194] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L195] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L196] COND TRUE (int )e_g == 1 [L197] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L219] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L222] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L237] c_t = data [L238] c_req_up = 1 [L239] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L540] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L541] COND TRUE c != c_t [L542] c = c_t [L543] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L547] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] COND TRUE (int )e_c == 0 [L568] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L585] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L586] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L596] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L604] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L613] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L614] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L622] COND TRUE (int )e_c == 1 [L623] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L627] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L632] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L637] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND TRUE (int )e_c == 1 [L643] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L655] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L658] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L661] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L533] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L339] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L354] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND TRUE (int )r_st == 0 [L371] tmp___3 = __VERIFIER_nondet_int() [L373] COND TRUE \read(tmp___3) [L375] r_st = 1 [L251] d = c [L252] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L253] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L261] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L262] COND TRUE (int )e_e == 1 [L263] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L271] e_e = 2 [L272] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L3] __assert_fail("0", "toy2.cil.c", 3, "reach_error") VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.8s, OverallIterations: 32, TraceHistogramMax: 6, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6240 SDtfs, 7475 SDslu, 3708 SDs, 0 SdLazy, 663 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5234occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 4173 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2417 NumberOfCodeBlocks, 2417 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2202 ConstructedInterpolants, 0 QuantifiedInterpolants, 341936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 597/597 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...