java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/toy1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:10:51,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:10:51,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:10:51,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:10:51,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:10:51,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:10:51,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:10:51,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:10:51,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:10:51,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:10:51,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:10:51,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:10:51,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:10:51,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:10:51,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:10:51,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:10:51,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:10:51,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:10:51,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:10:51,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:10:51,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:10:51,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:10:51,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:10:51,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:10:51,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:10:51,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:10:51,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:10:51,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:10:51,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:10:51,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:10:51,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:10:51,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:10:51,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:10:51,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:10:51,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:10:51,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:10:51,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:10:51,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:10:51,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:10:51,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:10:51,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:10:51,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:10:51,420 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:10:51,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:10:51,421 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:10:51,421 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:10:51,422 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:10:51,422 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:10:51,422 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:10:51,422 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:10:51,423 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:10:51,423 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:10:51,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:10:51,424 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:10:51,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:10:51,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:10:51,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:10:51,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:10:51,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:10:51,425 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:10:51,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:10:51,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:10:51,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:10:51,426 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:10:51,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:10:51,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:10:51,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:10:51,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:10:51,427 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:10:51,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:10:51,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:10:51,427 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:10:51,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:10:51,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:10:51,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:10:51,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:10:51,488 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:10:51,489 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy1.cil.c [2019-10-03 04:10:51,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df90f28f0/5b6b93a53654405e883d3124600ab9be/FLAG80c0add81 [2019-10-03 04:10:52,014 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:10:52,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy1.cil.c [2019-10-03 04:10:52,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df90f28f0/5b6b93a53654405e883d3124600ab9be/FLAG80c0add81 [2019-10-03 04:10:52,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df90f28f0/5b6b93a53654405e883d3124600ab9be [2019-10-03 04:10:52,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:10:52,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:10:52,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:10:52,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:10:52,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:10:52,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:10:52" (1/1) ... [2019-10-03 04:10:52,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d1a8e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52, skipping insertion in model container [2019-10-03 04:10:52,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:10:52" (1/1) ... [2019-10-03 04:10:52,402 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:10:52,451 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:10:52,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:10:52,704 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:10:52,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:10:52,872 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:10:52,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52 WrapperNode [2019-10-03 04:10:52,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:10:52,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:10:52,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:10:52,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:10:52,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52" (1/1) ... [2019-10-03 04:10:52,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52" (1/1) ... [2019-10-03 04:10:52,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52" (1/1) ... [2019-10-03 04:10:52,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52" (1/1) ... [2019-10-03 04:10:52,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52" (1/1) ... [2019-10-03 04:10:52,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52" (1/1) ... [2019-10-03 04:10:52,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52" (1/1) ... [2019-10-03 04:10:52,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:10:52,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:10:52,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:10:52,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:10:52,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52" (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 [2019-10-03 04:10:52,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:10:52,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:10:52,991 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-03 04:10:52,991 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-10-03 04:10:52,991 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-10-03 04:10:52,991 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-10-03 04:10:52,991 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-10-03 04:10:52,992 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-10-03 04:10:52,992 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-03 04:10:52,992 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-03 04:10:52,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:10:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:10:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:10:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-03 04:10:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-10-03 04:10:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-10-03 04:10:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-10-03 04:10:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-10-03 04:10:52,994 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 04:10:52,994 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-03 04:10:52,994 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-03 04:10:52,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:10:52,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:10:52,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:10:53,639 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:10:53,640 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-03 04:10:53,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:10:53 BoogieIcfgContainer [2019-10-03 04:10:53,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:10:53,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:10:53,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:10:53,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:10:53,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:10:52" (1/3) ... [2019-10-03 04:10:53,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4f0d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:10:53, skipping insertion in model container [2019-10-03 04:10:53,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:52" (2/3) ... [2019-10-03 04:10:53,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4f0d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:10:53, skipping insertion in model container [2019-10-03 04:10:53,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:10:53" (3/3) ... [2019-10-03 04:10:53,649 INFO L109 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2019-10-03 04:10:53,659 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:10:53,667 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:10:53,683 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:10:53,710 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:10:53,710 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:10:53,710 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:10:53,711 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:10:53,711 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:10:53,711 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:10:53,711 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:10:53,712 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:10:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2019-10-03 04:10:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:53,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:53,748 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:53,750 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:53,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:53,756 INFO L82 PathProgramCache]: Analyzing trace with hash -854031758, now seen corresponding path program 1 times [2019-10-03 04:10:53,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:53,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:53,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:53,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:53,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:54,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:54,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:54,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:54,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:54,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:54,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:54,070 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 3 states. [2019-10-03 04:10:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:54,149 INFO L93 Difference]: Finished difference Result 159 states and 252 transitions. [2019-10-03 04:10:54,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:54,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 04:10:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:54,173 INFO L225 Difference]: With dead ends: 159 [2019-10-03 04:10:54,173 INFO L226 Difference]: Without dead ends: 152 [2019-10-03 04:10:54,176 INFO L640 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 [2019-10-03 04:10:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-03 04:10:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-03 04:10:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-03 04:10:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 245 transitions. [2019-10-03 04:10:54,244 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 245 transitions. Word has length 47 [2019-10-03 04:10:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:54,245 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 245 transitions. [2019-10-03 04:10:54,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 245 transitions. [2019-10-03 04:10:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:54,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:54,248 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:54,248 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash -459664972, now seen corresponding path program 1 times [2019-10-03 04:10:54,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:54,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:54,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:54,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:54,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:54,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:54,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:54,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:54,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:54,393 INFO L87 Difference]: Start difference. First operand 152 states and 245 transitions. Second operand 3 states. [2019-10-03 04:10:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:54,425 INFO L93 Difference]: Finished difference Result 152 states and 244 transitions. [2019-10-03 04:10:54,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:54,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 04:10:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:54,429 INFO L225 Difference]: With dead ends: 152 [2019-10-03 04:10:54,430 INFO L226 Difference]: Without dead ends: 152 [2019-10-03 04:10:54,431 INFO L640 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 [2019-10-03 04:10:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-03 04:10:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-03 04:10:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-03 04:10:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 244 transitions. [2019-10-03 04:10:54,452 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 244 transitions. Word has length 47 [2019-10-03 04:10:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:54,452 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 244 transitions. [2019-10-03 04:10:54,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 244 transitions. [2019-10-03 04:10:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:54,455 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:54,455 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:54,455 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:54,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:54,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1591319026, now seen corresponding path program 1 times [2019-10-03 04:10:54,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:54,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:54,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:54,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:54,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:54,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:54,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:54,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:54,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:54,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:54,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:54,602 INFO L87 Difference]: Start difference. First operand 152 states and 244 transitions. Second operand 4 states. [2019-10-03 04:10:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:54,781 INFO L93 Difference]: Finished difference Result 289 states and 463 transitions. [2019-10-03 04:10:54,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:54,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-03 04:10:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:54,788 INFO L225 Difference]: With dead ends: 289 [2019-10-03 04:10:54,788 INFO L226 Difference]: Without dead ends: 289 [2019-10-03 04:10:54,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-03 04:10:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2019-10-03 04:10:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-03 04:10:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 451 transitions. [2019-10-03 04:10:54,818 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 451 transitions. Word has length 47 [2019-10-03 04:10:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:54,819 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 451 transitions. [2019-10-03 04:10:54,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 451 transitions. [2019-10-03 04:10:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:54,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:54,824 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:54,825 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:54,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:54,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1541564722, now seen corresponding path program 1 times [2019-10-03 04:10:54,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:54,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:54,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:54,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:54,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:54,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:54,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:54,940 INFO L87 Difference]: Start difference. First operand 279 states and 451 transitions. Second operand 4 states. [2019-10-03 04:10:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:55,115 INFO L93 Difference]: Finished difference Result 482 states and 775 transitions. [2019-10-03 04:10:55,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:55,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-03 04:10:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:55,119 INFO L225 Difference]: With dead ends: 482 [2019-10-03 04:10:55,119 INFO L226 Difference]: Without dead ends: 482 [2019-10-03 04:10:55,120 INFO L640 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 [2019-10-03 04:10:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-03 04:10:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 472. [2019-10-03 04:10:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-03 04:10:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 763 transitions. [2019-10-03 04:10:55,151 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 763 transitions. Word has length 47 [2019-10-03 04:10:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:55,151 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 763 transitions. [2019-10-03 04:10:55,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 763 transitions. [2019-10-03 04:10:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:55,157 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:55,159 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:55,159 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:55,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:55,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1816324336, now seen corresponding path program 1 times [2019-10-03 04:10:55,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:55,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:55,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:55,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:55,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:55,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:55,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:55,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:55,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:55,228 INFO L87 Difference]: Start difference. First operand 472 states and 763 transitions. Second operand 4 states. [2019-10-03 04:10:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:55,389 INFO L93 Difference]: Finished difference Result 854 states and 1381 transitions. [2019-10-03 04:10:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:55,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-03 04:10:55,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:55,396 INFO L225 Difference]: With dead ends: 854 [2019-10-03 04:10:55,396 INFO L226 Difference]: Without dead ends: 854 [2019-10-03 04:10:55,397 INFO L640 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 [2019-10-03 04:10:55,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-10-03 04:10:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 836. [2019-10-03 04:10:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-10-03 04:10:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1357 transitions. [2019-10-03 04:10:55,441 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1357 transitions. Word has length 47 [2019-10-03 04:10:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:55,442 INFO L475 AbstractCegarLoop]: Abstraction has 836 states and 1357 transitions. [2019-10-03 04:10:55,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1357 transitions. [2019-10-03 04:10:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:55,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:55,445 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:55,445 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:55,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:55,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1777043086, now seen corresponding path program 1 times [2019-10-03 04:10:55,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:55,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:55,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:55,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:55,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:55,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:55,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:55,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:55,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:55,543 INFO L87 Difference]: Start difference. First operand 836 states and 1357 transitions. Second operand 3 states. [2019-10-03 04:10:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:55,596 INFO L93 Difference]: Finished difference Result 1377 states and 2203 transitions. [2019-10-03 04:10:55,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:55,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 04:10:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:55,605 INFO L225 Difference]: With dead ends: 1377 [2019-10-03 04:10:55,606 INFO L226 Difference]: Without dead ends: 1377 [2019-10-03 04:10:55,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2019-10-03 04:10:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1365. [2019-10-03 04:10:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-10-03 04:10:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2192 transitions. [2019-10-03 04:10:55,668 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2192 transitions. Word has length 47 [2019-10-03 04:10:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:55,672 INFO L475 AbstractCegarLoop]: Abstraction has 1365 states and 2192 transitions. [2019-10-03 04:10:55,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2192 transitions. [2019-10-03 04:10:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:55,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:55,683 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:55,683 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:55,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:55,683 INFO L82 PathProgramCache]: Analyzing trace with hash -390839692, now seen corresponding path program 1 times [2019-10-03 04:10:55,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:55,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:55,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:55,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:55,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:55,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:55,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:55,743 INFO L87 Difference]: Start difference. First operand 1365 states and 2192 transitions. Second operand 3 states. [2019-10-03 04:10:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:55,791 INFO L93 Difference]: Finished difference Result 1455 states and 2341 transitions. [2019-10-03 04:10:55,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:55,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 04:10:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:55,800 INFO L225 Difference]: With dead ends: 1455 [2019-10-03 04:10:55,800 INFO L226 Difference]: Without dead ends: 1455 [2019-10-03 04:10:55,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2019-10-03 04:10:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455. [2019-10-03 04:10:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-10-03 04:10:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2341 transitions. [2019-10-03 04:10:55,859 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2341 transitions. Word has length 47 [2019-10-03 04:10:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:55,860 INFO L475 AbstractCegarLoop]: Abstraction has 1455 states and 2341 transitions. [2019-10-03 04:10:55,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2341 transitions. [2019-10-03 04:10:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:55,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:55,863 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:55,863 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:55,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash 409745528, now seen corresponding path program 1 times [2019-10-03 04:10:55,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:55,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:55,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:55,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:55,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:55,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:55,922 INFO L87 Difference]: Start difference. First operand 1455 states and 2341 transitions. Second operand 4 states. [2019-10-03 04:10:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:56,076 INFO L93 Difference]: Finished difference Result 1647 states and 2607 transitions. [2019-10-03 04:10:56,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:56,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-03 04:10:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:56,085 INFO L225 Difference]: With dead ends: 1647 [2019-10-03 04:10:56,085 INFO L226 Difference]: Without dead ends: 1647 [2019-10-03 04:10:56,086 INFO L640 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 [2019-10-03 04:10:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2019-10-03 04:10:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1623. [2019-10-03 04:10:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-10-03 04:10:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2575 transitions. [2019-10-03 04:10:56,141 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2575 transitions. Word has length 47 [2019-10-03 04:10:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:56,141 INFO L475 AbstractCegarLoop]: Abstraction has 1623 states and 2575 transitions. [2019-10-03 04:10:56,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2575 transitions. [2019-10-03 04:10:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:56,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:56,143 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:56,144 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 628600246, now seen corresponding path program 1 times [2019-10-03 04:10:56,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:56,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:56,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:56,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:56,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:56,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:56,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:56,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:56,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:56,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:56,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:56,186 INFO L87 Difference]: Start difference. First operand 1623 states and 2575 transitions. Second operand 4 states. [2019-10-03 04:10:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:56,389 INFO L93 Difference]: Finished difference Result 1655 states and 2568 transitions. [2019-10-03 04:10:56,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:56,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-03 04:10:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:56,403 INFO L225 Difference]: With dead ends: 1655 [2019-10-03 04:10:56,403 INFO L226 Difference]: Without dead ends: 1655 [2019-10-03 04:10:56,405 INFO L640 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 [2019-10-03 04:10:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2019-10-03 04:10:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1623. [2019-10-03 04:10:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-10-03 04:10:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2525 transitions. [2019-10-03 04:10:56,498 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2525 transitions. Word has length 47 [2019-10-03 04:10:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:56,498 INFO L475 AbstractCegarLoop]: Abstraction has 1623 states and 2525 transitions. [2019-10-03 04:10:56,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2525 transitions. [2019-10-03 04:10:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:56,500 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:56,500 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:56,500 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:56,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1051302072, now seen corresponding path program 1 times [2019-10-03 04:10:56,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:56,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:56,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:56,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:56,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:56,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:56,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:56,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:56,567 INFO L87 Difference]: Start difference. First operand 1623 states and 2525 transitions. Second operand 4 states. [2019-10-03 04:10:56,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:56,759 INFO L93 Difference]: Finished difference Result 2000 states and 3071 transitions. [2019-10-03 04:10:56,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:56,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-03 04:10:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:56,770 INFO L225 Difference]: With dead ends: 2000 [2019-10-03 04:10:56,770 INFO L226 Difference]: Without dead ends: 2000 [2019-10-03 04:10:56,771 INFO L640 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 [2019-10-03 04:10:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2019-10-03 04:10:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1976. [2019-10-03 04:10:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-10-03 04:10:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 3048 transitions. [2019-10-03 04:10:56,837 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 3048 transitions. Word has length 47 [2019-10-03 04:10:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:56,837 INFO L475 AbstractCegarLoop]: Abstraction has 1976 states and 3048 transitions. [2019-10-03 04:10:56,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 3048 transitions. [2019-10-03 04:10:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:56,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:56,839 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:56,840 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:56,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:56,841 INFO L82 PathProgramCache]: Analyzing trace with hash 233653622, now seen corresponding path program 1 times [2019-10-03 04:10:56,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:56,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:56,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:56,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:56,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:56,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:56,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:56,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:56,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:56,895 INFO L87 Difference]: Start difference. First operand 1976 states and 3048 transitions. Second operand 3 states. [2019-10-03 04:10:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:56,933 INFO L93 Difference]: Finished difference Result 2212 states and 3347 transitions. [2019-10-03 04:10:56,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:56,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 04:10:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:56,945 INFO L225 Difference]: With dead ends: 2212 [2019-10-03 04:10:56,945 INFO L226 Difference]: Without dead ends: 2212 [2019-10-03 04:10:56,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2019-10-03 04:10:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2212. [2019-10-03 04:10:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2212 states. [2019-10-03 04:10:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 3347 transitions. [2019-10-03 04:10:57,018 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 3347 transitions. Word has length 47 [2019-10-03 04:10:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:57,019 INFO L475 AbstractCegarLoop]: Abstraction has 2212 states and 3347 transitions. [2019-10-03 04:10:57,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 3347 transitions. [2019-10-03 04:10:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:10:57,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:57,020 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:57,021 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1760491084, now seen corresponding path program 1 times [2019-10-03 04:10:57,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:57,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:57,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:57,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:57,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:57,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:57,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:57,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:57,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:57,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:57,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:57,063 INFO L87 Difference]: Start difference. First operand 2212 states and 3347 transitions. Second operand 3 states. [2019-10-03 04:10:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:57,126 INFO L93 Difference]: Finished difference Result 2939 states and 4462 transitions. [2019-10-03 04:10:57,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:57,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 04:10:57,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:57,145 INFO L225 Difference]: With dead ends: 2939 [2019-10-03 04:10:57,146 INFO L226 Difference]: Without dead ends: 2939 [2019-10-03 04:10:57,147 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2019-10-03 04:10:57,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2867. [2019-10-03 04:10:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2867 states. [2019-10-03 04:10:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2867 states and 4350 transitions. [2019-10-03 04:10:57,259 INFO L78 Accepts]: Start accepts. Automaton has 2867 states and 4350 transitions. Word has length 47 [2019-10-03 04:10:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:57,259 INFO L475 AbstractCegarLoop]: Abstraction has 2867 states and 4350 transitions. [2019-10-03 04:10:57,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 4350 transitions. [2019-10-03 04:10:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 04:10:57,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:57,264 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 04:10:57,264 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:57,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:57,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1060036737, now seen corresponding path program 1 times [2019-10-03 04:10:57,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:57,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:57,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:57,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:57,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:57,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:57,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:57,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:57,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:57,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:57,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:57,325 INFO L87 Difference]: Start difference. First operand 2867 states and 4350 transitions. Second operand 5 states. [2019-10-03 04:10:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:57,820 INFO L93 Difference]: Finished difference Result 5650 states and 8869 transitions. [2019-10-03 04:10:57,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 04:10:57,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-03 04:10:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:57,850 INFO L225 Difference]: With dead ends: 5650 [2019-10-03 04:10:57,851 INFO L226 Difference]: Without dead ends: 5650 [2019-10-03 04:10:57,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 04:10:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2019-10-03 04:10:57,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 5276. [2019-10-03 04:10:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5276 states. [2019-10-03 04:10:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 8280 transitions. [2019-10-03 04:10:58,010 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 8280 transitions. Word has length 67 [2019-10-03 04:10:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:58,011 INFO L475 AbstractCegarLoop]: Abstraction has 5276 states and 8280 transitions. [2019-10-03 04:10:58,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 8280 transitions. [2019-10-03 04:10:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 04:10:58,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:58,017 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:10:58,018 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1168897503, now seen corresponding path program 1 times [2019-10-03 04:10:58,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:58,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:58,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 04:10:58,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:58,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:58,116 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-10-03 04:10:58,119 INFO L207 CegarAbsIntRunner]: [54], [58], [106], [107], [153], [162], [166], [192], [195], [214], [227], [240], [253], [259], [262], [264], [267], [269], [272], [276], [285], [287], [298], [310], [312], [314], [317], [331], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [693], [695], [696], [707], [709], [711], [712], [713] [2019-10-03 04:10:58,174 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:58,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:58,399 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:10:58,401 INFO L272 AbstractInterpreter]: Visited 46 different actions 46 times. Never merged. Never widened. Performed 266 root evaluator evaluations with a maximum evaluation depth of 3. Performed 266 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2019-10-03 04:10:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:58,406 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:10:58,601 INFO L227 lantSequenceWeakener]: Weakened 60 states. On average, predicates are now at 83.36% of their original sizes. [2019-10-03 04:10:58,601 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:10:59,115 INFO L420 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2019-10-03 04:10:59,115 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:10:59,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:59,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [7] total 28 [2019-10-03 04:10:59,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:59,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 04:10:59,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 04:10:59,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-10-03 04:10:59,118 INFO L87 Difference]: Start difference. First operand 5276 states and 8280 transitions. Second operand 23 states. [2019-10-03 04:11:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:04,752 INFO L93 Difference]: Finished difference Result 5369 states and 8427 transitions. [2019-10-03 04:11:04,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 04:11:04,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2019-10-03 04:11:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:04,789 INFO L225 Difference]: With dead ends: 5369 [2019-10-03 04:11:04,790 INFO L226 Difference]: Without dead ends: 5369 [2019-10-03 04:11:04,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2019-10-03 04:11:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5369 states. [2019-10-03 04:11:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5369 to 5354. [2019-10-03 04:11:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5354 states. [2019-10-03 04:11:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5354 states to 5354 states and 8410 transitions. [2019-10-03 04:11:04,938 INFO L78 Accepts]: Start accepts. Automaton has 5354 states and 8410 transitions. Word has length 81 [2019-10-03 04:11:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:04,939 INFO L475 AbstractCegarLoop]: Abstraction has 5354 states and 8410 transitions. [2019-10-03 04:11:04,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 04:11:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 5354 states and 8410 transitions. [2019-10-03 04:11:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 04:11:04,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:04,943 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:11:04,944 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:04,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1495380737, now seen corresponding path program 1 times [2019-10-03 04:11:04,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:04,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:04,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:04,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:04,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 04:11:05,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:05,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:05,015 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2019-10-03 04:11:05,016 INFO L207 CegarAbsIntRunner]: [54], [58], [106], [107], [110], [126], [128], [152], [153], [162], [166], [192], [195], [205], [208], [214], [227], [240], [253], [259], [262], [264], [267], [269], [272], [276], [285], [287], [298], [310], [312], [314], [317], [331], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [693], [695], [696], [697], [698], [707], [709], [711], [712], [713] [2019-10-03 04:11:05,019 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:05,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:05,043 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:05,043 INFO L272 AbstractInterpreter]: Visited 55 different actions 55 times. Never merged. Never widened. Performed 342 root evaluator evaluations with a maximum evaluation depth of 3. Performed 342 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 65 variables. [2019-10-03 04:11:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:05,044 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:05,130 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 83.73% of their original sizes. [2019-10-03 04:11:05,130 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:05,582 INFO L420 sIntCurrentIteration]: We unified 87 AI predicates to 87 [2019-10-03 04:11:05,582 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:05,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:05,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [7] total 33 [2019-10-03 04:11:05,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:05,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-03 04:11:05,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-03 04:11:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2019-10-03 04:11:05,584 INFO L87 Difference]: Start difference. First operand 5354 states and 8410 transitions. Second operand 28 states. [2019-10-03 04:11:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:10,651 INFO L93 Difference]: Finished difference Result 5387 states and 8447 transitions. [2019-10-03 04:11:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-03 04:11:10,651 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2019-10-03 04:11:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:10,678 INFO L225 Difference]: With dead ends: 5387 [2019-10-03 04:11:10,678 INFO L226 Difference]: Without dead ends: 5387 [2019-10-03 04:11:10,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1683, Unknown=0, NotChecked=0, Total=1980 [2019-10-03 04:11:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2019-10-03 04:11:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5371. [2019-10-03 04:11:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5371 states. [2019-10-03 04:11:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5371 states to 5371 states and 8429 transitions. [2019-10-03 04:11:10,795 INFO L78 Accepts]: Start accepts. Automaton has 5371 states and 8429 transitions. Word has length 88 [2019-10-03 04:11:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:10,796 INFO L475 AbstractCegarLoop]: Abstraction has 5371 states and 8429 transitions. [2019-10-03 04:11:10,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-03 04:11:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5371 states and 8429 transitions. [2019-10-03 04:11:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 04:11:10,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:10,801 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-03 04:11:10,802 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash -762719958, now seen corresponding path program 1 times [2019-10-03 04:11:10,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:10,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:10,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:10,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:10,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 04:11:10,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:10,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:10,885 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-10-03 04:11:10,886 INFO L207 CegarAbsIntRunner]: [54], [58], [63], [79], [81], [105], [106], [107], [153], [162], [166], [192], [195], [205], [211], [214], [218], [221], [227], [240], [253], [259], [262], [264], [267], [269], [272], [276], [285], [287], [298], [310], [312], [314], [317], [331], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [693], [695], [696], [699], [700], [707], [709], [711], [712], [713] [2019-10-03 04:11:10,891 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:10,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:10,914 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:10,915 INFO L272 AbstractInterpreter]: Visited 58 different actions 58 times. Never merged. Never widened. Performed 352 root evaluator evaluations with a maximum evaluation depth of 4. Performed 352 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 66 variables. [2019-10-03 04:11:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:10,915 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:10,969 INFO L227 lantSequenceWeakener]: Weakened 72 states. On average, predicates are now at 83.84% of their original sizes. [2019-10-03 04:11:10,969 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:11,394 INFO L420 sIntCurrentIteration]: We unified 88 AI predicates to 88 [2019-10-03 04:11:11,394 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:11,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:11,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [7] total 35 [2019-10-03 04:11:11,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:11,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-03 04:11:11,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-03 04:11:11,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2019-10-03 04:11:11,396 INFO L87 Difference]: Start difference. First operand 5371 states and 8429 transitions. Second operand 30 states. [2019-10-03 04:11:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:17,345 INFO L93 Difference]: Finished difference Result 5530 states and 8646 transitions. [2019-10-03 04:11:17,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 04:11:17,345 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2019-10-03 04:11:17,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:17,362 INFO L225 Difference]: With dead ends: 5530 [2019-10-03 04:11:17,363 INFO L226 Difference]: Without dead ends: 5530 [2019-10-03 04:11:17,364 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=323, Invalid=1933, Unknown=0, NotChecked=0, Total=2256 [2019-10-03 04:11:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2019-10-03 04:11:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 5512. [2019-10-03 04:11:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5512 states. [2019-10-03 04:11:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5512 states to 5512 states and 8625 transitions. [2019-10-03 04:11:17,476 INFO L78 Accepts]: Start accepts. Automaton has 5512 states and 8625 transitions. Word has length 89 [2019-10-03 04:11:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:17,477 INFO L475 AbstractCegarLoop]: Abstraction has 5512 states and 8625 transitions. [2019-10-03 04:11:17,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-03 04:11:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5512 states and 8625 transitions. [2019-10-03 04:11:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 04:11:17,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:17,482 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:11:17,482 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:17,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:17,482 INFO L82 PathProgramCache]: Analyzing trace with hash -54212784, now seen corresponding path program 1 times [2019-10-03 04:11:17,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:17,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:17,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 04:11:17,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:17,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:17,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2019-10-03 04:11:17,568 INFO L207 CegarAbsIntRunner]: [29], [45], [47], [53], [54], [58], [106], [107], [153], [162], [166], [192], [195], [205], [211], [214], [218], [224], [227], [231], [234], [240], [253], [259], [262], [264], [267], [269], [272], [276], [285], [287], [298], [310], [312], [314], [317], [331], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [693], [695], [696], [701], [702], [707], [709], [711], [712], [713] [2019-10-03 04:11:17,574 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:17,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:17,608 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:17,611 INFO L272 AbstractInterpreter]: Visited 61 different actions 63 times. Merged at 2 different actions 2 times. Never widened. Performed 366 root evaluator evaluations with a maximum evaluation depth of 4. Performed 366 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 67 variables. [2019-10-03 04:11:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:17,611 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:17,739 INFO L227 lantSequenceWeakener]: Weakened 75 states. On average, predicates are now at 83.36% of their original sizes. [2019-10-03 04:11:17,740 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:18,716 INFO L420 sIntCurrentIteration]: We unified 89 AI predicates to 89 [2019-10-03 04:11:18,717 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:18,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:18,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [7] total 42 [2019-10-03 04:11:18,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:18,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-03 04:11:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-03 04:11:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1170, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 04:11:18,720 INFO L87 Difference]: Start difference. First operand 5512 states and 8625 transitions. Second operand 37 states. [2019-10-03 04:11:30,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:30,826 INFO L93 Difference]: Finished difference Result 7735 states and 11976 transitions. [2019-10-03 04:11:30,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-03 04:11:30,827 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 90 [2019-10-03 04:11:30,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:30,853 INFO L225 Difference]: With dead ends: 7735 [2019-10-03 04:11:30,853 INFO L226 Difference]: Without dead ends: 7731 [2019-10-03 04:11:30,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=422, Invalid=2658, Unknown=0, NotChecked=0, Total=3080 [2019-10-03 04:11:30,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7731 states. [2019-10-03 04:11:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7731 to 7619. [2019-10-03 04:11:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7619 states. [2019-10-03 04:11:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7619 states to 7619 states and 11812 transitions. [2019-10-03 04:11:31,147 INFO L78 Accepts]: Start accepts. Automaton has 7619 states and 11812 transitions. Word has length 90 [2019-10-03 04:11:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:31,147 INFO L475 AbstractCegarLoop]: Abstraction has 7619 states and 11812 transitions. [2019-10-03 04:11:31,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-03 04:11:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 7619 states and 11812 transitions. [2019-10-03 04:11:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 04:11:31,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:31,161 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2019-10-03 04:11:31,161 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:31,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:31,162 INFO L82 PathProgramCache]: Analyzing trace with hash 191051949, now seen corresponding path program 1 times [2019-10-03 04:11:31,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:31,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:31,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:31,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 04:11:31,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:31,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:31,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:31,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:31,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:31,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:31,256 INFO L87 Difference]: Start difference. First operand 7619 states and 11812 transitions. Second operand 5 states. [2019-10-03 04:11:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:31,599 INFO L93 Difference]: Finished difference Result 12363 states and 19242 transitions. [2019-10-03 04:11:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:11:31,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-03 04:11:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:31,649 INFO L225 Difference]: With dead ends: 12363 [2019-10-03 04:11:31,649 INFO L226 Difference]: Without dead ends: 12312 [2019-10-03 04:11:31,651 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:11:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12312 states. [2019-10-03 04:11:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12312 to 11852. [2019-10-03 04:11:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11852 states. [2019-10-03 04:11:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11852 states to 11852 states and 18477 transitions. [2019-10-03 04:11:32,014 INFO L78 Accepts]: Start accepts. Automaton has 11852 states and 18477 transitions. Word has length 104 [2019-10-03 04:11:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:32,014 INFO L475 AbstractCegarLoop]: Abstraction has 11852 states and 18477 transitions. [2019-10-03 04:11:32,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 11852 states and 18477 transitions. [2019-10-03 04:11:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 04:11:32,035 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:32,036 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2019-10-03 04:11:32,036 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:32,036 INFO L82 PathProgramCache]: Analyzing trace with hash -60797350, now seen corresponding path program 1 times [2019-10-03 04:11:32,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:32,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:32,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:32,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 04:11:32,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:32,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:11:32,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:32,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:11:32,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:11:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:11:32,123 INFO L87 Difference]: Start difference. First operand 11852 states and 18477 transitions. Second operand 3 states. [2019-10-03 04:11:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:32,285 INFO L93 Difference]: Finished difference Result 17549 states and 27996 transitions. [2019-10-03 04:11:32,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:11:32,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-03 04:11:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:32,354 INFO L225 Difference]: With dead ends: 17549 [2019-10-03 04:11:32,355 INFO L226 Difference]: Without dead ends: 17549 [2019-10-03 04:11:32,355 INFO L640 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 [2019-10-03 04:11:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17549 states. [2019-10-03 04:11:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17549 to 17533. [2019-10-03 04:11:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17533 states. [2019-10-03 04:11:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17533 states to 17533 states and 27981 transitions. [2019-10-03 04:11:32,835 INFO L78 Accepts]: Start accepts. Automaton has 17533 states and 27981 transitions. Word has length 128 [2019-10-03 04:11:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:32,835 INFO L475 AbstractCegarLoop]: Abstraction has 17533 states and 27981 transitions. [2019-10-03 04:11:32,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:11:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17533 states and 27981 transitions. [2019-10-03 04:11:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 04:11:32,868 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:32,868 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2019-10-03 04:11:32,868 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:32,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1166969766, now seen corresponding path program 1 times [2019-10-03 04:11:32,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:32,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:32,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:32,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:32,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 04:11:32,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:32,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:11:32,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:32,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:11:32,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:11:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:11:32,934 INFO L87 Difference]: Start difference. First operand 17533 states and 27981 transitions. Second operand 3 states. [2019-10-03 04:11:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:33,236 INFO L93 Difference]: Finished difference Result 26692 states and 42394 transitions. [2019-10-03 04:11:33,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:11:33,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-03 04:11:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:33,354 INFO L225 Difference]: With dead ends: 26692 [2019-10-03 04:11:33,354 INFO L226 Difference]: Without dead ends: 26692 [2019-10-03 04:11:33,355 INFO L640 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 [2019-10-03 04:11:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26692 states. [2019-10-03 04:11:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26692 to 26626. [2019-10-03 04:11:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26626 states. [2019-10-03 04:11:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26626 states to 26626 states and 42313 transitions. [2019-10-03 04:11:35,032 INFO L78 Accepts]: Start accepts. Automaton has 26626 states and 42313 transitions. Word has length 128 [2019-10-03 04:11:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:35,033 INFO L475 AbstractCegarLoop]: Abstraction has 26626 states and 42313 transitions. [2019-10-03 04:11:35,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:11:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 26626 states and 42313 transitions. [2019-10-03 04:11:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-03 04:11:35,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:35,103 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1] [2019-10-03 04:11:35,103 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:35,104 INFO L82 PathProgramCache]: Analyzing trace with hash 929999248, now seen corresponding path program 1 times [2019-10-03 04:11:35,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:35,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:35,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:35,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:35,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 04:11:35,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:35,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:11:35,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:35,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:11:35,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:11:35,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:11:35,171 INFO L87 Difference]: Start difference. First operand 26626 states and 42313 transitions. Second operand 3 states. [2019-10-03 04:11:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:35,425 INFO L93 Difference]: Finished difference Result 27146 states and 42151 transitions. [2019-10-03 04:11:35,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:11:35,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-10-03 04:11:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:35,515 INFO L225 Difference]: With dead ends: 27146 [2019-10-03 04:11:35,515 INFO L226 Difference]: Without dead ends: 27146 [2019-10-03 04:11:35,516 INFO L640 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 [2019-10-03 04:11:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27146 states. [2019-10-03 04:11:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27146 to 27100. [2019-10-03 04:11:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27100 states. [2019-10-03 04:11:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27100 states to 27100 states and 42105 transitions. [2019-10-03 04:11:37,181 INFO L78 Accepts]: Start accepts. Automaton has 27100 states and 42105 transitions. Word has length 134 [2019-10-03 04:11:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:37,181 INFO L475 AbstractCegarLoop]: Abstraction has 27100 states and 42105 transitions. [2019-10-03 04:11:37,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:11:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 27100 states and 42105 transitions. [2019-10-03 04:11:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 04:11:37,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:37,221 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-10-03 04:11:37,221 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:37,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash 975212550, now seen corresponding path program 1 times [2019-10-03 04:11:37,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:37,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:37,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 04:11:37,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:37,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:11:37,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:37,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:11:37,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:11:37,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:11:37,285 INFO L87 Difference]: Start difference. First operand 27100 states and 42105 transitions. Second operand 3 states. [2019-10-03 04:11:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:37,545 INFO L93 Difference]: Finished difference Result 27804 states and 42241 transitions. [2019-10-03 04:11:37,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:11:37,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-10-03 04:11:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:37,623 INFO L225 Difference]: With dead ends: 27804 [2019-10-03 04:11:37,624 INFO L226 Difference]: Without dead ends: 27804 [2019-10-03 04:11:37,624 INFO L640 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 [2019-10-03 04:11:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27804 states. [2019-10-03 04:11:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27804 to 27510. [2019-10-03 04:11:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27510 states. [2019-10-03 04:11:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27510 states to 27510 states and 41843 transitions. [2019-10-03 04:11:38,381 INFO L78 Accepts]: Start accepts. Automaton has 27510 states and 41843 transitions. Word has length 136 [2019-10-03 04:11:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:38,382 INFO L475 AbstractCegarLoop]: Abstraction has 27510 states and 41843 transitions. [2019-10-03 04:11:38,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:11:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 27510 states and 41843 transitions. [2019-10-03 04:11:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 04:11:38,443 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:38,443 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-10-03 04:11:38,443 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -795829424, now seen corresponding path program 1 times [2019-10-03 04:11:38,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:38,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:38,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:38,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 04:11:38,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:38,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:11:38,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:38,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:11:38,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:11:38,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:11:38,771 INFO L87 Difference]: Start difference. First operand 27510 states and 41843 transitions. Second operand 3 states. [2019-10-03 04:11:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:39,458 INFO L93 Difference]: Finished difference Result 50725 states and 81195 transitions. [2019-10-03 04:11:39,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:11:39,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-10-03 04:11:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:39,601 INFO L225 Difference]: With dead ends: 50725 [2019-10-03 04:11:39,601 INFO L226 Difference]: Without dead ends: 50725 [2019-10-03 04:11:39,605 INFO L640 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 [2019-10-03 04:11:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50725 states. [2019-10-03 04:11:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50725 to 49579. [2019-10-03 04:11:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49579 states. [2019-10-03 04:11:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49579 states to 49579 states and 80050 transitions. [2019-10-03 04:11:42,294 INFO L78 Accepts]: Start accepts. Automaton has 49579 states and 80050 transitions. Word has length 138 [2019-10-03 04:11:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:42,294 INFO L475 AbstractCegarLoop]: Abstraction has 49579 states and 80050 transitions. [2019-10-03 04:11:42,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:11:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 49579 states and 80050 transitions. [2019-10-03 04:11:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 04:11:42,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:42,384 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:42,384 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash -550910253, now seen corresponding path program 1 times [2019-10-03 04:11:42,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:42,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:42,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:42,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:42,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-03 04:11:42,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:42,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:11:42,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:42,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:11:42,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:11:42,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:11:42,446 INFO L87 Difference]: Start difference. First operand 49579 states and 80050 transitions. Second operand 3 states. [2019-10-03 04:11:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:42,888 INFO L93 Difference]: Finished difference Result 49035 states and 79042 transitions. [2019-10-03 04:11:42,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:11:42,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-03 04:11:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:42,982 INFO L225 Difference]: With dead ends: 49035 [2019-10-03 04:11:42,983 INFO L226 Difference]: Without dead ends: 49035 [2019-10-03 04:11:42,983 INFO L640 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 [2019-10-03 04:11:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49035 states. [2019-10-03 04:11:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49035 to 48335. [2019-10-03 04:11:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48335 states. [2019-10-03 04:11:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48335 states to 48335 states and 78186 transitions. [2019-10-03 04:11:44,509 INFO L78 Accepts]: Start accepts. Automaton has 48335 states and 78186 transitions. Word has length 139 [2019-10-03 04:11:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:44,509 INFO L475 AbstractCegarLoop]: Abstraction has 48335 states and 78186 transitions. [2019-10-03 04:11:44,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:11:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 48335 states and 78186 transitions. [2019-10-03 04:11:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 04:11:44,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:44,574 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2019-10-03 04:11:44,574 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2078030128, now seen corresponding path program 1 times [2019-10-03 04:11:44,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:44,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:44,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:44,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:44,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:44,654 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2019-10-03 04:11:44,655 INFO L207 CegarAbsIntRunner]: [29], [45], [47], [53], [54], [58], [63], [79], [81], [105], [106], [107], [110], [126], [128], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [205], [208], [211], [218], [221], [224], [231], [234], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [317], [331], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [531], [533], [538], [544], [550], [556], [560], [566], [569], [590], [595], [602], [607], [614], [619], [628], [634], [640], [646], [652], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [707], [709], [710], [711], [712], [713] [2019-10-03 04:11:44,660 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:44,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:47,085 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:47,085 INFO L272 AbstractInterpreter]: Visited 115 different actions 662 times. Merged at 52 different actions 186 times. Never widened. Performed 5657 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5657 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 41 fixpoints after 13 different actions. Largest state had 67 variables. [2019-10-03 04:11:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:47,086 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:47,204 INFO L227 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 80.37% of their original sizes. [2019-10-03 04:11:47,204 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:49,971 INFO L420 sIntCurrentIteration]: We unified 140 AI predicates to 140 [2019-10-03 04:11:49,971 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:49,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:49,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [7] total 77 [2019-10-03 04:11:49,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:49,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-03 04:11:49,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-03 04:11:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=4591, Unknown=0, NotChecked=0, Total=5112 [2019-10-03 04:11:49,977 INFO L87 Difference]: Start difference. First operand 48335 states and 78186 transitions. Second operand 72 states. [2019-10-03 04:13:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:24,311 INFO L93 Difference]: Finished difference Result 46388 states and 68460 transitions. [2019-10-03 04:13:24,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2019-10-03 04:13:24,312 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-10-03 04:13:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:24,389 INFO L225 Difference]: With dead ends: 46388 [2019-10-03 04:13:24,389 INFO L226 Difference]: Without dead ends: 44293 [2019-10-03 04:13:24,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26828 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=10928, Invalid=66634, Unknown=0, NotChecked=0, Total=77562 [2019-10-03 04:13:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44293 states. [2019-10-03 04:13:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44293 to 41336. [2019-10-03 04:13:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41336 states. [2019-10-03 04:13:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41336 states to 41336 states and 61536 transitions. [2019-10-03 04:13:25,193 INFO L78 Accepts]: Start accepts. Automaton has 41336 states and 61536 transitions. Word has length 141 [2019-10-03 04:13:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:13:25,194 INFO L475 AbstractCegarLoop]: Abstraction has 41336 states and 61536 transitions. [2019-10-03 04:13:25,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-03 04:13:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 41336 states and 61536 transitions. [2019-10-03 04:13:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 04:13:25,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:13:25,227 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:13:25,228 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:13:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1060622969, now seen corresponding path program 1 times [2019-10-03 04:13:25,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:13:25,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:25,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:13:25,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:25,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:13:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:13:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 04:13:25,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:13:25,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:13:25,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-10-03 04:13:25,316 INFO L207 CegarAbsIntRunner]: [31], [34], [45], [47], [49], [53], [54], [58], [63], [79], [81], [105], [106], [107], [110], [126], [128], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [205], [208], [211], [218], [221], [224], [231], [234], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [705], [709], [710], [711], [712], [713] [2019-10-03 04:13:25,317 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:13:25,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:13:25,357 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:13:25,357 INFO L272 AbstractInterpreter]: Visited 69 different actions 93 times. Merged at 7 different actions 12 times. Never widened. Performed 892 root evaluator evaluations with a maximum evaluation depth of 4. Performed 892 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 67 variables. [2019-10-03 04:13:25,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:25,358 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:13:25,422 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 78.7% of their original sizes. [2019-10-03 04:13:25,422 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:13:26,420 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-10-03 04:13:26,420 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:13:26,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:13:26,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [5] total 43 [2019-10-03 04:13:26,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:13:26,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-03 04:13:26,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-03 04:13:26,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1393, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 04:13:26,424 INFO L87 Difference]: Start difference. First operand 41336 states and 61536 transitions. Second operand 40 states. [2019-10-03 04:13:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:38,800 INFO L93 Difference]: Finished difference Result 40495 states and 60409 transitions. [2019-10-03 04:13:38,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-03 04:13:38,800 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 145 [2019-10-03 04:13:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:38,896 INFO L225 Difference]: With dead ends: 40495 [2019-10-03 04:13:38,896 INFO L226 Difference]: Without dead ends: 40495 [2019-10-03 04:13:38,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=727, Invalid=5279, Unknown=0, NotChecked=0, Total=6006 [2019-10-03 04:13:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40495 states. [2019-10-03 04:13:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40495 to 40409. [2019-10-03 04:13:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40409 states. [2019-10-03 04:13:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40409 states to 40409 states and 60305 transitions. [2019-10-03 04:13:40,137 INFO L78 Accepts]: Start accepts. Automaton has 40409 states and 60305 transitions. Word has length 145 [2019-10-03 04:13:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:13:40,138 INFO L475 AbstractCegarLoop]: Abstraction has 40409 states and 60305 transitions. [2019-10-03 04:13:40,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-03 04:13:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 40409 states and 60305 transitions. [2019-10-03 04:13:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 04:13:40,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:13:40,191 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-10-03 04:13:40,191 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:13:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash 808054764, now seen corresponding path program 1 times [2019-10-03 04:13:40,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:13:40,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:40,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:13:40,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:40,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:13:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:13:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-03 04:13:40,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:13:40,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:13:40,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-10-03 04:13:40,269 INFO L207 CegarAbsIntRunner]: [54], [58], [65], [68], [79], [81], [85], [96], [98], [105], [106], [107], [110], [126], [128], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [198], [205], [208], [211], [214], [218], [221], [224], [227], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [622], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [705], [709], [710], [711], [712], [713] [2019-10-03 04:13:40,273 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:13:40,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:13:40,312 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:13:40,312 INFO L272 AbstractInterpreter]: Visited 64 different actions 95 times. Merged at 8 different actions 15 times. Never widened. Performed 829 root evaluator evaluations with a maximum evaluation depth of 4. Performed 829 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 66 variables. [2019-10-03 04:13:40,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:40,312 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:13:40,375 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 76.31% of their original sizes. [2019-10-03 04:13:40,375 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:13:41,085 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-10-03 04:13:41,086 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:13:41,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:13:41,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [5] total 45 [2019-10-03 04:13:41,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:13:41,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-03 04:13:41,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-03 04:13:41,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1521, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 04:13:41,087 INFO L87 Difference]: Start difference. First operand 40409 states and 60305 transitions. Second operand 42 states. [2019-10-03 04:13:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:56,300 INFO L93 Difference]: Finished difference Result 27064 states and 37887 transitions. [2019-10-03 04:13:56,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-03 04:13:56,301 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 147 [2019-10-03 04:13:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:56,343 INFO L225 Difference]: With dead ends: 27064 [2019-10-03 04:13:56,343 INFO L226 Difference]: Without dead ends: 27064 [2019-10-03 04:13:56,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4332 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1920, Invalid=11886, Unknown=0, NotChecked=0, Total=13806 [2019-10-03 04:13:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27064 states. [2019-10-03 04:13:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27064 to 26462. [2019-10-03 04:13:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26462 states. [2019-10-03 04:13:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26462 states to 26462 states and 37137 transitions. [2019-10-03 04:13:56,793 INFO L78 Accepts]: Start accepts. Automaton has 26462 states and 37137 transitions. Word has length 147 [2019-10-03 04:13:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:13:56,794 INFO L475 AbstractCegarLoop]: Abstraction has 26462 states and 37137 transitions. [2019-10-03 04:13:56,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-03 04:13:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 26462 states and 37137 transitions. [2019-10-03 04:13:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-03 04:13:56,815 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:13:56,816 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:13:56,816 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:13:56,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:56,816 INFO L82 PathProgramCache]: Analyzing trace with hash 60050329, now seen corresponding path program 1 times [2019-10-03 04:13:56,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:13:56,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:56,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:13:56,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:56,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:13:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:13:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-03 04:13:56,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:13:56,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:13:56,879 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-10-03 04:13:56,880 INFO L207 CegarAbsIntRunner]: [31], [34], [45], [47], [49], [53], [54], [58], [63], [79], [81], [105], [106], [107], [110], [126], [128], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [198], [205], [208], [211], [214], [218], [221], [224], [227], [231], [234], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [705], [709], [710], [711], [712], [713] [2019-10-03 04:13:56,881 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:13:56,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:13:56,935 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:13:56,935 INFO L272 AbstractInterpreter]: Visited 72 different actions 137 times. Merged at 11 different actions 27 times. Never widened. Performed 1142 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1142 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 67 variables. [2019-10-03 04:13:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:56,936 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:13:56,995 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 78.45% of their original sizes. [2019-10-03 04:13:56,995 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:13:57,826 INFO L420 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2019-10-03 04:13:57,826 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:13:57,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:13:57,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [5] total 50 [2019-10-03 04:13:57,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:13:57,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-03 04:13:57,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-03 04:13:57,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 04:13:57,828 INFO L87 Difference]: Start difference. First operand 26462 states and 37137 transitions. Second operand 47 states. [2019-10-03 04:14:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:14:15,687 INFO L93 Difference]: Finished difference Result 19036 states and 26468 transitions. [2019-10-03 04:14:15,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-03 04:14:15,687 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 153 [2019-10-03 04:14:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:14:15,719 INFO L225 Difference]: With dead ends: 19036 [2019-10-03 04:14:15,720 INFO L226 Difference]: Without dead ends: 19036 [2019-10-03 04:14:15,721 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4657 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1904, Invalid=13102, Unknown=0, NotChecked=0, Total=15006 [2019-10-03 04:14:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19036 states. [2019-10-03 04:14:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19036 to 18792. [2019-10-03 04:14:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18792 states. [2019-10-03 04:14:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18792 states to 18792 states and 26141 transitions. [2019-10-03 04:14:15,973 INFO L78 Accepts]: Start accepts. Automaton has 18792 states and 26141 transitions. Word has length 153 [2019-10-03 04:14:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:14:15,974 INFO L475 AbstractCegarLoop]: Abstraction has 18792 states and 26141 transitions. [2019-10-03 04:14:15,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-03 04:14:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 18792 states and 26141 transitions. [2019-10-03 04:14:15,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 04:14:15,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:14:15,985 INFO L411 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:14:15,986 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:14:15,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:14:15,986 INFO L82 PathProgramCache]: Analyzing trace with hash -994129969, now seen corresponding path program 1 times [2019-10-03 04:14:15,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:14:15,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:14:15,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:14:15,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:14:15,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:14:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:14:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-03 04:14:16,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:14:16,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:14:16,057 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-10-03 04:14:16,057 INFO L207 CegarAbsIntRunner]: [29], [45], [47], [53], [54], [58], [63], [79], [81], [105], [106], [107], [112], [115], [126], [128], [132], [135], [140], [145], [152], [153], [162], [166], [168], [171], [173], [178], [183], [188], [192], [195], [201], [205], [208], [211], [218], [221], [224], [227], [231], [234], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [705], [709], [710], [711], [712], [713] [2019-10-03 04:14:16,059 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:14:16,059 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:14:16,161 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:14:16,161 INFO L272 AbstractInterpreter]: Visited 80 different actions 216 times. Merged at 20 different actions 58 times. Never widened. Performed 2023 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2023 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 20 fixpoints after 8 different actions. Largest state had 67 variables. [2019-10-03 04:14:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:14:16,162 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:14:16,287 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 76.35% of their original sizes. [2019-10-03 04:14:16,288 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:14:17,692 INFO L420 sIntCurrentIteration]: We unified 156 AI predicates to 156 [2019-10-03 04:14:17,693 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:14:17,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:14:17,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [5] total 58 [2019-10-03 04:14:17,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:14:17,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-03 04:14:17,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-03 04:14:17,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=2656, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 04:14:17,695 INFO L87 Difference]: Start difference. First operand 18792 states and 26141 transitions. Second operand 55 states. [2019-10-03 04:14:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:14:45,262 INFO L93 Difference]: Finished difference Result 19012 states and 26185 transitions. [2019-10-03 04:14:45,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-03 04:14:45,262 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 157 [2019-10-03 04:14:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:14:45,290 INFO L225 Difference]: With dead ends: 19012 [2019-10-03 04:14:45,290 INFO L226 Difference]: Without dead ends: 19012 [2019-10-03 04:14:45,291 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6035 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3012, Invalid=16170, Unknown=0, NotChecked=0, Total=19182 [2019-10-03 04:14:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19012 states. [2019-10-03 04:14:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19012 to 18404. [2019-10-03 04:14:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18404 states. [2019-10-03 04:14:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18404 states to 18404 states and 25415 transitions. [2019-10-03 04:14:45,523 INFO L78 Accepts]: Start accepts. Automaton has 18404 states and 25415 transitions. Word has length 157 [2019-10-03 04:14:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:14:45,524 INFO L475 AbstractCegarLoop]: Abstraction has 18404 states and 25415 transitions. [2019-10-03 04:14:45,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-03 04:14:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 18404 states and 25415 transitions. [2019-10-03 04:14:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 04:14:45,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:14:45,535 INFO L411 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:14:45,535 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:14:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:14:45,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1047911017, now seen corresponding path program 1 times [2019-10-03 04:14:45,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:14:45,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:14:45,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:14:45,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:14:45,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:14:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:14:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-03 04:14:45,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:14:45,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:14:45,615 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-10-03 04:14:45,616 INFO L207 CegarAbsIntRunner]: [29], [45], [47], [53], [54], [58], [63], [79], [81], [105], [106], [107], [112], [115], [126], [128], [132], [143], [145], [152], [153], [162], [166], [168], [171], [173], [178], [183], [188], [192], [195], [201], [205], [208], [211], [218], [221], [224], [227], [231], [234], [237], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [705], [709], [710], [711], [712], [713] [2019-10-03 04:14:45,617 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:14:45,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:14:45,686 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:14:45,686 INFO L272 AbstractInterpreter]: Visited 81 different actions 194 times. Merged at 21 different actions 48 times. Never widened. Performed 1358 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1358 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 18 fixpoints after 9 different actions. Largest state had 67 variables. [2019-10-03 04:14:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:14:45,687 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:14:45,760 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 76.24% of their original sizes. [2019-10-03 04:14:45,761 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:14:47,069 INFO L420 sIntCurrentIteration]: We unified 156 AI predicates to 156 [2019-10-03 04:14:47,069 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:14:47,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:14:47,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [5] total 55 [2019-10-03 04:14:47,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:14:47,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-03 04:14:47,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-03 04:14:47,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2370, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 04:14:47,071 INFO L87 Difference]: Start difference. First operand 18404 states and 25415 transitions. Second operand 52 states. [2019-10-03 04:15:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:15:04,023 INFO L93 Difference]: Finished difference Result 19423 states and 26690 transitions. [2019-10-03 04:15:04,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-03 04:15:04,023 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 157 [2019-10-03 04:15:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:15:04,052 INFO L225 Difference]: With dead ends: 19423 [2019-10-03 04:15:04,052 INFO L226 Difference]: Without dead ends: 19423 [2019-10-03 04:15:04,054 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5292 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2748, Invalid=14022, Unknown=0, NotChecked=0, Total=16770 [2019-10-03 04:15:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19423 states. [2019-10-03 04:15:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19423 to 19070. [2019-10-03 04:15:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19070 states. [2019-10-03 04:15:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19070 states to 19070 states and 26263 transitions. [2019-10-03 04:15:04,296 INFO L78 Accepts]: Start accepts. Automaton has 19070 states and 26263 transitions. Word has length 157 [2019-10-03 04:15:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:15:04,297 INFO L475 AbstractCegarLoop]: Abstraction has 19070 states and 26263 transitions. [2019-10-03 04:15:04,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-03 04:15:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 19070 states and 26263 transitions. [2019-10-03 04:15:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 04:15:04,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:15:04,309 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:15:04,309 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:15:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash 996485751, now seen corresponding path program 1 times [2019-10-03 04:15:04,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:15:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:04,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:04,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:15:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 04:15:04,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:04,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:15:04,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-10-03 04:15:04,400 INFO L207 CegarAbsIntRunner]: [29], [45], [47], [53], [54], [58], [65], [68], [79], [81], [85], [88], [91], [98], [105], [106], [107], [110], [126], [128], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [198], [205], [208], [211], [214], [218], [221], [224], [231], [234], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [705], [709], [710], [711], [712], [713] [2019-10-03 04:15:04,401 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:15:04,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:15:04,524 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:15:04,524 INFO L272 AbstractInterpreter]: Visited 82 different actions 317 times. Merged at 21 different actions 90 times. Never widened. Performed 2920 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2920 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 21 fixpoints after 8 different actions. Largest state had 67 variables. [2019-10-03 04:15:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:04,525 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:15:04,590 INFO L227 lantSequenceWeakener]: Weakened 110 states. On average, predicates are now at 77.21% of their original sizes. [2019-10-03 04:15:04,590 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:15:06,180 INFO L420 sIntCurrentIteration]: We unified 156 AI predicates to 156 [2019-10-03 04:15:06,180 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:15:06,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:15:06,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [61] imperfect sequences [5] total 64 [2019-10-03 04:15:06,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:15:06,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-03 04:15:06,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-03 04:15:06,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=3280, Unknown=0, NotChecked=0, Total=3660 [2019-10-03 04:15:06,182 INFO L87 Difference]: Start difference. First operand 19070 states and 26263 transitions. Second operand 61 states. [2019-10-03 04:15:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:15:54,261 INFO L93 Difference]: Finished difference Result 20210 states and 27741 transitions. [2019-10-03 04:15:54,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-03 04:15:54,261 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 157 [2019-10-03 04:15:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:15:54,296 INFO L225 Difference]: With dead ends: 20210 [2019-10-03 04:15:54,296 INFO L226 Difference]: Without dead ends: 20210 [2019-10-03 04:15:54,298 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14590 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=5140, Invalid=35866, Unknown=0, NotChecked=0, Total=41006 [2019-10-03 04:15:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20210 states. [2019-10-03 04:15:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20210 to 18854. [2019-10-03 04:15:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18854 states. [2019-10-03 04:15:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18854 states to 18854 states and 25967 transitions. [2019-10-03 04:15:54,609 INFO L78 Accepts]: Start accepts. Automaton has 18854 states and 25967 transitions. Word has length 157 [2019-10-03 04:15:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:15:54,610 INFO L475 AbstractCegarLoop]: Abstraction has 18854 states and 25967 transitions. [2019-10-03 04:15:54,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-03 04:15:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 18854 states and 25967 transitions. [2019-10-03 04:15:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-03 04:15:54,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:15:54,624 INFO L411 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:15:54,624 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:15:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1221977689, now seen corresponding path program 1 times [2019-10-03 04:15:54,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:15:54,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:54,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:54,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:54,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:15:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 04:15:54,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:54,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:15:54,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-10-03 04:15:54,751 INFO L207 CegarAbsIntRunner]: [29], [45], [47], [53], [54], [58], [63], [79], [81], [105], [106], [107], [110], [112], [115], [126], [128], [132], [135], [140], [145], [152], [153], [162], [166], [168], [171], [173], [178], [183], [188], [192], [195], [201], [205], [208], [211], [218], [221], [224], [227], [231], [234], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [705], [709], [710], [711], [712], [713] [2019-10-03 04:15:54,753 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:15:54,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:15:55,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:15:55,248 INFO L272 AbstractInterpreter]: Visited 105 different actions 718 times. Merged at 31 different actions 215 times. Widened at 1 different actions 4 times. Performed 5624 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5624 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 75 fixpoints after 13 different actions. Largest state had 67 variables. [2019-10-03 04:15:55,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:55,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:15:55,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:55,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:15:55,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:55,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:15:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:55,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 04:15:55,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:15:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-03 04:15:55,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:15:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 04:15:55,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:15:55,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 3] total 11 [2019-10-03 04:15:55,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:15:55,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:15:55,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:15:55,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-03 04:15:55,664 INFO L87 Difference]: Start difference. First operand 18854 states and 25967 transitions. Second operand 3 states. [2019-10-03 04:15:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:15:55,729 INFO L93 Difference]: Finished difference Result 12440 states and 16820 transitions. [2019-10-03 04:15:55,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:15:55,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-03 04:15:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:15:55,745 INFO L225 Difference]: With dead ends: 12440 [2019-10-03 04:15:55,745 INFO L226 Difference]: Without dead ends: 12355 [2019-10-03 04:15:55,746 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-03 04:15:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12355 states. [2019-10-03 04:15:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12355 to 11729. [2019-10-03 04:15:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11729 states. [2019-10-03 04:15:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11729 states to 11729 states and 16019 transitions. [2019-10-03 04:15:55,887 INFO L78 Accepts]: Start accepts. Automaton has 11729 states and 16019 transitions. Word has length 163 [2019-10-03 04:15:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:15:55,887 INFO L475 AbstractCegarLoop]: Abstraction has 11729 states and 16019 transitions. [2019-10-03 04:15:55,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:15:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11729 states and 16019 transitions. [2019-10-03 04:15:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-03 04:15:55,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:15:55,891 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:15:55,891 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:15:55,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash 708365569, now seen corresponding path program 1 times [2019-10-03 04:15:55,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:15:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:55,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:55,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:15:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 46 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 04:15:56,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:56,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:15:56,014 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-10-03 04:15:56,014 INFO L207 CegarAbsIntRunner]: [29], [45], [47], [53], [54], [58], [63], [65], [68], [79], [81], [85], [88], [91], [98], [105], [106], [107], [110], [126], [128], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [198], [205], [208], [211], [214], [218], [221], [224], [231], [234], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [705], [709], [710], [711], [712], [713] [2019-10-03 04:15:56,016 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:15:56,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:15:56,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:15:56,393 INFO L272 AbstractInterpreter]: Visited 105 different actions 1028 times. Merged at 34 different actions 339 times. Widened at 2 different actions 6 times. Performed 9091 root evaluator evaluations with a maximum evaluation depth of 4. Performed 9091 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 95 fixpoints after 9 different actions. Largest state had 67 variables. [2019-10-03 04:15:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:56,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:15:56,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:56,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:15:56,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:56,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:15:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:56,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:15:56,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:15:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-03 04:15:56,633 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:15:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 04:15:56,711 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:15:56,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-03 04:15:56,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:15:56,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:15:56,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:15:56,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 04:15:56,713 INFO L87 Difference]: Start difference. First operand 11729 states and 16019 transitions. Second operand 3 states. [2019-10-03 04:15:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:15:56,821 INFO L93 Difference]: Finished difference Result 18317 states and 25363 transitions. [2019-10-03 04:15:56,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:15:56,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-03 04:15:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:15:56,850 INFO L225 Difference]: With dead ends: 18317 [2019-10-03 04:15:56,850 INFO L226 Difference]: Without dead ends: 18317 [2019-10-03 04:15:56,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 04:15:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18317 states. [2019-10-03 04:15:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18317 to 18310. [2019-10-03 04:15:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18310 states. [2019-10-03 04:15:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18310 states to 18310 states and 25357 transitions. [2019-10-03 04:15:57,109 INFO L78 Accepts]: Start accepts. Automaton has 18310 states and 25357 transitions. Word has length 163 [2019-10-03 04:15:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:15:57,109 INFO L475 AbstractCegarLoop]: Abstraction has 18310 states and 25357 transitions. [2019-10-03 04:15:57,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:15:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 18310 states and 25357 transitions. [2019-10-03 04:15:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-03 04:15:57,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:15:57,115 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:15:57,116 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:15:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2019843777, now seen corresponding path program 1 times [2019-10-03 04:15:57,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:15:57,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:57,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:57,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:57,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:15:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 46 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 04:15:57,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:57,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:15:57,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-10-03 04:15:57,237 INFO L207 CegarAbsIntRunner]: [29], [45], [47], [53], [54], [58], [63], [65], [68], [79], [81], [85], [88], [93], [98], [105], [106], [107], [110], [126], [128], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [198], [205], [208], [211], [214], [218], [221], [224], [231], [234], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [705], [709], [710], [711], [712], [713] [2019-10-03 04:15:57,239 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:15:57,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:15:57,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:15:57,772 INFO L272 AbstractInterpreter]: Visited 104 different actions 847 times. Merged at 30 different actions 243 times. Widened at 1 different actions 5 times. Performed 8067 root evaluator evaluations with a maximum evaluation depth of 4. Performed 8067 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 72 fixpoints after 11 different actions. Largest state had 67 variables. [2019-10-03 04:15:57,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:57,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:15:57,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:57,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:15:57,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:57,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:15:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:57,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:15:57,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:15:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 04:15:58,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:15:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 04:15:58,082 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:15:58,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-03 04:15:58,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:15:58,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:15:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:15:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 04:15:58,083 INFO L87 Difference]: Start difference. First operand 18310 states and 25357 transitions. Second operand 3 states. [2019-10-03 04:15:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:15:58,181 INFO L93 Difference]: Finished difference Result 18105 states and 24768 transitions. [2019-10-03 04:15:58,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:15:58,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-03 04:15:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:15:58,207 INFO L225 Difference]: With dead ends: 18105 [2019-10-03 04:15:58,207 INFO L226 Difference]: Without dead ends: 18105 [2019-10-03 04:15:58,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 04:15:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18105 states. [2019-10-03 04:15:58,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18105 to 17737. [2019-10-03 04:15:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17737 states. [2019-10-03 04:15:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17737 states to 17737 states and 24398 transitions. [2019-10-03 04:15:58,459 INFO L78 Accepts]: Start accepts. Automaton has 17737 states and 24398 transitions. Word has length 163 [2019-10-03 04:15:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:15:58,459 INFO L475 AbstractCegarLoop]: Abstraction has 17737 states and 24398 transitions. [2019-10-03 04:15:58,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:15:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 17737 states and 24398 transitions. [2019-10-03 04:15:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-03 04:15:58,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:15:58,465 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:15:58,465 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:15:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1781035791, now seen corresponding path program 1 times [2019-10-03 04:15:58,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:15:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:58,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:58,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:58,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:15:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 54 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-03 04:15:58,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:58,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:15:58,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2019-10-03 04:15:58,537 INFO L207 CegarAbsIntRunner]: [29], [45], [47], [53], [54], [58], [63], [79], [81], [105], [106], [107], [112], [115], [126], [128], [132], [143], [145], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [198], [205], [208], [211], [214], [218], [221], [224], [227], [231], [234], [237], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [705], [709], [710], [711], [712], [713] [2019-10-03 04:15:58,538 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:15:58,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:15:58,640 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:15:58,641 INFO L272 AbstractInterpreter]: Visited 81 different actions 255 times. Merged at 21 different actions 63 times. Never widened. Performed 2045 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2045 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 20 fixpoints after 8 different actions. Largest state had 67 variables. [2019-10-03 04:15:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:58,641 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:15:58,717 INFO L227 lantSequenceWeakener]: Weakened 116 states. On average, predicates are now at 76.5% of their original sizes. [2019-10-03 04:15:58,717 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:15:59,927 INFO L420 sIntCurrentIteration]: We unified 164 AI predicates to 164 [2019-10-03 04:15:59,928 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:15:59,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:15:59,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [5] total 58 [2019-10-03 04:15:59,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:15:59,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-03 04:15:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-03 04:15:59,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2617, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 04:15:59,930 INFO L87 Difference]: Start difference. First operand 17737 states and 24398 transitions. Second operand 55 states. [2019-10-03 04:16:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:19,626 INFO L93 Difference]: Finished difference Result 17248 states and 23786 transitions. [2019-10-03 04:16:19,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-03 04:16:19,626 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 165 [2019-10-03 04:16:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:19,659 INFO L225 Difference]: With dead ends: 17248 [2019-10-03 04:16:19,660 INFO L226 Difference]: Without dead ends: 17248 [2019-10-03 04:16:19,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5914 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3089, Invalid=16371, Unknown=0, NotChecked=0, Total=19460 [2019-10-03 04:16:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17248 states. [2019-10-03 04:16:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17248 to 17069. [2019-10-03 04:16:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17069 states. [2019-10-03 04:16:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17069 states to 17069 states and 23561 transitions. [2019-10-03 04:16:19,909 INFO L78 Accepts]: Start accepts. Automaton has 17069 states and 23561 transitions. Word has length 165 [2019-10-03 04:16:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:19,909 INFO L475 AbstractCegarLoop]: Abstraction has 17069 states and 23561 transitions. [2019-10-03 04:16:19,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-03 04:16:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 17069 states and 23561 transitions. [2019-10-03 04:16:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-03 04:16:19,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:19,917 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:19,917 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash 491480394, now seen corresponding path program 1 times [2019-10-03 04:16:19,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:19,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:19,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:19,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:19,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 46 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-03 04:16:20,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:20,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:20,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2019-10-03 04:16:20,045 INFO L207 CegarAbsIntRunner]: [29], [31], [34], [45], [47], [49], [53], [54], [58], [63], [65], [68], [79], [81], [85], [88], [91], [98], [105], [106], [107], [110], [126], [128], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [198], [205], [208], [211], [214], [218], [221], [224], [231], [234], [240], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [705], [709], [710], [711], [712], [713] [2019-10-03 04:16:20,048 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:20,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:22,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:16:22,365 INFO L272 AbstractInterpreter]: Visited 131 different actions 4654 times. Merged at 64 different actions 1731 times. Widened at 2 different actions 25 times. Performed 32965 root evaluator evaluations with a maximum evaluation depth of 4. Performed 32965 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 484 fixpoints after 20 different actions. Largest state had 67 variables. [2019-10-03 04:16:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:22,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:16:22,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:22,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:16:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:22,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:16:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:22,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 04:16:22,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:16:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-03 04:16:22,651 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:16:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-03 04:16:22,721 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:16:22,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 12 [2019-10-03 04:16:22,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:22,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:16:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:16:22,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-03 04:16:22,722 INFO L87 Difference]: Start difference. First operand 17069 states and 23561 transitions. Second operand 3 states. [2019-10-03 04:16:22,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:22,764 INFO L93 Difference]: Finished difference Result 8258 states and 10348 transitions. [2019-10-03 04:16:22,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:16:22,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-03 04:16:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:22,784 INFO L225 Difference]: With dead ends: 8258 [2019-10-03 04:16:22,784 INFO L226 Difference]: Without dead ends: 6072 [2019-10-03 04:16:22,784 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-03 04:16:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2019-10-03 04:16:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 5925. [2019-10-03 04:16:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5925 states. [2019-10-03 04:16:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 7447 transitions. [2019-10-03 04:16:22,883 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 7447 transitions. Word has length 172 [2019-10-03 04:16:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:22,883 INFO L475 AbstractCegarLoop]: Abstraction has 5925 states and 7447 transitions. [2019-10-03 04:16:22,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:16:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 7447 transitions. [2019-10-03 04:16:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-03 04:16:22,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:22,888 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:22,888 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1608384303, now seen corresponding path program 1 times [2019-10-03 04:16:22,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:22,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:22,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:22,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:22,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 46 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-03 04:16:23,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:23,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:23,056 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2019-10-03 04:16:23,056 INFO L207 CegarAbsIntRunner]: [0], [11], [15], [18], [25], [26], [29], [31], [34], [45], [47], [49], [53], [54], [58], [63], [65], [68], [79], [81], [85], [88], [91], [98], [105], [106], [107], [110], [126], [128], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [198], [205], [208], [211], [214], [218], [221], [224], [231], [234], [240], [244], [247], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [317], [331], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [703], [704], [707], [709], [710], [711], [712], [713] [2019-10-03 04:16:23,058 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:23,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:28,433 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:16:28,434 INFO L272 AbstractInterpreter]: Visited 141 different actions 12958 times. Merged at 67 different actions 4652 times. Widened at 3 different actions 61 times. Performed 102706 root evaluator evaluations with a maximum evaluation depth of 4. Performed 102706 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1378 fixpoints after 27 different actions. Largest state had 68 variables. [2019-10-03 04:16:28,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:28,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:16:28,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:28,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:16:28,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:28,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:16:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:28,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:16:28,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:16:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-03 04:16:28,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:16:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-03 04:16:28,781 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:16:28,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-03 04:16:28,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:28,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:16:28,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:16:28,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 04:16:28,782 INFO L87 Difference]: Start difference. First operand 5925 states and 7447 transitions. Second operand 3 states. [2019-10-03 04:16:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:28,814 INFO L93 Difference]: Finished difference Result 5929 states and 7451 transitions. [2019-10-03 04:16:28,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:16:28,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-03 04:16:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:28,832 INFO L225 Difference]: With dead ends: 5929 [2019-10-03 04:16:28,833 INFO L226 Difference]: Without dead ends: 5929 [2019-10-03 04:16:28,833 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 04:16:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5929 states. [2019-10-03 04:16:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5929 to 5929. [2019-10-03 04:16:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5929 states. [2019-10-03 04:16:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5929 states to 5929 states and 7451 transitions. [2019-10-03 04:16:28,912 INFO L78 Accepts]: Start accepts. Automaton has 5929 states and 7451 transitions. Word has length 181 [2019-10-03 04:16:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:28,912 INFO L475 AbstractCegarLoop]: Abstraction has 5929 states and 7451 transitions. [2019-10-03 04:16:28,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:16:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 5929 states and 7451 transitions. [2019-10-03 04:16:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-03 04:16:28,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:28,917 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:28,917 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:28,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:28,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1608437096, now seen corresponding path program 1 times [2019-10-03 04:16:28,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:28,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:28,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:28,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 46 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-03 04:16:29,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:29,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:29,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2019-10-03 04:16:29,040 INFO L207 CegarAbsIntRunner]: [0], [11], [15], [18], [25], [26], [29], [31], [34], [45], [47], [49], [53], [54], [58], [63], [65], [68], [79], [81], [85], [88], [91], [98], [105], [106], [107], [110], [126], [128], [152], [153], [162], [166], [168], [173], [178], [183], [188], [192], [195], [198], [205], [208], [211], [214], [218], [221], [224], [231], [234], [240], [244], [247], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [533], [538], [544], [550], [554], [560], [566], [569], [590], [595], [602], [607], [614], [619], [626], [634], [640], [646], [650], [656], [662], [693], [695], [696], [697], [698], [699], [700], [701], [702], [703], [704], [705], [709], [710], [711], [712], [713] [2019-10-03 04:16:29,042 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:29,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:32,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:16:32,260 INFO L272 AbstractInterpreter]: Visited 141 different actions 10370 times. Merged at 67 different actions 3646 times. Widened at 3 different actions 52 times. Performed 84050 root evaluator evaluations with a maximum evaluation depth of 4. Performed 84050 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1098 fixpoints after 23 different actions. Largest state had 68 variables. [2019-10-03 04:16:32,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:32,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:16:32,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:32,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:16:32,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:32,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:16:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:32,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-03 04:16:32,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:16:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-03 04:16:32,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:16:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 04:16:32,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:16:32,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 4] total 14 [2019-10-03 04:16:32,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:32,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:16:32,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:16:32,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-03 04:16:32,685 INFO L87 Difference]: Start difference. First operand 5929 states and 7451 transitions. Second operand 4 states. [2019-10-03 04:16:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:32,866 INFO L93 Difference]: Finished difference Result 3582 states and 4408 transitions. [2019-10-03 04:16:32,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:16:32,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-10-03 04:16:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:32,876 INFO L225 Difference]: With dead ends: 3582 [2019-10-03 04:16:32,876 INFO L226 Difference]: Without dead ends: 3582 [2019-10-03 04:16:32,876 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-10-03 04:16:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2019-10-03 04:16:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3395. [2019-10-03 04:16:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3395 states. [2019-10-03 04:16:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 4199 transitions. [2019-10-03 04:16:32,920 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 4199 transitions. Word has length 181 [2019-10-03 04:16:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:32,920 INFO L475 AbstractCegarLoop]: Abstraction has 3395 states and 4199 transitions. [2019-10-03 04:16:32,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:16:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 4199 transitions. [2019-10-03 04:16:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-03 04:16:32,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:32,923 INFO L411 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 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, 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, 1, 1, 1] [2019-10-03 04:16:32,923 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:32,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:32,924 INFO L82 PathProgramCache]: Analyzing trace with hash -828948927, now seen corresponding path program 1 times [2019-10-03 04:16:32,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:32,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:32,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:32,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:32,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 04:16:33,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:16:33,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:16:33,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:33,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:16:33,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:16:33,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:16:33,015 INFO L87 Difference]: Start difference. First operand 3395 states and 4199 transitions. Second operand 4 states. [2019-10-03 04:16:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:33,108 INFO L93 Difference]: Finished difference Result 4290 states and 5268 transitions. [2019-10-03 04:16:33,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:16:33,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-10-03 04:16:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:33,119 INFO L225 Difference]: With dead ends: 4290 [2019-10-03 04:16:33,119 INFO L226 Difference]: Without dead ends: 4290 [2019-10-03 04:16:33,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:16:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4290 states. [2019-10-03 04:16:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4290 to 4009. [2019-10-03 04:16:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4009 states. [2019-10-03 04:16:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 4917 transitions. [2019-10-03 04:16:33,180 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 4917 transitions. Word has length 229 [2019-10-03 04:16:33,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:33,182 INFO L475 AbstractCegarLoop]: Abstraction has 4009 states and 4917 transitions. [2019-10-03 04:16:33,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:16:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 4917 transitions. [2019-10-03 04:16:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 04:16:33,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:33,185 INFO L411 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1] [2019-10-03 04:16:33,185 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:33,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 95598995, now seen corresponding path program 1 times [2019-10-03 04:16:33,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:33,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:33,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:33,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:33,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 04:16:33,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:16:33,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:16:33,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:33,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:16:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:16:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:16:33,268 INFO L87 Difference]: Start difference. First operand 4009 states and 4917 transitions. Second operand 3 states. [2019-10-03 04:16:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:33,371 INFO L93 Difference]: Finished difference Result 5578 states and 6929 transitions. [2019-10-03 04:16:33,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:16:33,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-03 04:16:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:33,386 INFO L225 Difference]: With dead ends: 5578 [2019-10-03 04:16:33,386 INFO L226 Difference]: Without dead ends: 5578 [2019-10-03 04:16:33,386 INFO L640 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 [2019-10-03 04:16:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2019-10-03 04:16:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 5027. [2019-10-03 04:16:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-10-03 04:16:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6264 transitions. [2019-10-03 04:16:33,447 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6264 transitions. Word has length 231 [2019-10-03 04:16:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:33,447 INFO L475 AbstractCegarLoop]: Abstraction has 5027 states and 6264 transitions. [2019-10-03 04:16:33,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:16:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6264 transitions. [2019-10-03 04:16:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 04:16:33,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:33,450 INFO L411 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:33,451 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1793497812, now seen corresponding path program 1 times [2019-10-03 04:16:33,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:33,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:33,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:33,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:33,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 65 proven. 53 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-03 04:16:33,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:33,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:33,564 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2019-10-03 04:16:33,564 INFO L207 CegarAbsIntRunner]: [0], [11], [15], [18], [25], [26], [29], [31], [34], [45], [47], [49], [53], [54], [58], [63], [65], [68], [79], [81], [85], [88], [91], [98], [105], [106], [107], [110], [112], [115], [126], [128], [132], [135], [138], [145], [152], [153], [162], [166], [168], [173], [178], [181], [183], [188], [192], [195], [201], [205], [208], [214], [218], [221], [227], [231], [234], [237], [244], [247], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [531], [533], [538], [544], [550], [554], [556], [560], [562], [566], [569], [574], [578], [583], [590], [595], [602], [607], [614], [619], [626], [628], [634], [640], [646], [650], [652], [656], [658], [662], [664], [669], [674], [679], [682], [693], [695], [696], [697], [698], [699], [700], [701], [702], [703], [704], [705], [709], [710], [711], [712], [713] [2019-10-03 04:16:33,566 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:33,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:46,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:16:46,845 INFO L272 AbstractInterpreter]: Visited 161 different actions 44887 times. Merged at 85 different actions 15759 times. Widened at 4 different actions 202 times. Performed 307897 root evaluator evaluations with a maximum evaluation depth of 4. Performed 307897 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5191 fixpoints after 46 different actions. Largest state had 68 variables. [2019-10-03 04:16:46,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:46,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:16:46,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:46,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:16:46,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:46,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:16:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:47,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-03 04:16:47,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:16:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-03 04:16:47,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:16:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-03 04:16:47,300 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:16:47,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-03 04:16:47,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:47,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:16:47,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:16:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:16:47,302 INFO L87 Difference]: Start difference. First operand 5027 states and 6264 transitions. Second operand 3 states. [2019-10-03 04:16:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:47,328 INFO L93 Difference]: Finished difference Result 2655 states and 3096 transitions. [2019-10-03 04:16:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:16:47,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-03 04:16:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:47,335 INFO L225 Difference]: With dead ends: 2655 [2019-10-03 04:16:47,335 INFO L226 Difference]: Without dead ends: 2557 [2019-10-03 04:16:47,335 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:16:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2019-10-03 04:16:47,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2344. [2019-10-03 04:16:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2344 states. [2019-10-03 04:16:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 2752 transitions. [2019-10-03 04:16:47,363 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 2752 transitions. Word has length 234 [2019-10-03 04:16:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:47,363 INFO L475 AbstractCegarLoop]: Abstraction has 2344 states and 2752 transitions. [2019-10-03 04:16:47,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:16:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2752 transitions. [2019-10-03 04:16:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 04:16:47,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:47,365 INFO L411 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:47,366 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:47,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:47,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2090640514, now seen corresponding path program 1 times [2019-10-03 04:16:47,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:47,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:47,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 49 proven. 67 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 04:16:47,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:47,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:47,812 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2019-10-03 04:16:47,812 INFO L207 CegarAbsIntRunner]: [0], [11], [15], [18], [25], [26], [29], [31], [34], [45], [47], [49], [53], [54], [58], [63], [65], [68], [79], [81], [85], [88], [91], [98], [105], [106], [107], [110], [112], [115], [126], [128], [132], [135], [138], [145], [152], [153], [162], [166], [168], [173], [178], [183], [186], [188], [192], [195], [201], [205], [208], [214], [218], [221], [227], [231], [234], [240], [244], [247], [253], [258], [259], [262], [264], [267], [269], [272], [276], [285], [287], [290], [293], [302], [305], [312], [314], [319], [324], [337], [338], [350], [354], [360], [366], [372], [380], [386], [392], [398], [404], [410], [422], [434], [446], [458], [470], [476], [482], [488], [494], [500], [506], [515], [517], [519], [522], [525], [529], [531], [533], [538], [544], [550], [554], [556], [560], [562], [566], [569], [574], [578], [583], [590], [595], [602], [607], [614], [619], [626], [628], [634], [640], [646], [650], [652], [656], [658], [662], [664], [669], [674], [679], [682], [693], [695], [696], [697], [698], [699], [700], [701], [702], [703], [704], [705], [709], [710], [711], [712], [713] [2019-10-03 04:16:47,813 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:47,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:52,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:16:52,567 INFO L272 AbstractInterpreter]: Visited 161 different actions 16213 times. Merged at 85 different actions 5736 times. Widened at 4 different actions 70 times. Performed 108291 root evaluator evaluations with a maximum evaluation depth of 4. Performed 108291 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1878 fixpoints after 45 different actions. Largest state had 68 variables. [2019-10-03 04:16:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:52,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:16:52,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:52,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:16:52,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:52,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:16:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:52,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-03 04:16:52,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:16:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-03 04:16:53,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:16:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 101 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 04:16:53,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:16:53,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 29 [2019-10-03 04:16:53,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:16:53,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-03 04:16:53,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-03 04:16:53,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2019-10-03 04:16:53,731 INFO L87 Difference]: Start difference. First operand 2344 states and 2752 transitions. Second operand 22 states. [2019-10-03 04:17:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:05,402 INFO L93 Difference]: Finished difference Result 8115 states and 9798 transitions. [2019-10-03 04:17:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-10-03 04:17:05,403 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 234 [2019-10-03 04:17:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:05,421 INFO L225 Difference]: With dead ends: 8115 [2019-10-03 04:17:05,421 INFO L226 Difference]: Without dead ends: 8115 [2019-10-03 04:17:05,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 529 SyntacticMatches, 8 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4848 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1722, Invalid=14028, Unknown=0, NotChecked=0, Total=15750 [2019-10-03 04:17:05,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8115 states. [2019-10-03 04:17:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8115 to 7015. [2019-10-03 04:17:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7015 states. [2019-10-03 04:17:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7015 states to 7015 states and 8423 transitions. [2019-10-03 04:17:05,523 INFO L78 Accepts]: Start accepts. Automaton has 7015 states and 8423 transitions. Word has length 234 [2019-10-03 04:17:05,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:17:05,523 INFO L475 AbstractCegarLoop]: Abstraction has 7015 states and 8423 transitions. [2019-10-03 04:17:05,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-03 04:17:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 7015 states and 8423 transitions. [2019-10-03 04:17:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-03 04:17:05,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:17:05,526 INFO L411 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:17:05,526 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:17:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash -385745313, now seen corresponding path program 1 times [2019-10-03 04:17:05,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:17:05,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:05,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:05,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:05,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:17:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 04:17:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 04:17:05,713 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 04:17:05,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:17:05 BoogieIcfgContainer [2019-10-03 04:17:05,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:17:05,916 INFO L168 Benchmark]: Toolchain (without parser) took 373529.52 ms. Allocated memory was 138.4 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 85.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-10-03 04:17:05,917 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 138.4 MB. Free memory is still 104.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 04:17:05,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 486.34 ms. Allocated memory was 138.4 MB in the beginning and 197.7 MB in the end (delta: 59.2 MB). Free memory was 85.6 MB in the beginning and 172.3 MB in the end (delta: -86.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-10-03 04:17:05,919 INFO L168 Benchmark]: Boogie Preprocessor took 51.10 ms. Allocated memory is still 197.7 MB. Free memory was 172.3 MB in the beginning and 169.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-03 04:17:05,919 INFO L168 Benchmark]: RCFGBuilder took 716.50 ms. Allocated memory is still 197.7 MB. Free memory was 169.5 MB in the beginning and 126.2 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2019-10-03 04:17:05,921 INFO L168 Benchmark]: TraceAbstraction took 372271.13 ms. Allocated memory was 197.7 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 126.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-10-03 04:17:05,929 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97 ms. Allocated memory is still 138.4 MB. Free memory is still 104.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 486.34 ms. Allocated memory was 138.4 MB in the beginning and 197.7 MB in the end (delta: 59.2 MB). Free memory was 85.6 MB in the beginning and 172.3 MB in the end (delta: -86.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.10 ms. Allocated memory is still 197.7 MB. Free memory was 172.3 MB in the beginning and 169.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 716.50 ms. Allocated memory is still 197.7 MB. Free memory was 169.5 MB in the beginning and 126.2 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 372271.13 ms. Allocated memory was 197.7 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 126.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; VAL [\old(c)=17, \old(c1_i)=4, \old(c1_pc)=29, \old(c1_st)=24, \old(c2_i)=14, \old(c2_pc)=28, \old(c2_st)=25, \old(c_req_up)=30, \old(c_t)=20, \old(d)=23, \old(data)=18, \old(e_c)=11, \old(e_e)=31, \old(e_f)=21, \old(e_g)=10, \old(e_p_in)=8, \old(e_wl)=13, \old(p_in)=15, \old(p_out)=9, \old(processed)=16, \old(r_i)=26, \old(r_st)=7, \old(t_b)=12, \old(wb_i)=5, \old(wb_pc)=19, \old(wb_st)=3, \old(wl_i)=27, \old(wl_pc)=22, \old(wl_st)=6, 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] [L691] int __retres1 ; [L695] e_wl = 2 [L696] e_c = e_wl [L697] e_g = e_c [L698] e_f = e_g [L699] e_e = e_f [L700] wl_pc = 0 [L701] c1_pc = 0 [L702] c2_pc = 0 [L703] wb_pc = 0 [L704] wb_i = 1 [L705] c2_i = wb_i [L706] c1_i = c2_i [L707] wl_i = c1_i [L708] r_i = 0 [L709] c_req_up = 0 [L710] d = 0 [L711] c = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=0, \old(e_e)=0, \old(e_f)=0, \old(e_g)=0, \old(e_wl)=0, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L712] CALL start_simulation() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L402] int kernel_st ; [L405] kernel_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=0, 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] [L406] COND FALSE !((int )c_req_up == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L417] COND TRUE (int )wl_i == 1 [L418] wl_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L422] COND TRUE (int )c1_i == 1 [L423] c1_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND TRUE (int )c2_i == 1 [L428] c2_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=0, 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] [L432] COND TRUE (int )wb_i == 1 [L433] wb_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=0, 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] [L437] COND FALSE !((int )r_i == 1) [L440] r_st = 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L442] COND FALSE !((int )e_f == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L447] COND FALSE !((int )e_g == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L452] COND FALSE !((int )e_e == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L457] COND FALSE !((int )e_c == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L462] COND FALSE !((int )e_wl == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L467] COND FALSE !((int )wl_pc == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L475] COND FALSE !((int )wl_pc == 2) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L485] COND FALSE !((int )c1_pc == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L494] COND FALSE !((int )c2_pc == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L503] COND FALSE !((int )wb_pc == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L512] COND FALSE !((int )e_c == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L517] COND FALSE !((int )e_e == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L522] COND FALSE !((int )e_f == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L527] COND FALSE !((int )e_g == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L532] COND FALSE !((int )e_c == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L537] COND FALSE !((int )e_wl == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L543] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=0, wl_st=0] [L546] kernel_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=1, 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] [L547] CALL eval() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L296] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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 (int )wl_st == 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND TRUE \read(tmp) [L325] wl_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L326] CALL write_loop() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=1, 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] [L53] int t ; VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=1, 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] [L56] COND TRUE (int )wl_pc == 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=1, 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] [L70] wl_st = 2 [L71] wl_pc = 1 [L72] e_wl = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=1, 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] [L326] RET write_loop() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L334] COND TRUE (int )c1_st == 0 [L336] tmp___0 = __VERIFIER_nondet_int() [L338] COND TRUE \read(tmp___0) [L340] c1_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L341] CALL compute1() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L139] COND TRUE (int )c1_pc == 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L150] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] c1_st = 2 [L153] c1_pc = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L341] RET compute1() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L349] COND TRUE (int )c2_st == 0 [L351] tmp___1 = __VERIFIER_nondet_int() [L353] COND TRUE \read(tmp___1) [L355] c2_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L356] CALL compute2() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L184] COND TRUE (int )c2_pc == 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L195] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] c2_st = 2 [L198] c2_pc = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L356] RET compute2() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L364] COND TRUE (int )wb_st == 0 [L366] tmp___2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp___2) [L370] wb_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L371] CALL write_back() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=1, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L229] COND TRUE (int )wb_pc == 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=1, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L240] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=1, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] wb_st = 2 [L243] wb_pc = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=1, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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] [L371] RET write_back() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L379] COND FALSE !((int )r_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L296] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L298] COND FALSE !((int )wl_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L301] COND FALSE !((int )c1_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L304] COND FALSE !((int )c2_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L307] COND FALSE !((int )wb_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L310] COND FALSE !((int )r_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L547] RET eval() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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] [L549] kernel_st = 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=2] [L550] COND FALSE !((int )c_req_up == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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=2] [L561] kernel_st = 3 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L562] COND FALSE !((int )e_f == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L567] COND FALSE !((int )e_g == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND FALSE !((int )e_e == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND FALSE !((int )e_c == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L582] COND TRUE (int )e_wl == 0 [L583] e_wl = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L587] COND TRUE (int )wl_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L588] COND TRUE (int )e_wl == 1 [L589] wl_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L605] COND TRUE (int )c1_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L606] COND FALSE !((int )e_f == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L614] COND TRUE (int )c2_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L615] COND FALSE !((int )e_f == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L623] COND TRUE (int )wb_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L624] COND FALSE !((int )e_g == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L632] COND FALSE !((int )e_c == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L637] COND FALSE !((int )e_e == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_f == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND FALSE !((int )e_g == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND FALSE !((int )e_c == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L657] COND TRUE (int )e_wl == 1 [L658] e_wl = 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L662] COND TRUE (int )wl_st == 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L543] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=3, p_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] [L546] kernel_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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] [L547] CALL eval() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L296] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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 (int )wl_st == 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND TRUE \read(tmp) [L325] wl_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L326] CALL write_loop() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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] [L53] int t ; VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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] [L56] COND FALSE !((int )wl_pc == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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] [L59] COND FALSE !((int )wl_pc == 2) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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] [L62] COND TRUE (int )wl_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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] [L77] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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] t = d [L80] data = d [L81] processed = 0 [L82] e_f = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L83] COND TRUE (int )c1_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L84] COND TRUE (int )e_f == 1 [L85] c1_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L92] COND TRUE (int )c2_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L93] COND TRUE (int )e_f == 1 [L94] c2_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L101] e_f = 2 [L102] wl_st = 2 [L103] wl_pc = 2 [L104] t_b = t VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=1, 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=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L326] RET write_loop() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L334] COND TRUE (int )c1_st == 0 [L336] tmp___0 = __VERIFIER_nondet_int() [L338] COND TRUE \read(tmp___0) [L340] c1_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L341] CALL compute1() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L139] COND FALSE !((int )c1_pc == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L142] COND TRUE (int )c1_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L157] COND TRUE ! processed [L158] data += 1 [L159] e_g = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L160] COND TRUE (int )wb_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L161] COND TRUE (int )e_g == 1 [L162] wb_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L169] e_g = 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L150] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] c1_st = 2 [L153] c1_pc = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=1, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L341] RET compute1() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L349] COND TRUE (int )c2_st == 0 [L351] tmp___1 = __VERIFIER_nondet_int() [L353] COND TRUE \read(tmp___1) [L355] c2_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L356] CALL compute2() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=1, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L184] COND FALSE !((int )c2_pc == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=1, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L187] COND TRUE (int )c2_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=1, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L202] COND TRUE ! processed [L203] data += 1 [L204] e_g = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=1, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L205] COND TRUE (int )wb_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=1, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L206] COND TRUE (int )e_g == 1 [L207] wb_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=1, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L214] e_g = 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=1, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L195] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=1, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] c2_st = 2 [L198] c2_pc = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=1, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=1, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L356] RET compute2() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L364] COND TRUE (int )wb_st == 0 [L366] tmp___2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp___2) [L370] wb_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L371] CALL write_back() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=1, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L229] COND FALSE !((int )wb_pc == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=1, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L232] COND TRUE (int )wb_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=1, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L247] c_t = data [L248] c_req_up = 1 [L249] processed = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=1, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L240] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=1, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] wb_st = 2 [L243] wb_pc = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=1, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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] [L371] RET write_back() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L379] COND FALSE !((int )r_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L296] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND FALSE !((int )wl_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L301] COND FALSE !((int )c1_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L304] COND FALSE !((int )c2_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L307] COND FALSE !((int )wb_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L310] COND FALSE !((int )r_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=2, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=1, \old(wl_st)=0, 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, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L547] RET eval() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=1, 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] [L549] kernel_st = 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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] [L550] COND TRUE (int )c_req_up == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=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] COND TRUE c != c_t [L552] c = c_t [L553] e_c = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, 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, kernel_st=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] c_req_up = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=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] [L561] kernel_st = 3 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L562] COND FALSE !((int )e_f == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] COND FALSE !((int )e_g == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_e == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND TRUE (int )e_c == 0 [L578] e_c = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L582] COND FALSE !((int )e_wl == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L587] COND FALSE !((int )wl_pc == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )wl_pc == 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L596] COND FALSE !((int )e_e == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND TRUE (int )c1_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L606] COND FALSE !((int )e_f == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L614] COND TRUE (int )c2_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L615] COND FALSE !((int )e_f == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L623] COND TRUE (int )wb_pc == 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L624] COND FALSE !((int )e_g == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L632] COND TRUE (int )e_c == 1 [L633] r_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L637] COND FALSE !((int )e_e == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND FALSE !((int )e_f == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_g == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND TRUE (int )e_c == 1 [L653] e_c = 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L657] COND FALSE !((int )e_wl == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L662] COND FALSE !((int )wl_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L665] COND FALSE !((int )c1_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L668] COND FALSE !((int )c2_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L671] COND FALSE !((int )wb_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L674] COND TRUE (int )r_st == 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L543] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=3, 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] [L546] kernel_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=0, \old(c1_st)=0, \old(c2_i)=0, \old(c2_pc)=0, \old(c2_st)=0, \old(c_req_up)=0, \old(c_t)=0, \old(d)=0, \old(data)=0, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=0, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=0, \old(wb_st)=0, \old(wl_i)=0, \old(wl_pc)=0, \old(wl_st)=0, c=2, c1_i=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, kernel_st=1, 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] [L547] CALL eval() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L296] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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 FALSE !((int )wl_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L301] COND FALSE !((int )c1_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L304] COND FALSE !((int )c2_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L307] COND FALSE !((int )wb_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L310] COND TRUE (int )r_st == 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L319] COND FALSE !((int )wl_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L334] COND FALSE !((int )c1_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L349] COND FALSE !((int )c2_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L364] COND FALSE !((int )wb_st == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L379] COND TRUE (int )r_st == 0 [L381] tmp___3 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp___3) [L385] r_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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=1, t_b=0, tmp___3=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L386] CALL read() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=1, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L261] d = c [L262] e_e = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=1, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L263] COND FALSE !((int )wl_pc == 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=1, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L271] COND TRUE (int )wl_pc == 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=1, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L272] COND TRUE (int )e_e == 1 [L273] wl_st = 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=1, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L281] e_e = 2 [L282] r_st = 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=1, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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] [L386] RET read() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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, tmp___3=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L296] COND TRUE 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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, tmp___3=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L298] COND TRUE (int )wl_st == 0 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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, tmp___3=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND TRUE \read(tmp) [L325] wl_st = 1 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=2, c=2, c1_i=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, tmp=1, tmp___3=1, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L326] CALL write_loop() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=1, c=2, c1_i=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] [L53] int t ; VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=1, c=2, c1_i=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] [L56] COND FALSE !((int )wl_pc == 0) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=1, c=2, c1_i=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] [L59] COND TRUE (int )wl_pc == 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=1, c=2, c1_i=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] [L108] t = t_b VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=1, c=2, c1_i=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=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L109] COND FALSE !(d == t + 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=1, c=2, c1_i=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=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L112] COND TRUE d == t + 2 VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=1, c=2, c1_i=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=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L120] COND FALSE !(d == t + 1) VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=1, c=2, c1_i=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=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L124] CALL error() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=1, c=2, c1_i=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] [L13] __VERIFIER_error() VAL [\old(c)=0, \old(c1_i)=0, \old(c1_pc)=1, \old(c1_st)=2, \old(c2_i)=0, \old(c2_pc)=1, \old(c2_st)=2, \old(c_req_up)=0, \old(c_t)=2, \old(d)=0, \old(data)=2, \old(e_c)=2, \old(e_e)=2, \old(e_f)=2, \old(e_g)=2, \old(e_wl)=2, \old(processed)=1, \old(r_i)=0, \old(r_st)=0, \old(t_b)=0, \old(wb_i)=0, \old(wb_pc)=1, \old(wb_st)=2, \old(wl_i)=0, \old(wl_pc)=2, \old(wl_st)=1, c=2, c1_i=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 11 procedures, 161 locations, 1 error locations. UNSAFE Result, 372.2s OverallTime, 43 OverallIterations, 6 TraceHistogramMax, 299.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11543 SDtfs, 40402 SDslu, 49583 SDs, 0 SdLazy, 66073 SolverSat, 11117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5758 GetRequests, 4140 SyntacticMatches, 14 SemanticMatches, 1604 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75384 ImplicationChecksByTransitivity, 51.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49579occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 33.7s AbstIntTime, 20 AbstIntIterations, 12 AbstIntStrong, 0.9922747825446907 AbsIntWeakeningRatio, 0.7830551989730423 AbsIntAvgWeakeningVarsNumRemoved, 27.037869062901155 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.5s AutomataMinimizationTime, 42 MinimizatonAttempts, 13330 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 6785 NumberOfCodeBlocks, 6785 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 7983 ConstructedInterpolants, 0 QuantifiedInterpolants, 2710205 SizeOfPredicates, 17 NumberOfNonLiveVariables, 9324 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 58 InterpolantComputations, 34 PerfectInterpolantSequences, 2879/3257 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...