/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/toy1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:12:56,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:12:56,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:12:56,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:12:56,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:12:56,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:12:56,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:12:56,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:12:56,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:12:56,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:12:56,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:12:56,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:12:56,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:12:56,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:12:56,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:12:56,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:12:56,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:12:56,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:12:56,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:12:56,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:12:56,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:12:56,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:12:56,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:12:56,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:12:56,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:12:56,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:12:56,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:12:56,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:12:56,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:12:56,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:12:56,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:12:56,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:12:56,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:12:56,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:12:56,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:12:56,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:12:56,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:12:56,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:12:56,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:12:56,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:12:56,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:12:56,976 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 07:12:57,033 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:12:57,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:12:57,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:12:57,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:12:57,038 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:12:57,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:12:57,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:12:57,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:12:57,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:12:57,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:12:57,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:12:57,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:12:57,041 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:12:57,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:12:57,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:12:57,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:12:57,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:12:57,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:12:57,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:12:57,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:12:57,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:12:57,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:12:57,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:12:57,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:12:57,043 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:12:57,043 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 [2020-12-22 07:12:57,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:12:57,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:12:57,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:12:57,481 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:12:57,482 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:12:57,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2020-12-22 07:12:57,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957354a5e/b47e53f728704e84bb592ecf7bfd642d/FLAGca352e0eb [2020-12-22 07:12:58,288 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:12:58,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2020-12-22 07:12:58,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957354a5e/b47e53f728704e84bb592ecf7bfd642d/FLAGca352e0eb [2020-12-22 07:12:58,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957354a5e/b47e53f728704e84bb592ecf7bfd642d [2020-12-22 07:12:58,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:12:58,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:12:58,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:12:58,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:12:58,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:12:58,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:12:58" (1/1) ... [2020-12-22 07:12:58,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6390f5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:58, skipping insertion in model container [2020-12-22 07:12:58,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:12:58" (1/1) ... [2020-12-22 07:12:58,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:12:58,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:12:58,819 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c[393,406] [2020-12-22 07:12:58,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:12:58,989 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:12:59,004 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c[393,406] [2020-12-22 07:12:59,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:12:59,067 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:12:59,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59 WrapperNode [2020-12-22 07:12:59,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:12:59,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:12:59,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:12:59,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:12:59,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:12:59,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:12:59,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:12:59,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:12:59,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:12:59,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:12:59,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:12:59,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:12:59,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (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-12-22 07:12:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:12:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:12:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:12:59,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:13:00,194 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:13:00,195 INFO L299 CfgBuilder]: Removed 28 assume(true) statements. [2020-12-22 07:13:00,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:13:00 BoogieIcfgContainer [2020-12-22 07:13:00,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:13:00,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:13:00,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:13:00,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:13:00,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:12:58" (1/3) ... [2020-12-22 07:13:00,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e9d7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:13:00, skipping insertion in model container [2020-12-22 07:13:00,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (2/3) ... [2020-12-22 07:13:00,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e9d7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:13:00, skipping insertion in model container [2020-12-22 07:13:00,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:13:00" (3/3) ... [2020-12-22 07:13:00,218 INFO L111 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2020-12-22 07:13:00,226 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:13:00,232 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 07:13:00,254 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-22 07:13:00,291 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:13:00,291 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:13:00,292 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:13:00,292 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:13:00,292 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:13:00,292 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:13:00,292 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:13:00,292 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:13:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2020-12-22 07:13:00,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:00,322 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:00,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:00,324 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:00,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash -895778166, now seen corresponding path program 1 times [2020-12-22 07:13:00,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:00,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295138273] [2020-12-22 07:13:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:00,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295138273] [2020-12-22 07:13:00,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:00,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:00,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862592376] [2020-12-22 07:13:00,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:00,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:00,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:00,646 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2020-12-22 07:13:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:00,745 INFO L93 Difference]: Finished difference Result 250 states and 461 transitions. [2020-12-22 07:13:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:00,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-22 07:13:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:00,776 INFO L225 Difference]: With dead ends: 250 [2020-12-22 07:13:00,776 INFO L226 Difference]: Without dead ends: 125 [2020-12-22 07:13:00,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-22 07:13:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-12-22 07:13:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-22 07:13:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2020-12-22 07:13:00,860 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 218 transitions. Word has length 36 [2020-12-22 07:13:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:00,861 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 218 transitions. [2020-12-22 07:13:00,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 218 transitions. [2020-12-22 07:13:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:00,866 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:00,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:00,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:13:00,869 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:00,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:00,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1597378040, now seen corresponding path program 1 times [2020-12-22 07:13:00,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:00,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278086360] [2020-12-22 07:13:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:01,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278086360] [2020-12-22 07:13:01,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:01,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:01,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212076395] [2020-12-22 07:13:01,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:01,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:01,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:01,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:01,042 INFO L87 Difference]: Start difference. First operand 125 states and 218 transitions. Second operand 4 states. [2020-12-22 07:13:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:01,150 INFO L93 Difference]: Finished difference Result 337 states and 586 transitions. [2020-12-22 07:13:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:13:01,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-22 07:13:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:01,158 INFO L225 Difference]: With dead ends: 337 [2020-12-22 07:13:01,158 INFO L226 Difference]: Without dead ends: 215 [2020-12-22 07:13:01,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-12-22 07:13:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2020-12-22 07:13:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-22 07:13:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 366 transitions. [2020-12-22 07:13:01,217 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 366 transitions. Word has length 36 [2020-12-22 07:13:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:01,218 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 366 transitions. [2020-12-22 07:13:01,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 366 transitions. [2020-12-22 07:13:01,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:01,220 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:01,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:01,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:13:01,221 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash -211174646, now seen corresponding path program 1 times [2020-12-22 07:13:01,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:01,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155953352] [2020-12-22 07:13:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:01,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155953352] [2020-12-22 07:13:01,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:01,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:01,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796689892] [2020-12-22 07:13:01,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:01,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:01,336 INFO L87 Difference]: Start difference. First operand 210 states and 366 transitions. Second operand 3 states. [2020-12-22 07:13:01,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:01,435 INFO L93 Difference]: Finished difference Result 411 states and 719 transitions. [2020-12-22 07:13:01,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:01,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-22 07:13:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:01,438 INFO L225 Difference]: With dead ends: 411 [2020-12-22 07:13:01,438 INFO L226 Difference]: Without dead ends: 210 [2020-12-22 07:13:01,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-12-22 07:13:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2020-12-22 07:13:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-22 07:13:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 354 transitions. [2020-12-22 07:13:01,473 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 354 transitions. Word has length 36 [2020-12-22 07:13:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:01,478 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 354 transitions. [2020-12-22 07:13:01,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 354 transitions. [2020-12-22 07:13:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:01,482 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:01,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, 1] [2020-12-22 07:13:01,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 07:13:01,483 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:01,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:01,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1741716090, now seen corresponding path program 1 times [2020-12-22 07:13:01,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:01,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634285703] [2020-12-22 07:13:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:01,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634285703] [2020-12-22 07:13:01,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:01,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:01,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225067846] [2020-12-22 07:13:01,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:01,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:01,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:01,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:01,578 INFO L87 Difference]: Start difference. First operand 210 states and 354 transitions. Second operand 4 states. [2020-12-22 07:13:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:01,739 INFO L93 Difference]: Finished difference Result 571 states and 965 transitions. [2020-12-22 07:13:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:01,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-22 07:13:01,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:01,743 INFO L225 Difference]: With dead ends: 571 [2020-12-22 07:13:01,743 INFO L226 Difference]: Without dead ends: 371 [2020-12-22 07:13:01,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-12-22 07:13:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 210. [2020-12-22 07:13:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-22 07:13:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2020-12-22 07:13:01,761 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 36 [2020-12-22 07:13:01,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:01,762 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2020-12-22 07:13:01,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2020-12-22 07:13:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:01,764 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:01,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:01,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 07:13:01,764 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:01,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 181511944, now seen corresponding path program 1 times [2020-12-22 07:13:01,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:01,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954546259] [2020-12-22 07:13:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:01,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954546259] [2020-12-22 07:13:01,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:01,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:01,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453211281] [2020-12-22 07:13:01,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:01,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:01,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:01,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:01,808 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 4 states. [2020-12-22 07:13:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:01,900 INFO L93 Difference]: Finished difference Result 574 states and 961 transitions. [2020-12-22 07:13:01,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:01,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-22 07:13:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:01,903 INFO L225 Difference]: With dead ends: 574 [2020-12-22 07:13:01,903 INFO L226 Difference]: Without dead ends: 375 [2020-12-22 07:13:01,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-12-22 07:13:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 210. [2020-12-22 07:13:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-22 07:13:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2020-12-22 07:13:01,919 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 36 [2020-12-22 07:13:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:01,920 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2020-12-22 07:13:01,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2020-12-22 07:13:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:01,921 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:01,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:01,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 07:13:01,922 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:01,922 INFO L82 PathProgramCache]: Analyzing trace with hash 243551558, now seen corresponding path program 1 times [2020-12-22 07:13:01,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:01,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233638039] [2020-12-22 07:13:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:01,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233638039] [2020-12-22 07:13:01,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:01,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:01,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815761656] [2020-12-22 07:13:01,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:01,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:01,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:01,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:01,963 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 4 states. [2020-12-22 07:13:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,051 INFO L93 Difference]: Finished difference Result 586 states and 972 transitions. [2020-12-22 07:13:02,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:02,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-22 07:13:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,054 INFO L225 Difference]: With dead ends: 586 [2020-12-22 07:13:02,054 INFO L226 Difference]: Without dead ends: 388 [2020-12-22 07:13:02,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-22 07:13:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 216. [2020-12-22 07:13:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-12-22 07:13:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 352 transitions. [2020-12-22 07:13:02,069 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 352 transitions. Word has length 36 [2020-12-22 07:13:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:02,070 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 352 transitions. [2020-12-22 07:13:02,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 352 transitions. [2020-12-22 07:13:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:02,071 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:02,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:02,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 07:13:02,071 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash 384100168, now seen corresponding path program 1 times [2020-12-22 07:13:02,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:02,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481267379] [2020-12-22 07:13:02,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:02,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481267379] [2020-12-22 07:13:02,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:02,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:02,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172497829] [2020-12-22 07:13:02,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:02,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:02,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:02,118 INFO L87 Difference]: Start difference. First operand 216 states and 352 transitions. Second operand 4 states. [2020-12-22 07:13:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,223 INFO L93 Difference]: Finished difference Result 737 states and 1201 transitions. [2020-12-22 07:13:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:02,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-22 07:13:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,227 INFO L225 Difference]: With dead ends: 737 [2020-12-22 07:13:02,228 INFO L226 Difference]: Without dead ends: 534 [2020-12-22 07:13:02,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-12-22 07:13:02,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 351. [2020-12-22 07:13:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-12-22 07:13:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 571 transitions. [2020-12-22 07:13:02,253 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 571 transitions. Word has length 36 [2020-12-22 07:13:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:02,253 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 571 transitions. [2020-12-22 07:13:02,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 571 transitions. [2020-12-22 07:13:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:02,254 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:02,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:02,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 07:13:02,255 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash 250086662, now seen corresponding path program 1 times [2020-12-22 07:13:02,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:02,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744241999] [2020-12-22 07:13:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:02,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744241999] [2020-12-22 07:13:02,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:02,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:02,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411873208] [2020-12-22 07:13:02,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:02,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:02,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:02,291 INFO L87 Difference]: Start difference. First operand 351 states and 571 transitions. Second operand 3 states. [2020-12-22 07:13:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,342 INFO L93 Difference]: Finished difference Result 838 states and 1368 transitions. [2020-12-22 07:13:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:02,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-22 07:13:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,346 INFO L225 Difference]: With dead ends: 838 [2020-12-22 07:13:02,346 INFO L226 Difference]: Without dead ends: 511 [2020-12-22 07:13:02,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-12-22 07:13:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2020-12-22 07:13:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-22 07:13:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 825 transitions. [2020-12-22 07:13:02,394 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 825 transitions. Word has length 36 [2020-12-22 07:13:02,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:02,395 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 825 transitions. [2020-12-22 07:13:02,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 825 transitions. [2020-12-22 07:13:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:02,396 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:02,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:02,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:13:02,396 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1539792002, now seen corresponding path program 1 times [2020-12-22 07:13:02,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:02,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203579123] [2020-12-22 07:13:02,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:02,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203579123] [2020-12-22 07:13:02,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:02,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:02,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176725463] [2020-12-22 07:13:02,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:02,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:02,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:02,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:02,433 INFO L87 Difference]: Start difference. First operand 507 states and 825 transitions. Second operand 4 states. [2020-12-22 07:13:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,533 INFO L93 Difference]: Finished difference Result 1293 states and 2104 transitions. [2020-12-22 07:13:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:13:02,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-22 07:13:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,539 INFO L225 Difference]: With dead ends: 1293 [2020-12-22 07:13:02,539 INFO L226 Difference]: Without dead ends: 803 [2020-12-22 07:13:02,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2020-12-22 07:13:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 507. [2020-12-22 07:13:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-22 07:13:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 817 transitions. [2020-12-22 07:13:02,575 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 817 transitions. Word has length 36 [2020-12-22 07:13:02,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:02,576 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 817 transitions. [2020-12-22 07:13:02,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 817 transitions. [2020-12-22 07:13:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:02,577 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:02,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:02,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 07:13:02,577 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:02,578 INFO L82 PathProgramCache]: Analyzing trace with hash -48555900, now seen corresponding path program 1 times [2020-12-22 07:13:02,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:02,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008304557] [2020-12-22 07:13:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:02,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:02,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008304557] [2020-12-22 07:13:02,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:02,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:02,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415681077] [2020-12-22 07:13:02,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:02,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:02,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:02,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:02,615 INFO L87 Difference]: Start difference. First operand 507 states and 817 transitions. Second operand 4 states. [2020-12-22 07:13:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,747 INFO L93 Difference]: Finished difference Result 1289 states and 2077 transitions. [2020-12-22 07:13:02,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:13:02,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-22 07:13:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,757 INFO L225 Difference]: With dead ends: 1289 [2020-12-22 07:13:02,757 INFO L226 Difference]: Without dead ends: 805 [2020-12-22 07:13:02,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-12-22 07:13:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 507. [2020-12-22 07:13:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-22 07:13:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 809 transitions. [2020-12-22 07:13:02,798 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 809 transitions. Word has length 36 [2020-12-22 07:13:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:02,798 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 809 transitions. [2020-12-22 07:13:02,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 809 transitions. [2020-12-22 07:13:02,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:02,799 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:02,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:02,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 07:13:02,800 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:02,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:02,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1328419578, now seen corresponding path program 1 times [2020-12-22 07:13:02,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:02,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605951810] [2020-12-22 07:13:02,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:02,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605951810] [2020-12-22 07:13:02,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:02,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:02,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912496873] [2020-12-22 07:13:02,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:02,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:02,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:02,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:02,835 INFO L87 Difference]: Start difference. First operand 507 states and 809 transitions. Second operand 4 states. [2020-12-22 07:13:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,966 INFO L93 Difference]: Finished difference Result 1226 states and 1951 transitions. [2020-12-22 07:13:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:13:02,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-22 07:13:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,971 INFO L225 Difference]: With dead ends: 1226 [2020-12-22 07:13:02,971 INFO L226 Difference]: Without dead ends: 736 [2020-12-22 07:13:02,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2020-12-22 07:13:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 555. [2020-12-22 07:13:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-12-22 07:13:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 866 transitions. [2020-12-22 07:13:03,015 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 866 transitions. Word has length 36 [2020-12-22 07:13:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:03,015 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 866 transitions. [2020-12-22 07:13:03,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 866 transitions. [2020-12-22 07:13:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:13:03,016 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:03,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:03,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 07:13:03,017 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1915225592, now seen corresponding path program 1 times [2020-12-22 07:13:03,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:03,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907119199] [2020-12-22 07:13:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:03,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907119199] [2020-12-22 07:13:03,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:03,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:03,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669352213] [2020-12-22 07:13:03,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:03,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:03,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:03,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,071 INFO L87 Difference]: Start difference. First operand 555 states and 866 transitions. Second operand 3 states. [2020-12-22 07:13:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:03,159 INFO L93 Difference]: Finished difference Result 1316 states and 2058 transitions. [2020-12-22 07:13:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:03,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-22 07:13:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:03,164 INFO L225 Difference]: With dead ends: 1316 [2020-12-22 07:13:03,165 INFO L226 Difference]: Without dead ends: 775 [2020-12-22 07:13:03,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-12-22 07:13:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 772. [2020-12-22 07:13:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-12-22 07:13:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1190 transitions. [2020-12-22 07:13:03,218 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1190 transitions. Word has length 36 [2020-12-22 07:13:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:03,218 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1190 transitions. [2020-12-22 07:13:03,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1190 transitions. [2020-12-22 07:13:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-22 07:13:03,219 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:03,220 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:03,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 07:13:03,220 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash -547155332, now seen corresponding path program 1 times [2020-12-22 07:13:03,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:03,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121760798] [2020-12-22 07:13:03,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:03,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121760798] [2020-12-22 07:13:03,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:03,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:03,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785604462] [2020-12-22 07:13:03,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:03,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:03,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:03,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,252 INFO L87 Difference]: Start difference. First operand 772 states and 1190 transitions. Second operand 3 states. [2020-12-22 07:13:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:03,341 INFO L93 Difference]: Finished difference Result 1906 states and 2978 transitions. [2020-12-22 07:13:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:03,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-22 07:13:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:03,348 INFO L225 Difference]: With dead ends: 1906 [2020-12-22 07:13:03,348 INFO L226 Difference]: Without dead ends: 1161 [2020-12-22 07:13:03,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-12-22 07:13:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1157. [2020-12-22 07:13:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2020-12-22 07:13:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1801 transitions. [2020-12-22 07:13:03,444 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1801 transitions. Word has length 46 [2020-12-22 07:13:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:03,444 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1801 transitions. [2020-12-22 07:13:03,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1801 transitions. [2020-12-22 07:13:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-22 07:13:03,446 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:03,446 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:03,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 07:13:03,446 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash -299008838, now seen corresponding path program 1 times [2020-12-22 07:13:03,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:03,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490818172] [2020-12-22 07:13:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 07:13:03,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490818172] [2020-12-22 07:13:03,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:03,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:03,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181589879] [2020-12-22 07:13:03,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:03,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:03,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:03,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,473 INFO L87 Difference]: Start difference. First operand 1157 states and 1801 transitions. Second operand 3 states. [2020-12-22 07:13:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:03,549 INFO L93 Difference]: Finished difference Result 2265 states and 3543 transitions. [2020-12-22 07:13:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:03,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-22 07:13:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:03,555 INFO L225 Difference]: With dead ends: 2265 [2020-12-22 07:13:03,555 INFO L226 Difference]: Without dead ends: 1135 [2020-12-22 07:13:03,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2020-12-22 07:13:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2020-12-22 07:13:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2020-12-22 07:13:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1774 transitions. [2020-12-22 07:13:03,630 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1774 transitions. Word has length 46 [2020-12-22 07:13:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:03,630 INFO L481 AbstractCegarLoop]: Abstraction has 1135 states and 1774 transitions. [2020-12-22 07:13:03,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1774 transitions. [2020-12-22 07:13:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-22 07:13:03,631 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:03,632 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:03,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 07:13:03,632 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:03,632 INFO L82 PathProgramCache]: Analyzing trace with hash -336670593, now seen corresponding path program 1 times [2020-12-22 07:13:03,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:03,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862154381] [2020-12-22 07:13:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:03,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862154381] [2020-12-22 07:13:03,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:03,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:03,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076328320] [2020-12-22 07:13:03,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:03,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:03,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:03,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,664 INFO L87 Difference]: Start difference. First operand 1135 states and 1774 transitions. Second operand 3 states. [2020-12-22 07:13:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:03,840 INFO L93 Difference]: Finished difference Result 2891 states and 4579 transitions. [2020-12-22 07:13:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:03,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-22 07:13:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:03,851 INFO L225 Difference]: With dead ends: 2891 [2020-12-22 07:13:03,851 INFO L226 Difference]: Without dead ends: 1783 [2020-12-22 07:13:03,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2020-12-22 07:13:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1779. [2020-12-22 07:13:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2020-12-22 07:13:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2808 transitions. [2020-12-22 07:13:03,996 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2808 transitions. Word has length 47 [2020-12-22 07:13:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:03,996 INFO L481 AbstractCegarLoop]: Abstraction has 1779 states and 2808 transitions. [2020-12-22 07:13:03,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2808 transitions. [2020-12-22 07:13:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-22 07:13:03,998 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:03,998 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:03,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 07:13:03,999 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1825522215, now seen corresponding path program 1 times [2020-12-22 07:13:04,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:04,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144643661] [2020-12-22 07:13:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:04,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144643661] [2020-12-22 07:13:04,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:04,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:04,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813963959] [2020-12-22 07:13:04,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:04,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:04,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:04,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:04,030 INFO L87 Difference]: Start difference. First operand 1779 states and 2808 transitions. Second operand 3 states. [2020-12-22 07:13:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:04,301 INFO L93 Difference]: Finished difference Result 4794 states and 7664 transitions. [2020-12-22 07:13:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:04,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-22 07:13:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:04,316 INFO L225 Difference]: With dead ends: 4794 [2020-12-22 07:13:04,316 INFO L226 Difference]: Without dead ends: 3044 [2020-12-22 07:13:04,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2020-12-22 07:13:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3040. [2020-12-22 07:13:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3040 states. [2020-12-22 07:13:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 4843 transitions. [2020-12-22 07:13:04,541 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 4843 transitions. Word has length 48 [2020-12-22 07:13:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:04,541 INFO L481 AbstractCegarLoop]: Abstraction has 3040 states and 4843 transitions. [2020-12-22 07:13:04,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 4843 transitions. [2020-12-22 07:13:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-22 07:13:04,543 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:04,543 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:04,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 07:13:04,544 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:04,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:04,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2073668709, now seen corresponding path program 1 times [2020-12-22 07:13:04,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:04,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713943765] [2020-12-22 07:13:04,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 07:13:04,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713943765] [2020-12-22 07:13:04,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:04,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:04,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042842183] [2020-12-22 07:13:04,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:04,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:04,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:04,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:04,579 INFO L87 Difference]: Start difference. First operand 3040 states and 4843 transitions. Second operand 3 states. [2020-12-22 07:13:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:04,800 INFO L93 Difference]: Finished difference Result 6029 states and 9627 transitions. [2020-12-22 07:13:04,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:04,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-22 07:13:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:04,816 INFO L225 Difference]: With dead ends: 6029 [2020-12-22 07:13:04,817 INFO L226 Difference]: Without dead ends: 3018 [2020-12-22 07:13:04,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-12-22 07:13:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2020-12-22 07:13:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-22 07:13:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4817 transitions. [2020-12-22 07:13:05,075 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4817 transitions. Word has length 48 [2020-12-22 07:13:05,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:05,075 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4817 transitions. [2020-12-22 07:13:05,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4817 transitions. [2020-12-22 07:13:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-22 07:13:05,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:05,078 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:05,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 07:13:05,078 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash 963117268, now seen corresponding path program 1 times [2020-12-22 07:13:05,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:05,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636840943] [2020-12-22 07:13:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:05,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636840943] [2020-12-22 07:13:05,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:05,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:05,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475720929] [2020-12-22 07:13:05,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:05,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:05,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:05,115 INFO L87 Difference]: Start difference. First operand 3018 states and 4817 transitions. Second operand 4 states. [2020-12-22 07:13:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:05,564 INFO L93 Difference]: Finished difference Result 7617 states and 12199 transitions. [2020-12-22 07:13:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:05,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-22 07:13:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:05,587 INFO L225 Difference]: With dead ends: 7617 [2020-12-22 07:13:05,587 INFO L226 Difference]: Without dead ends: 3895 [2020-12-22 07:13:05,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2020-12-22 07:13:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3895. [2020-12-22 07:13:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3895 states. [2020-12-22 07:13:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 6183 transitions. [2020-12-22 07:13:05,942 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 6183 transitions. Word has length 49 [2020-12-22 07:13:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:05,943 INFO L481 AbstractCegarLoop]: Abstraction has 3895 states and 6183 transitions. [2020-12-22 07:13:05,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 6183 transitions. [2020-12-22 07:13:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-22 07:13:05,946 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:05,946 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:05,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 07:13:05,946 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:05,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1671888881, now seen corresponding path program 1 times [2020-12-22 07:13:05,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:05,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753933960] [2020-12-22 07:13:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:06,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753933960] [2020-12-22 07:13:06,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:06,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:13:06,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389955859] [2020-12-22 07:13:06,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:13:06,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:06,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:13:06,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:06,007 INFO L87 Difference]: Start difference. First operand 3895 states and 6183 transitions. Second operand 5 states. [2020-12-22 07:13:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:06,574 INFO L93 Difference]: Finished difference Result 9940 states and 15662 transitions. [2020-12-22 07:13:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 07:13:06,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-12-22 07:13:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:06,638 INFO L225 Difference]: With dead ends: 9940 [2020-12-22 07:13:06,638 INFO L226 Difference]: Without dead ends: 6068 [2020-12-22 07:13:06,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:13:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-12-22 07:13:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 4554. [2020-12-22 07:13:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4554 states. [2020-12-22 07:13:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 7072 transitions. [2020-12-22 07:13:07,063 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 7072 transitions. Word has length 54 [2020-12-22 07:13:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:07,063 INFO L481 AbstractCegarLoop]: Abstraction has 4554 states and 7072 transitions. [2020-12-22 07:13:07,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:13:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 7072 transitions. [2020-12-22 07:13:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-22 07:13:07,075 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:07,076 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:07,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 07:13:07,076 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2128152978, now seen corresponding path program 1 times [2020-12-22 07:13:07,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:07,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384018932] [2020-12-22 07:13:07,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:07,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384018932] [2020-12-22 07:13:07,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:07,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:07,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922242054] [2020-12-22 07:13:07,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:07,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:07,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:07,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:07,187 INFO L87 Difference]: Start difference. First operand 4554 states and 7072 transitions. Second operand 3 states. [2020-12-22 07:13:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:07,578 INFO L93 Difference]: Finished difference Result 9431 states and 14610 transitions. [2020-12-22 07:13:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:07,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-22 07:13:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:07,593 INFO L225 Difference]: With dead ends: 9431 [2020-12-22 07:13:07,593 INFO L226 Difference]: Without dead ends: 4906 [2020-12-22 07:13:07,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:07,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2020-12-22 07:13:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4874. [2020-12-22 07:13:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4874 states. [2020-12-22 07:13:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 7321 transitions. [2020-12-22 07:13:08,093 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 7321 transitions. Word has length 86 [2020-12-22 07:13:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:08,094 INFO L481 AbstractCegarLoop]: Abstraction has 4874 states and 7321 transitions. [2020-12-22 07:13:08,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7321 transitions. [2020-12-22 07:13:08,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-22 07:13:08,099 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:08,100 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:08,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 07:13:08,100 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1520792899, now seen corresponding path program 1 times [2020-12-22 07:13:08,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:08,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249493085] [2020-12-22 07:13:08,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:08,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249493085] [2020-12-22 07:13:08,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:08,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:08,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35996183] [2020-12-22 07:13:08,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:08,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:08,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:08,151 INFO L87 Difference]: Start difference. First operand 4874 states and 7321 transitions. Second operand 3 states. [2020-12-22 07:13:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:08,617 INFO L93 Difference]: Finished difference Result 10229 states and 15320 transitions. [2020-12-22 07:13:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:08,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-22 07:13:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:08,631 INFO L225 Difference]: With dead ends: 10229 [2020-12-22 07:13:08,631 INFO L226 Difference]: Without dead ends: 5396 [2020-12-22 07:13:08,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2020-12-22 07:13:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5348. [2020-12-22 07:13:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5348 states. [2020-12-22 07:13:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7764 transitions. [2020-12-22 07:13:09,071 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7764 transitions. Word has length 87 [2020-12-22 07:13:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:09,071 INFO L481 AbstractCegarLoop]: Abstraction has 5348 states and 7764 transitions. [2020-12-22 07:13:09,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7764 transitions. [2020-12-22 07:13:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-22 07:13:09,078 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:09,078 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:09,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 07:13:09,078 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:09,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1973365524, now seen corresponding path program 1 times [2020-12-22 07:13:09,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:09,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902032941] [2020-12-22 07:13:09,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:09,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902032941] [2020-12-22 07:13:09,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:09,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:09,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16295267] [2020-12-22 07:13:09,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:09,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:09,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:09,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:09,164 INFO L87 Difference]: Start difference. First operand 5348 states and 7764 transitions. Second operand 3 states. [2020-12-22 07:13:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:09,551 INFO L93 Difference]: Finished difference Result 11003 states and 15979 transitions. [2020-12-22 07:13:09,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:09,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-12-22 07:13:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:09,566 INFO L225 Difference]: With dead ends: 11003 [2020-12-22 07:13:09,566 INFO L226 Difference]: Without dead ends: 5716 [2020-12-22 07:13:09,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2020-12-22 07:13:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5130. [2020-12-22 07:13:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5130 states. [2020-12-22 07:13:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5130 states to 5130 states and 7126 transitions. [2020-12-22 07:13:10,053 INFO L78 Accepts]: Start accepts. Automaton has 5130 states and 7126 transitions. Word has length 88 [2020-12-22 07:13:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:10,054 INFO L481 AbstractCegarLoop]: Abstraction has 5130 states and 7126 transitions. [2020-12-22 07:13:10,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5130 states and 7126 transitions. [2020-12-22 07:13:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-22 07:13:10,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:10,063 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:10,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-22 07:13:10,063 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash 663253701, now seen corresponding path program 1 times [2020-12-22 07:13:10,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:10,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515057230] [2020-12-22 07:13:10,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 07:13:10,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515057230] [2020-12-22 07:13:10,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:10,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:10,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34160047] [2020-12-22 07:13:10,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:10,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:10,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:10,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:10,141 INFO L87 Difference]: Start difference. First operand 5130 states and 7126 transitions. Second operand 4 states. [2020-12-22 07:13:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:11,001 INFO L93 Difference]: Finished difference Result 9554 states and 13184 transitions. [2020-12-22 07:13:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:11,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-12-22 07:13:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:11,015 INFO L225 Difference]: With dead ends: 9554 [2020-12-22 07:13:11,015 INFO L226 Difference]: Without dead ends: 4875 [2020-12-22 07:13:11,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2020-12-22 07:13:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4759. [2020-12-22 07:13:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4759 states. [2020-12-22 07:13:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6364 transitions. [2020-12-22 07:13:11,592 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6364 transitions. Word has length 89 [2020-12-22 07:13:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:11,593 INFO L481 AbstractCegarLoop]: Abstraction has 4759 states and 6364 transitions. [2020-12-22 07:13:11,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6364 transitions. [2020-12-22 07:13:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-22 07:13:11,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:11,607 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:11,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 07:13:11,607 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:11,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:11,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1690650567, now seen corresponding path program 1 times [2020-12-22 07:13:11,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:11,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827610833] [2020-12-22 07:13:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-22 07:13:11,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827610833] [2020-12-22 07:13:11,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:11,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:11,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180519636] [2020-12-22 07:13:11,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:11,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:11,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:11,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:11,664 INFO L87 Difference]: Start difference. First operand 4759 states and 6364 transitions. Second operand 3 states. [2020-12-22 07:13:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:12,166 INFO L93 Difference]: Finished difference Result 9073 states and 12125 transitions. [2020-12-22 07:13:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:12,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-22 07:13:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:12,179 INFO L225 Difference]: With dead ends: 9073 [2020-12-22 07:13:12,179 INFO L226 Difference]: Without dead ends: 4705 [2020-12-22 07:13:12,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2020-12-22 07:13:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 4705. [2020-12-22 07:13:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4705 states. [2020-12-22 07:13:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 6258 transitions. [2020-12-22 07:13:12,555 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 6258 transitions. Word has length 116 [2020-12-22 07:13:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:12,556 INFO L481 AbstractCegarLoop]: Abstraction has 4705 states and 6258 transitions. [2020-12-22 07:13:12,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 6258 transitions. [2020-12-22 07:13:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-22 07:13:12,568 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:12,568 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:12,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-22 07:13:12,569 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:12,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:12,569 INFO L82 PathProgramCache]: Analyzing trace with hash 762576065, now seen corresponding path program 1 times [2020-12-22 07:13:12,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:12,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808892861] [2020-12-22 07:13:12,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-22 07:13:12,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808892861] [2020-12-22 07:13:12,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:12,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:12,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891452395] [2020-12-22 07:13:12,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:12,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:12,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:12,623 INFO L87 Difference]: Start difference. First operand 4705 states and 6258 transitions. Second operand 4 states. [2020-12-22 07:13:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:13,112 INFO L93 Difference]: Finished difference Result 8363 states and 11148 transitions. [2020-12-22 07:13:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:13,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2020-12-22 07:13:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:13,125 INFO L225 Difference]: With dead ends: 8363 [2020-12-22 07:13:13,125 INFO L226 Difference]: Without dead ends: 4627 [2020-12-22 07:13:13,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2020-12-22 07:13:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4623. [2020-12-22 07:13:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4623 states. [2020-12-22 07:13:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6037 transitions. [2020-12-22 07:13:13,539 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6037 transitions. Word has length 128 [2020-12-22 07:13:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:13,540 INFO L481 AbstractCegarLoop]: Abstraction has 4623 states and 6037 transitions. [2020-12-22 07:13:13,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6037 transitions. [2020-12-22 07:13:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-22 07:13:13,549 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:13,549 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:13,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 07:13:13,550 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash 843157933, now seen corresponding path program 1 times [2020-12-22 07:13:13,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:13,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222191361] [2020-12-22 07:13:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-22 07:13:13,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222191361] [2020-12-22 07:13:13,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:13,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:13,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10247968] [2020-12-22 07:13:13,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:13,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:13,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:13,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:13,610 INFO L87 Difference]: Start difference. First operand 4623 states and 6037 transitions. Second operand 3 states. [2020-12-22 07:13:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:13,917 INFO L93 Difference]: Finished difference Result 8859 states and 11562 transitions. [2020-12-22 07:13:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:13,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-12-22 07:13:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:13,926 INFO L225 Difference]: With dead ends: 8859 [2020-12-22 07:13:13,927 INFO L226 Difference]: Without dead ends: 4622 [2020-12-22 07:13:13,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2020-12-22 07:13:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 4582. [2020-12-22 07:13:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4582 states. [2020-12-22 07:13:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 5954 transitions. [2020-12-22 07:13:14,299 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 5954 transitions. Word has length 134 [2020-12-22 07:13:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:14,300 INFO L481 AbstractCegarLoop]: Abstraction has 4582 states and 5954 transitions. [2020-12-22 07:13:14,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 5954 transitions. [2020-12-22 07:13:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-22 07:13:14,309 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:14,310 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:14,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-22 07:13:14,310 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash 713131341, now seen corresponding path program 1 times [2020-12-22 07:13:14,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:14,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622548670] [2020-12-22 07:13:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-22 07:13:14,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622548670] [2020-12-22 07:13:14,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:14,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:14,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163592658] [2020-12-22 07:13:14,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:14,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:14,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:14,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:14,360 INFO L87 Difference]: Start difference. First operand 4582 states and 5954 transitions. Second operand 3 states. [2020-12-22 07:13:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:14,658 INFO L93 Difference]: Finished difference Result 8798 states and 11423 transitions. [2020-12-22 07:13:14,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:14,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-12-22 07:13:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:14,670 INFO L225 Difference]: With dead ends: 8798 [2020-12-22 07:13:14,670 INFO L226 Difference]: Without dead ends: 4592 [2020-12-22 07:13:14,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2020-12-22 07:13:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 4552. [2020-12-22 07:13:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2020-12-22 07:13:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 5883 transitions. [2020-12-22 07:13:15,270 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 5883 transitions. Word has length 134 [2020-12-22 07:13:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:15,271 INFO L481 AbstractCegarLoop]: Abstraction has 4552 states and 5883 transitions. [2020-12-22 07:13:15,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 5883 transitions. [2020-12-22 07:13:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-22 07:13:15,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:15,287 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:15,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-22 07:13:15,287 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:15,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash -57826629, now seen corresponding path program 1 times [2020-12-22 07:13:15,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:15,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895567697] [2020-12-22 07:13:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-22 07:13:15,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895567697] [2020-12-22 07:13:15,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:15,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:15,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863687829] [2020-12-22 07:13:15,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:15,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:15,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:15,400 INFO L87 Difference]: Start difference. First operand 4552 states and 5883 transitions. Second operand 4 states. [2020-12-22 07:13:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:16,023 INFO L93 Difference]: Finished difference Result 7397 states and 9599 transitions. [2020-12-22 07:13:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:16,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-12-22 07:13:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:16,031 INFO L225 Difference]: With dead ends: 7397 [2020-12-22 07:13:16,031 INFO L226 Difference]: Without dead ends: 3218 [2020-12-22 07:13:16,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2020-12-22 07:13:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3214. [2020-12-22 07:13:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2020-12-22 07:13:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4065 transitions. [2020-12-22 07:13:16,429 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4065 transitions. Word has length 137 [2020-12-22 07:13:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:16,429 INFO L481 AbstractCegarLoop]: Abstraction has 3214 states and 4065 transitions. [2020-12-22 07:13:16,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4065 transitions. [2020-12-22 07:13:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-22 07:13:16,434 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:16,434 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:16,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-22 07:13:16,434 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash -76782736, now seen corresponding path program 1 times [2020-12-22 07:13:16,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:16,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100142371] [2020-12-22 07:13:16,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-22 07:13:16,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100142371] [2020-12-22 07:13:16,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:16,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:16,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137752258] [2020-12-22 07:13:16,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:16,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:16,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:16,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:16,489 INFO L87 Difference]: Start difference. First operand 3214 states and 4065 transitions. Second operand 4 states. [2020-12-22 07:13:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:16,705 INFO L93 Difference]: Finished difference Result 5216 states and 6609 transitions. [2020-12-22 07:13:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:16,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-12-22 07:13:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:16,708 INFO L225 Difference]: With dead ends: 5216 [2020-12-22 07:13:16,708 INFO L226 Difference]: Without dead ends: 2075 [2020-12-22 07:13:16,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2020-12-22 07:13:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2071. [2020-12-22 07:13:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-22 07:13:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2543 transitions. [2020-12-22 07:13:16,870 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2543 transitions. Word has length 137 [2020-12-22 07:13:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:16,870 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 2543 transitions. [2020-12-22 07:13:16,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2543 transitions. [2020-12-22 07:13:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-22 07:13:16,873 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:16,876 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:16,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-22 07:13:16,877 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:16,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:16,877 INFO L82 PathProgramCache]: Analyzing trace with hash 373327418, now seen corresponding path program 1 times [2020-12-22 07:13:16,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:16,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192222189] [2020-12-22 07:13:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-22 07:13:16,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192222189] [2020-12-22 07:13:16,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:16,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:16,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774031430] [2020-12-22 07:13:16,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:16,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:16,935 INFO L87 Difference]: Start difference. First operand 2071 states and 2543 transitions. Second operand 3 states. [2020-12-22 07:13:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:17,082 INFO L93 Difference]: Finished difference Result 3759 states and 4649 transitions. [2020-12-22 07:13:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:17,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-12-22 07:13:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:17,086 INFO L225 Difference]: With dead ends: 3759 [2020-12-22 07:13:17,086 INFO L226 Difference]: Without dead ends: 2029 [2020-12-22 07:13:17,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2020-12-22 07:13:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1941. [2020-12-22 07:13:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-12-22 07:13:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2345 transitions. [2020-12-22 07:13:17,310 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2345 transitions. Word has length 176 [2020-12-22 07:13:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:17,310 INFO L481 AbstractCegarLoop]: Abstraction has 1941 states and 2345 transitions. [2020-12-22 07:13:17,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2345 transitions. [2020-12-22 07:13:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-22 07:13:17,313 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:17,313 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:17,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-22 07:13:17,313 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1072981429, now seen corresponding path program 1 times [2020-12-22 07:13:17,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:17,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969574065] [2020-12-22 07:13:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-22 07:13:17,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969574065] [2020-12-22 07:13:17,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:17,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:17,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745145477] [2020-12-22 07:13:17,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:17,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:17,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:17,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:17,400 INFO L87 Difference]: Start difference. First operand 1941 states and 2345 transitions. Second operand 3 states. [2020-12-22 07:13:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:17,649 INFO L93 Difference]: Finished difference Result 4180 states and 5086 transitions. [2020-12-22 07:13:17,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:17,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-12-22 07:13:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:17,658 INFO L225 Difference]: With dead ends: 4180 [2020-12-22 07:13:17,658 INFO L226 Difference]: Without dead ends: 2576 [2020-12-22 07:13:17,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:17,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2020-12-22 07:13:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2219. [2020-12-22 07:13:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2020-12-22 07:13:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2645 transitions. [2020-12-22 07:13:17,833 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2645 transitions. Word has length 182 [2020-12-22 07:13:17,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:17,834 INFO L481 AbstractCegarLoop]: Abstraction has 2219 states and 2645 transitions. [2020-12-22 07:13:17,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2645 transitions. [2020-12-22 07:13:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-22 07:13:17,835 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:17,835 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:17,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-22 07:13:17,835 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:17,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1005799718, now seen corresponding path program 1 times [2020-12-22 07:13:17,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:17,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992884987] [2020-12-22 07:13:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-22 07:13:17,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992884987] [2020-12-22 07:13:17,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:17,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:17,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957907276] [2020-12-22 07:13:17,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:17,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:17,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:17,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:17,921 INFO L87 Difference]: Start difference. First operand 2219 states and 2645 transitions. Second operand 3 states. [2020-12-22 07:13:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:18,111 INFO L93 Difference]: Finished difference Result 3766 states and 4524 transitions. [2020-12-22 07:13:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:18,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-12-22 07:13:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:18,115 INFO L225 Difference]: With dead ends: 3766 [2020-12-22 07:13:18,115 INFO L226 Difference]: Without dead ends: 1882 [2020-12-22 07:13:18,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-12-22 07:13:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1803. [2020-12-22 07:13:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2020-12-22 07:13:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2119 transitions. [2020-12-22 07:13:18,304 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2119 transitions. Word has length 185 [2020-12-22 07:13:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:18,304 INFO L481 AbstractCegarLoop]: Abstraction has 1803 states and 2119 transitions. [2020-12-22 07:13:18,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:18,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2119 transitions. [2020-12-22 07:13:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-22 07:13:18,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:18,306 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:18,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-22 07:13:18,306 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1330592792, now seen corresponding path program 1 times [2020-12-22 07:13:18,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:18,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260601647] [2020-12-22 07:13:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-12-22 07:13:18,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260601647] [2020-12-22 07:13:18,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:18,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:18,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251259144] [2020-12-22 07:13:18,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:18,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:18,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:18,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:18,377 INFO L87 Difference]: Start difference. First operand 1803 states and 2119 transitions. Second operand 3 states. [2020-12-22 07:13:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:18,628 INFO L93 Difference]: Finished difference Result 1817 states and 2136 transitions. [2020-12-22 07:13:18,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:18,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-12-22 07:13:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:18,632 INFO L225 Difference]: With dead ends: 1817 [2020-12-22 07:13:18,632 INFO L226 Difference]: Without dead ends: 1815 [2020-12-22 07:13:18,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2020-12-22 07:13:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1807. [2020-12-22 07:13:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1807 states. [2020-12-22 07:13:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2123 transitions. [2020-12-22 07:13:18,853 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2123 transitions. Word has length 185 [2020-12-22 07:13:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:18,854 INFO L481 AbstractCegarLoop]: Abstraction has 1807 states and 2123 transitions. [2020-12-22 07:13:18,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2123 transitions. [2020-12-22 07:13:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-22 07:13:18,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:18,856 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:18,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-22 07:13:18,857 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1330591190, now seen corresponding path program 1 times [2020-12-22 07:13:18,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:18,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432590571] [2020-12-22 07:13:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-22 07:13:19,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432590571] [2020-12-22 07:13:19,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448729923] [2020-12-22 07:13:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:13:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:19,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-22 07:13:19,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:13:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-22 07:13:19,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:13:19,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-12-22 07:13:19,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221078096] [2020-12-22 07:13:19,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-22 07:13:19,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-22 07:13:19,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-12-22 07:13:19,811 INFO L87 Difference]: Start difference. First operand 1807 states and 2123 transitions. Second operand 19 states. [2020-12-22 07:13:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:21,271 INFO L93 Difference]: Finished difference Result 5673 states and 6674 transitions. [2020-12-22 07:13:21,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-22 07:13:21,271 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 185 [2020-12-22 07:13:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:21,286 INFO L225 Difference]: With dead ends: 5673 [2020-12-22 07:13:21,287 INFO L226 Difference]: Without dead ends: 4128 [2020-12-22 07:13:21,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2020-12-22 07:13:21,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2020-12-22 07:13:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 2487. [2020-12-22 07:13:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2020-12-22 07:13:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 2916 transitions. [2020-12-22 07:13:21,574 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 2916 transitions. Word has length 185 [2020-12-22 07:13:21,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:21,574 INFO L481 AbstractCegarLoop]: Abstraction has 2487 states and 2916 transitions. [2020-12-22 07:13:21,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-22 07:13:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 2916 transitions. [2020-12-22 07:13:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-22 07:13:21,577 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:21,578 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:21,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-12-22 07:13:21,794 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:21,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:21,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1701344696, now seen corresponding path program 1 times [2020-12-22 07:13:21,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:21,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748290466] [2020-12-22 07:13:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:13:21,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:13:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:13:21,864 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:13:21,990 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 07:13:21,990 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 07:13:21,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-22 07:13:22,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:13:22 BoogieIcfgContainer [2020-12-22 07:13:22,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:13:22,297 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:13:22,297 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:13:22,298 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:13:22,298 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:13:00" (3/4) ... [2020-12-22 07:13:22,301 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 07:13:22,622 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/toy1.cil.c-witness.graphml [2020-12-22 07:13:22,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:13:22,625 INFO L168 Benchmark]: Toolchain (without parser) took 24033.28 ms. Allocated memory was 170.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 144.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 844.8 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:22,626 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 170.9 MB. Free memory is still 141.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:13:22,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.91 ms. Allocated memory is still 170.9 MB. Free memory was 144.3 MB in the beginning and 129.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:22,627 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.61 ms. Allocated memory is still 170.9 MB. Free memory was 129.5 MB in the beginning and 127.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:22,628 INFO L168 Benchmark]: Boogie Preprocessor took 43.70 ms. Allocated memory is still 170.9 MB. Free memory was 127.3 MB in the beginning and 125.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:22,628 INFO L168 Benchmark]: RCFGBuilder took 1031.01 ms. Allocated memory is still 170.9 MB. Free memory was 125.2 MB in the beginning and 119.4 MB in the end (delta: 5.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:22,628 INFO L168 Benchmark]: TraceAbstraction took 22091.77 ms. Allocated memory was 170.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 118.9 MB in the beginning and 544.4 MB in the end (delta: -425.6 MB). Peak memory consumption was 799.2 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:22,629 INFO L168 Benchmark]: Witness Printer took 325.16 ms. Allocated memory is still 1.4 GB. Free memory was 544.4 MB in the beginning and 1.3 GB in the end (delta: -783.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:22,631 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.21 ms. Allocated memory is still 170.9 MB. Free memory is still 141.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 474.91 ms. Allocated memory is still 170.9 MB. Free memory was 144.3 MB in the beginning and 129.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 57.61 ms. Allocated memory is still 170.9 MB. Free memory was 129.5 MB in the beginning and 127.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.70 ms. Allocated memory is still 170.9 MB. Free memory was 127.3 MB in the beginning and 125.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1031.01 ms. Allocated memory is still 170.9 MB. Free memory was 125.2 MB in the beginning and 119.4 MB in the end (delta: 5.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22091.77 ms. Allocated memory was 170.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 118.9 MB in the beginning and 544.4 MB in the end (delta: -425.6 MB). Peak memory consumption was 799.2 MB. Max. memory is 8.0 GB. * Witness Printer took 325.16 ms. Allocated memory is still 1.4 GB. Free memory was 544.4 MB in the beginning and 1.3 GB in the end (delta: -783.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L408] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L444] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L449] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L454] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L459] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L464] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L469] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L487] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L496] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L505] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L514] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L519] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L524] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L529] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L534] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L539] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L545] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L300] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L141] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L152] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L154] c1_st = 2 [L155] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L186] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L197] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L199] c2_st = 2 [L200] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L231] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L242] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L244] wb_st = 2 [L245] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L381] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L303] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L306] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L309] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L312] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L563] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L564] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L569] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L574] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L579] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L584] COND TRUE (int )e_wl == 0 [L585] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L589] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L590] COND TRUE (int )e_wl == 1 [L591] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L607] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L608] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L616] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L617] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L625] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L626] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L634] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L639] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L644] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L649] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L654] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L659] COND TRUE (int )e_wl == 1 [L660] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L664] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L545] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L300] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L141] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L144] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L159] COND TRUE ! processed [L160] data += 1 [L161] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L162] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L163] COND TRUE (int )e_g == 1 [L164] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L171] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L152] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L154] c1_st = 2 [L155] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L186] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L189] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] COND TRUE ! processed [L205] data += 1 [L206] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L207] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L208] COND TRUE (int )e_g == 1 [L209] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L216] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L197] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L199] c2_st = 2 [L200] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L231] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L234] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L249] c_t = data [L250] c_req_up = 1 [L251] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L242] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L244] wb_st = 2 [L245] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L381] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L303] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L312] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L553] COND TRUE c != c_t [L554] c = c_t [L555] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L559] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L563] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L564] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L569] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L574] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L579] COND TRUE (int )e_c == 0 [L580] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L584] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L589] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L597] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L598] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L607] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L608] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L616] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L617] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L625] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L626] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L634] COND TRUE (int )e_c == 1 [L635] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L639] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L644] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L649] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L654] COND TRUE (int )e_c == 1 [L655] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L659] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L667] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L670] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L673] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L676] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L545] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L303] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L312] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L321] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L336] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L351] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L366] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L381] COND TRUE (int )r_st == 0 [L383] tmp___3 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___3) [L387] r_st = 1 [L263] d = c [L264] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L265] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L273] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L274] COND TRUE (int )e_e == 1 [L275] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L283] e_e = 2 [L284] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L298] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L300] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L114] COND TRUE d == t + 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L122] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L15] 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, 129 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.7s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7212 SDtfs, 9836 SDslu, 8474 SDs, 0 SdLazy, 1107 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5348occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 6041 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3190 NumberOfCodeBlocks, 3190 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2969 ConstructedInterpolants, 0 QuantifiedInterpolants, 737591 SizeOfPredicates, 6 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 35 InterpolantComputations, 33 PerfectInterpolantSequences, 914/1025 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...