java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:17:15,646 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:17:15,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:17:15,660 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:17:15,660 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:17:15,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:17:15,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:17:15,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:17:15,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:17:15,667 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:17:15,668 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:17:15,669 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:17:15,670 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:17:15,670 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:17:15,672 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:17:15,672 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:17:15,673 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:17:15,675 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:17:15,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:17:15,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:17:15,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:17:15,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:17:15,687 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:17:15,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:17:15,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:17:15,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:17:15,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:17:15,691 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:17:15,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:17:15,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:17:15,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:17:15,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:17:15,694 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:17:15,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:17:15,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:17:15,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:17:15,696 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 02:17:15,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:17:15,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:17:15,713 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:17:15,713 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:17:15,713 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:17:15,713 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:17:15,714 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:17:15,714 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:17:15,714 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:17:15,714 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:17:15,714 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:17:15,714 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:17:15,715 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:17:15,715 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:17:15,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:17:15,716 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:17:15,716 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:17:15,716 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:17:15,716 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:17:15,716 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:17:15,717 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:17:15,717 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:17:15,717 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:17:15,717 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:17:15,717 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:17:15,718 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:17:15,718 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:17:15,718 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:17:15,718 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:17:15,719 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:17:15,719 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:17:15,719 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:17:15,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:17:15,719 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:17:15,719 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:17:15,720 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:17:15,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:17:15,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:17:15,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:17:15,791 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:17:15,791 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:17:15,793 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-25 02:17:15,863 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cd59d68b7/f1bf7cc7243b49f7a3446ee9dae16534/FLAG60dd6cfd8 [2018-10-25 02:17:16,396 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:17:16,397 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-25 02:17:16,411 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cd59d68b7/f1bf7cc7243b49f7a3446ee9dae16534/FLAG60dd6cfd8 [2018-10-25 02:17:16,427 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cd59d68b7/f1bf7cc7243b49f7a3446ee9dae16534 [2018-10-25 02:17:16,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:17:16,440 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:17:16,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:17:16,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:17:16,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:17:16,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:16,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31cb433d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16, skipping insertion in model container [2018-10-25 02:17:16,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:16,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:17:16,508 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:17:16,780 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:17:16,785 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:17:16,927 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:17:16,946 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:17:16,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16 WrapperNode [2018-10-25 02:17:16,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:17:16,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:17:16,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:17:16,948 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:17:16,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:16,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:16,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:17:16,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:17:16,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:17:16,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:17:16,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:16,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:16,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:16,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:17,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:17,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:17,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (1/1) ... [2018-10-25 02:17:17,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:17:17,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:17:17,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:17:17,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:17:17,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 02:17:17,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:17:17,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:17:17,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:17:17,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:17:17,207 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:17:17,207 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:17:18,805 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:17:18,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:17:18 BoogieIcfgContainer [2018-10-25 02:17:18,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:17:18,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:17:18,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:17:18,810 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:17:18,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:17:16" (1/3) ... [2018-10-25 02:17:18,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4521e41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:17:18, skipping insertion in model container [2018-10-25 02:17:18,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:16" (2/3) ... [2018-10-25 02:17:18,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4521e41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:17:18, skipping insertion in model container [2018-10-25 02:17:18,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:17:18" (3/3) ... [2018-10-25 02:17:18,814 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-25 02:17:18,824 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:17:18,834 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:17:18,851 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:17:18,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:17:18,888 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:17:18,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:17:18,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:17:18,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:17:18,889 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:17:18,889 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:17:18,889 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:17:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-10-25 02:17:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-25 02:17:18,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:18,920 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:18,922 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:18,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:18,929 INFO L82 PathProgramCache]: Analyzing trace with hash -662778961, now seen corresponding path program 1 times [2018-10-25 02:17:18,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:18,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:18,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:19,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:17:19,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:17:19,124 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:17:19,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:17:19,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:17:19,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:17:19,143 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2018-10-25 02:17:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:20,403 INFO L93 Difference]: Finished difference Result 331 states and 635 transitions. [2018-10-25 02:17:20,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:17:20,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-25 02:17:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:20,428 INFO L225 Difference]: With dead ends: 331 [2018-10-25 02:17:20,430 INFO L226 Difference]: Without dead ends: 206 [2018-10-25 02:17:20,436 INFO L605 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 [2018-10-25 02:17:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-25 02:17:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2018-10-25 02:17:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-25 02:17:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 314 transitions. [2018-10-25 02:17:20,512 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 314 transitions. Word has length 14 [2018-10-25 02:17:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:20,513 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 314 transitions. [2018-10-25 02:17:20,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:17:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 314 transitions. [2018-10-25 02:17:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-25 02:17:20,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:20,514 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:20,515 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:20,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:20,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1058783719, now seen corresponding path program 1 times [2018-10-25 02:17:20,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:20,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:20,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:20,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:20,517 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:20,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:17:20,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:17:20,611 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:17:20,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:17:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:17:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:17:20,614 INFO L87 Difference]: Start difference. First operand 182 states and 314 transitions. Second operand 3 states. [2018-10-25 02:17:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:20,677 INFO L93 Difference]: Finished difference Result 365 states and 632 transitions. [2018-10-25 02:17:20,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:17:20,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-25 02:17:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:20,683 INFO L225 Difference]: With dead ends: 365 [2018-10-25 02:17:20,683 INFO L226 Difference]: Without dead ends: 189 [2018-10-25 02:17:20,685 INFO L605 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 [2018-10-25 02:17:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-25 02:17:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-10-25 02:17:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-25 02:17:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 322 transitions. [2018-10-25 02:17:20,703 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 322 transitions. Word has length 15 [2018-10-25 02:17:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:20,703 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 322 transitions. [2018-10-25 02:17:20,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:17:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 322 transitions. [2018-10-25 02:17:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-25 02:17:20,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:20,705 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:20,705 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:20,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:20,706 INFO L82 PathProgramCache]: Analyzing trace with hash -426524154, now seen corresponding path program 1 times [2018-10-25 02:17:20,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:20,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:20,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:20,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:20,708 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:20,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:17:20,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:17:20,855 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:17:20,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:17:20,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:17:20,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:17:20,856 INFO L87 Difference]: Start difference. First operand 189 states and 322 transitions. Second operand 3 states. [2018-10-25 02:17:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:21,232 INFO L93 Difference]: Finished difference Result 290 states and 484 transitions. [2018-10-25 02:17:21,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:17:21,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-25 02:17:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:21,235 INFO L225 Difference]: With dead ends: 290 [2018-10-25 02:17:21,236 INFO L226 Difference]: Without dead ends: 274 [2018-10-25 02:17:21,236 INFO L605 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 [2018-10-25 02:17:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-25 02:17:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 259. [2018-10-25 02:17:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-25 02:17:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 436 transitions. [2018-10-25 02:17:21,256 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 436 transitions. Word has length 21 [2018-10-25 02:17:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:21,256 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 436 transitions. [2018-10-25 02:17:21,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:17:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2018-10-25 02:17:21,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-25 02:17:21,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:21,262 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:21,263 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:21,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:21,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1881066880, now seen corresponding path program 1 times [2018-10-25 02:17:21,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:21,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:21,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:21,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:21,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:21,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:17:21,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:17:21,335 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:17:21,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:17:21,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:17:21,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:17:21,336 INFO L87 Difference]: Start difference. First operand 259 states and 436 transitions. Second operand 3 states. [2018-10-25 02:17:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:21,400 INFO L93 Difference]: Finished difference Result 468 states and 791 transitions. [2018-10-25 02:17:21,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:17:21,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-25 02:17:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:21,403 INFO L225 Difference]: With dead ends: 468 [2018-10-25 02:17:21,404 INFO L226 Difference]: Without dead ends: 216 [2018-10-25 02:17:21,406 INFO L605 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 [2018-10-25 02:17:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-25 02:17:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2018-10-25 02:17:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-25 02:17:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 355 transitions. [2018-10-25 02:17:21,434 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 355 transitions. Word has length 22 [2018-10-25 02:17:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:21,435 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 355 transitions. [2018-10-25 02:17:21,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:17:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 355 transitions. [2018-10-25 02:17:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-25 02:17:21,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:21,437 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:21,437 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:21,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:21,438 INFO L82 PathProgramCache]: Analyzing trace with hash 30525515, now seen corresponding path program 1 times [2018-10-25 02:17:21,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:21,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:21,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:21,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:21,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:21,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:21,562 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:21,563 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-25 02:17:21,565 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [54], [56], [526], [529], [530], [531] [2018-10-25 02:17:21,601 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:21,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:22,901 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:22,902 INFO L272 AbstractInterpreter]: Visited 21 different actions 97 times. Merged at 14 different actions 61 times. Widened at 2 different actions 2 times. Found 15 fixpoints after 6 different actions. Largest state had 38 variables. [2018-10-25 02:17:22,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:22,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:22,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:22,947 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 02:17:22,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:22,965 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:23,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-25 02:17:23,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-25 02:17:23,372 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:17:23,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-10-25 02:17:23,373 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:17:23,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:17:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:17:23,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:17:23,374 INFO L87 Difference]: Start difference. First operand 214 states and 355 transitions. Second operand 3 states. [2018-10-25 02:17:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:23,630 INFO L93 Difference]: Finished difference Result 389 states and 646 transitions. [2018-10-25 02:17:23,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:17:23,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-25 02:17:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:23,633 INFO L225 Difference]: With dead ends: 389 [2018-10-25 02:17:23,633 INFO L226 Difference]: Without dead ends: 182 [2018-10-25 02:17:23,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:17:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-25 02:17:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-25 02:17:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-25 02:17:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 291 transitions. [2018-10-25 02:17:23,658 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 291 transitions. Word has length 28 [2018-10-25 02:17:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:23,658 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 291 transitions. [2018-10-25 02:17:23,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:17:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 291 transitions. [2018-10-25 02:17:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-25 02:17:23,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:23,661 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-25 02:17:23,664 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:23,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:23,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1381236108, now seen corresponding path program 1 times [2018-10-25 02:17:23,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:23,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:23,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:23,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:23,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:23,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:23,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:23,775 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-25 02:17:23,775 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [239], [242], [245], [526], [529], [530], [531] [2018-10-25 02:17:23,778 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:23,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:24,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:24,446 INFO L272 AbstractInterpreter]: Visited 26 different actions 124 times. Merged at 19 different actions 78 times. Widened at 1 different actions 1 times. Found 19 fixpoints after 7 different actions. Largest state had 39 variables. [2018-10-25 02:17:24,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:24,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:24,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:24,475 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 02:17:24,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:24,490 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:24,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:24,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:24,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:24,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-25 02:17:24,810 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:24,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:17:24,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:17:24,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:17:24,811 INFO L87 Difference]: Start difference. First operand 180 states and 291 transitions. Second operand 4 states. [2018-10-25 02:17:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:25,761 INFO L93 Difference]: Finished difference Result 435 states and 706 transitions. [2018-10-25 02:17:25,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:17:25,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-10-25 02:17:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:25,764 INFO L225 Difference]: With dead ends: 435 [2018-10-25 02:17:25,764 INFO L226 Difference]: Without dead ends: 282 [2018-10-25 02:17:25,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:17:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-25 02:17:25,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 245. [2018-10-25 02:17:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-25 02:17:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 408 transitions. [2018-10-25 02:17:25,780 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 408 transitions. Word has length 30 [2018-10-25 02:17:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:25,781 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 408 transitions. [2018-10-25 02:17:25,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:17:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 408 transitions. [2018-10-25 02:17:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-25 02:17:25,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:25,785 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:25,786 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:25,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:25,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2061294478, now seen corresponding path program 1 times [2018-10-25 02:17:25,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:25,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:25,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:25,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:25,788 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:25,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:25,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:25,962 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-25 02:17:25,963 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [239], [242], [245], [526], [529], [530], [531] [2018-10-25 02:17:25,966 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:25,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:26,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:26,195 INFO L272 AbstractInterpreter]: Visited 25 different actions 60 times. Merged at 15 different actions 28 times. Never widened. Found 7 fixpoints after 5 different actions. Largest state had 39 variables. [2018-10-25 02:17:26,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:26,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:26,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:26,226 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 02:17:26,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:26,236 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:26,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:26,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:26,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:26,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2018-10-25 02:17:26,567 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:26,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:17:26,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:17:26,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-25 02:17:26,568 INFO L87 Difference]: Start difference. First operand 245 states and 408 transitions. Second operand 5 states. [2018-10-25 02:17:26,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:26,842 INFO L93 Difference]: Finished difference Result 464 states and 780 transitions. [2018-10-25 02:17:26,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 02:17:26,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-10-25 02:17:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:26,848 INFO L225 Difference]: With dead ends: 464 [2018-10-25 02:17:26,848 INFO L226 Difference]: Without dead ends: 452 [2018-10-25 02:17:26,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-25 02:17:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-10-25 02:17:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 438. [2018-10-25 02:17:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-25 02:17:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 730 transitions. [2018-10-25 02:17:26,862 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 730 transitions. Word has length 30 [2018-10-25 02:17:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:26,862 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 730 transitions. [2018-10-25 02:17:26,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:17:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 730 transitions. [2018-10-25 02:17:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-25 02:17:26,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:26,864 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:26,864 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:26,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:26,864 INFO L82 PathProgramCache]: Analyzing trace with hash -512937066, now seen corresponding path program 1 times [2018-10-25 02:17:26,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:26,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:26,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:26,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:26,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:26,970 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:26,970 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-25 02:17:26,970 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [260], [526], [529], [530], [531] [2018-10-25 02:17:26,972 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:26,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:27,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:27,178 INFO L272 AbstractInterpreter]: Visited 26 different actions 62 times. Merged at 16 different actions 29 times. Never widened. Found 7 fixpoints after 5 different actions. Largest state had 40 variables. [2018-10-25 02:17:27,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:27,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:27,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:27,216 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 02:17:27,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:27,228 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:27,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:27,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:27,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:27,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-10-25 02:17:27,639 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:27,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:17:27,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:17:27,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-25 02:17:27,640 INFO L87 Difference]: Start difference. First operand 438 states and 730 transitions. Second operand 5 states. [2018-10-25 02:17:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:27,997 INFO L93 Difference]: Finished difference Result 495 states and 817 transitions. [2018-10-25 02:17:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:17:27,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-10-25 02:17:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:28,001 INFO L225 Difference]: With dead ends: 495 [2018-10-25 02:17:28,002 INFO L226 Difference]: Without dead ends: 490 [2018-10-25 02:17:28,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-25 02:17:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-25 02:17:28,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 484. [2018-10-25 02:17:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-25 02:17:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 802 transitions. [2018-10-25 02:17:28,017 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 802 transitions. Word has length 31 [2018-10-25 02:17:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:28,018 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 802 transitions. [2018-10-25 02:17:28,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:17:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 802 transitions. [2018-10-25 02:17:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-25 02:17:28,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:28,019 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-10-25 02:17:28,020 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:28,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:28,020 INFO L82 PathProgramCache]: Analyzing trace with hash 325020427, now seen corresponding path program 1 times [2018-10-25 02:17:28,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:28,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:28,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:28,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:28,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-25 02:17:28,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:17:28,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:17:28,112 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:17:28,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:17:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:17:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:17:28,113 INFO L87 Difference]: Start difference. First operand 484 states and 802 transitions. Second operand 3 states. [2018-10-25 02:17:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:28,389 INFO L93 Difference]: Finished difference Result 949 states and 1566 transitions. [2018-10-25 02:17:28,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:17:28,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-25 02:17:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:28,393 INFO L225 Difference]: With dead ends: 949 [2018-10-25 02:17:28,393 INFO L226 Difference]: Without dead ends: 495 [2018-10-25 02:17:28,395 INFO L605 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 [2018-10-25 02:17:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-25 02:17:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2018-10-25 02:17:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-10-25 02:17:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 794 transitions. [2018-10-25 02:17:28,410 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 794 transitions. Word has length 32 [2018-10-25 02:17:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:28,411 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 794 transitions. [2018-10-25 02:17:28,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:17:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 794 transitions. [2018-10-25 02:17:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-25 02:17:28,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:28,412 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:28,413 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:28,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2019699710, now seen corresponding path program 1 times [2018-10-25 02:17:28,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:28,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:28,414 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:28,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:17:28,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:17:28,528 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:17:28,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:17:28,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:17:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:17:28,529 INFO L87 Difference]: Start difference. First operand 493 states and 794 transitions. Second operand 3 states. [2018-10-25 02:17:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:28,788 INFO L93 Difference]: Finished difference Result 939 states and 1525 transitions. [2018-10-25 02:17:28,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:17:28,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-25 02:17:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:28,795 INFO L225 Difference]: With dead ends: 939 [2018-10-25 02:17:28,796 INFO L226 Difference]: Without dead ends: 495 [2018-10-25 02:17:28,797 INFO L605 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 [2018-10-25 02:17:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-25 02:17:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2018-10-25 02:17:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-10-25 02:17:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 788 transitions. [2018-10-25 02:17:28,818 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 788 transitions. Word has length 40 [2018-10-25 02:17:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:28,819 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 788 transitions. [2018-10-25 02:17:28,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:17:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 788 transitions. [2018-10-25 02:17:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-25 02:17:28,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:28,820 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-10-25 02:17:28,820 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:28,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash 937434793, now seen corresponding path program 1 times [2018-10-25 02:17:28,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:28,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:28,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:28,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:28,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:29,297 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-25 02:17:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-25 02:17:29,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:29,420 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:29,420 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-10-25 02:17:29,420 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [335], [338], [341], [526], [529], [530], [531] [2018-10-25 02:17:29,425 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:29,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:29,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:29,657 INFO L272 AbstractInterpreter]: Visited 31 different actions 69 times. Merged at 17 different actions 30 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 7 different actions. Largest state had 41 variables. [2018-10-25 02:17:29,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:29,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:29,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:29,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 02:17:29,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:29,707 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:29,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:30,182 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-10-25 02:17:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 02:17:30,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 02:17:30,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:30,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-25 02:17:30,490 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:30,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 02:17:30,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 02:17:30,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 02:17:30,491 INFO L87 Difference]: Start difference. First operand 493 states and 788 transitions. Second operand 7 states. [2018-10-25 02:17:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:31,430 INFO L93 Difference]: Finished difference Result 1026 states and 1635 transitions. [2018-10-25 02:17:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:17:31,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-25 02:17:31,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:31,435 INFO L225 Difference]: With dead ends: 1026 [2018-10-25 02:17:31,436 INFO L226 Difference]: Without dead ends: 575 [2018-10-25 02:17:31,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-25 02:17:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-10-25 02:17:31,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 544. [2018-10-25 02:17:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-25 02:17:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 867 transitions. [2018-10-25 02:17:31,458 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 867 transitions. Word has length 41 [2018-10-25 02:17:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:31,458 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 867 transitions. [2018-10-25 02:17:31,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 02:17:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 867 transitions. [2018-10-25 02:17:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-25 02:17:31,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:31,459 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-10-25 02:17:31,460 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:31,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:31,460 INFO L82 PathProgramCache]: Analyzing trace with hash -992845957, now seen corresponding path program 1 times [2018-10-25 02:17:31,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:31,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:31,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:31,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:31,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 02:17:31,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:31,586 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:31,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-10-25 02:17:31,586 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [350], [353], [356], [526], [529], [530], [531] [2018-10-25 02:17:31,588 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:31,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:31,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:31,821 INFO L272 AbstractInterpreter]: Visited 32 different actions 70 times. Merged at 17 different actions 30 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 7 different actions. Largest state had 42 variables. [2018-10-25 02:17:31,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:31,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:31,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:31,860 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 02:17:31,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:31,905 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:31,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 02:17:31,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 02:17:32,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:32,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-10-25 02:17:32,026 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:32,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:17:32,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:17:32,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:17:32,027 INFO L87 Difference]: Start difference. First operand 544 states and 867 transitions. Second operand 4 states. [2018-10-25 02:17:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:32,205 INFO L93 Difference]: Finished difference Result 558 states and 879 transitions. [2018-10-25 02:17:32,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:17:32,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-10-25 02:17:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:32,210 INFO L225 Difference]: With dead ends: 558 [2018-10-25 02:17:32,210 INFO L226 Difference]: Without dead ends: 546 [2018-10-25 02:17:32,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:17:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-10-25 02:17:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2018-10-25 02:17:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-25 02:17:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 841 transitions. [2018-10-25 02:17:32,227 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 841 transitions. Word has length 42 [2018-10-25 02:17:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:32,227 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 841 transitions. [2018-10-25 02:17:32,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:17:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 841 transitions. [2018-10-25 02:17:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-25 02:17:32,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:32,228 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-10-25 02:17:32,229 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:32,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:32,229 INFO L82 PathProgramCache]: Analyzing trace with hash -275920596, now seen corresponding path program 1 times [2018-10-25 02:17:32,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:32,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:32,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:32,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:32,230 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:32,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:32,507 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:32,507 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-10-25 02:17:32,507 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [386], [526], [529], [530], [531] [2018-10-25 02:17:32,509 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:32,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:32,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:32,740 INFO L272 AbstractInterpreter]: Visited 34 different actions 72 times. Merged at 17 different actions 30 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 7 different actions. Largest state had 44 variables. [2018-10-25 02:17:32,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:32,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:32,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:32,763 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 02:17:32,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:32,771 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:32,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:32,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:33,217 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2018-10-25 02:17:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:33,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:33,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-25 02:17:33,284 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:33,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:17:33,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:17:33,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:17:33,285 INFO L87 Difference]: Start difference. First operand 544 states and 841 transitions. Second operand 5 states. [2018-10-25 02:17:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:33,457 INFO L93 Difference]: Finished difference Result 553 states and 848 transitions. [2018-10-25 02:17:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 02:17:33,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-25 02:17:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:33,461 INFO L225 Difference]: With dead ends: 553 [2018-10-25 02:17:33,461 INFO L226 Difference]: Without dead ends: 551 [2018-10-25 02:17:33,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:17:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-10-25 02:17:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 545. [2018-10-25 02:17:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-10-25 02:17:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 842 transitions. [2018-10-25 02:17:33,478 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 842 transitions. Word has length 44 [2018-10-25 02:17:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:33,478 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 842 transitions. [2018-10-25 02:17:33,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:17:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 842 transitions. [2018-10-25 02:17:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-25 02:17:33,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:33,479 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-10-25 02:17:33,480 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:33,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:33,480 INFO L82 PathProgramCache]: Analyzing trace with hash 161633879, now seen corresponding path program 1 times [2018-10-25 02:17:33,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:33,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:33,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:33,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:33,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:33,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:17:33,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:17:33,556 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:17:33,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:17:33,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:17:33,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:17:33,557 INFO L87 Difference]: Start difference. First operand 545 states and 842 transitions. Second operand 3 states. [2018-10-25 02:17:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:33,710 INFO L93 Difference]: Finished difference Result 1053 states and 1621 transitions. [2018-10-25 02:17:33,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:17:33,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-25 02:17:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:33,714 INFO L225 Difference]: With dead ends: 1053 [2018-10-25 02:17:33,714 INFO L226 Difference]: Without dead ends: 557 [2018-10-25 02:17:33,715 INFO L605 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 [2018-10-25 02:17:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-10-25 02:17:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 555. [2018-10-25 02:17:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-25 02:17:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 835 transitions. [2018-10-25 02:17:33,734 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 835 transitions. Word has length 45 [2018-10-25 02:17:33,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:33,734 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 835 transitions. [2018-10-25 02:17:33,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:17:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 835 transitions. [2018-10-25 02:17:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-25 02:17:33,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:33,735 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:33,735 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:33,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:33,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1614817955, now seen corresponding path program 1 times [2018-10-25 02:17:33,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:33,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:33,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:33,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:33,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-25 02:17:33,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:17:33,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:17:33,818 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:17:33,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:17:33,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:17:33,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:17:33,819 INFO L87 Difference]: Start difference. First operand 555 states and 835 transitions. Second operand 3 states. [2018-10-25 02:17:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:34,089 INFO L93 Difference]: Finished difference Result 799 states and 1202 transitions. [2018-10-25 02:17:34,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:17:34,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-10-25 02:17:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:34,092 INFO L225 Difference]: With dead ends: 799 [2018-10-25 02:17:34,092 INFO L226 Difference]: Without dead ends: 313 [2018-10-25 02:17:34,093 INFO L605 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 [2018-10-25 02:17:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-25 02:17:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2018-10-25 02:17:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-25 02:17:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 454 transitions. [2018-10-25 02:17:34,104 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 454 transitions. Word has length 55 [2018-10-25 02:17:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:34,104 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 454 transitions. [2018-10-25 02:17:34,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:17:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 454 transitions. [2018-10-25 02:17:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-25 02:17:34,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:34,105 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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] [2018-10-25 02:17:34,105 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:34,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1860919614, now seen corresponding path program 1 times [2018-10-25 02:17:34,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:34,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:34,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:34,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:34,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 02:17:34,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:34,357 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:34,357 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-25 02:17:34,357 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [446], [449], [452], [526], [529], [530], [531] [2018-10-25 02:17:34,359 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:34,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:35,523 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:35,523 INFO L272 AbstractInterpreter]: Visited 41 different actions 180 times. Merged at 34 different actions 111 times. Widened at 3 different actions 7 times. Found 29 fixpoints after 9 different actions. Largest state had 46 variables. [2018-10-25 02:17:35,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:35,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:35,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:35,561 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 02:17:35,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:35,578 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:35,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 02:17:35,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 02:17:36,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:36,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-25 02:17:36,076 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:36,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:17:36,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:17:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:17:36,077 INFO L87 Difference]: Start difference. First operand 311 states and 454 transitions. Second operand 5 states. [2018-10-25 02:17:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:36,342 INFO L93 Difference]: Finished difference Result 660 states and 968 transitions. [2018-10-25 02:17:36,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 02:17:36,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-10-25 02:17:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:36,346 INFO L225 Difference]: With dead ends: 660 [2018-10-25 02:17:36,346 INFO L226 Difference]: Without dead ends: 418 [2018-10-25 02:17:36,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:17:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-25 02:17:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 389. [2018-10-25 02:17:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-25 02:17:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 573 transitions. [2018-10-25 02:17:36,360 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 573 transitions. Word has length 56 [2018-10-25 02:17:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:36,360 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 573 transitions. [2018-10-25 02:17:36,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:17:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 573 transitions. [2018-10-25 02:17:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-25 02:17:36,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:36,361 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2018-10-25 02:17:36,362 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:36,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2119085052, now seen corresponding path program 1 times [2018-10-25 02:17:36,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:36,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:36,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:36,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:36,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 02:17:36,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:36,664 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:36,664 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-25 02:17:36,664 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [446], [449], [452], [526], [529], [530], [531] [2018-10-25 02:17:36,666 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:36,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:37,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:37,018 INFO L272 AbstractInterpreter]: Visited 40 different actions 79 times. Merged at 18 different actions 31 times. Widened at 2 different actions 2 times. Found 10 fixpoints after 7 different actions. Largest state had 46 variables. [2018-10-25 02:17:37,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:37,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:37,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:37,057 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:37,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:37,073 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:37,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 02:17:37,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:37,456 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-25 02:17:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:37,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:37,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2018-10-25 02:17:37,691 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:37,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:17:37,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:17:37,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-25 02:17:37,694 INFO L87 Difference]: Start difference. First operand 389 states and 573 transitions. Second operand 5 states. [2018-10-25 02:17:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:38,027 INFO L93 Difference]: Finished difference Result 436 states and 639 transitions. [2018-10-25 02:17:38,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 02:17:38,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-10-25 02:17:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:38,029 INFO L225 Difference]: With dead ends: 436 [2018-10-25 02:17:38,029 INFO L226 Difference]: Without dead ends: 430 [2018-10-25 02:17:38,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-25 02:17:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-25 02:17:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2018-10-25 02:17:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-25 02:17:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 627 transitions. [2018-10-25 02:17:38,044 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 627 transitions. Word has length 56 [2018-10-25 02:17:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:38,044 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 627 transitions. [2018-10-25 02:17:38,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:17:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 627 transitions. [2018-10-25 02:17:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-25 02:17:38,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:38,045 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2018-10-25 02:17:38,045 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:38,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:38,046 INFO L82 PathProgramCache]: Analyzing trace with hash 807144158, now seen corresponding path program 1 times [2018-10-25 02:17:38,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:38,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:38,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:38,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:38,047 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:38,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:38,277 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:38,277 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-25 02:17:38,277 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [512], [526], [529], [530], [531] [2018-10-25 02:17:38,279 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:38,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:38,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:38,654 INFO L272 AbstractInterpreter]: Visited 44 different actions 83 times. Merged at 18 different actions 31 times. Widened at 2 different actions 2 times. Found 10 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:17:38,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:38,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:38,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:38,669 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:38,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:38,679 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:38,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:38,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:39,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:39,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2018-10-25 02:17:39,087 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:39,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 02:17:39,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 02:17:39,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-25 02:17:39,088 INFO L87 Difference]: Start difference. First operand 427 states and 627 transitions. Second operand 10 states. [2018-10-25 02:17:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:39,368 INFO L93 Difference]: Finished difference Result 430 states and 629 transitions. [2018-10-25 02:17:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:17:39,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-10-25 02:17:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:39,372 INFO L225 Difference]: With dead ends: 430 [2018-10-25 02:17:39,372 INFO L226 Difference]: Without dead ends: 428 [2018-10-25 02:17:39,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-10-25 02:17:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-25 02:17:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 427. [2018-10-25 02:17:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-25 02:17:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 626 transitions. [2018-10-25 02:17:39,386 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 626 transitions. Word has length 60 [2018-10-25 02:17:39,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:39,387 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 626 transitions. [2018-10-25 02:17:39,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 02:17:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 626 transitions. [2018-10-25 02:17:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-25 02:17:39,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:39,388 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 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] [2018-10-25 02:17:39,388 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:39,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:39,389 INFO L82 PathProgramCache]: Analyzing trace with hash -743255307, now seen corresponding path program 1 times [2018-10-25 02:17:39,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:39,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:39,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:39,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:39,649 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 02:17:39,824 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 02:17:40,239 WARN L179 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-25 02:17:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:40,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:40,328 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:40,328 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-10-25 02:17:40,328 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [54], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-25 02:17:40,330 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:40,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:40,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:40,808 INFO L272 AbstractInterpreter]: Visited 45 different actions 89 times. Merged at 21 different actions 36 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:17:40,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:40,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:40,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:40,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:40,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:40,845 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:40,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:41,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 02:17:41,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:41,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-10-25 02:17:41,685 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:41,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 02:17:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 02:17:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-25 02:17:41,686 INFO L87 Difference]: Start difference. First operand 427 states and 626 transitions. Second operand 9 states. [2018-10-25 02:17:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:42,213 INFO L93 Difference]: Finished difference Result 431 states and 630 transitions. [2018-10-25 02:17:42,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 02:17:42,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-10-25 02:17:42,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:42,219 INFO L225 Difference]: With dead ends: 431 [2018-10-25 02:17:42,220 INFO L226 Difference]: Without dead ends: 429 [2018-10-25 02:17:42,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-10-25 02:17:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-25 02:17:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 428. [2018-10-25 02:17:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-25 02:17:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2018-10-25 02:17:42,235 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 67 [2018-10-25 02:17:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:42,236 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2018-10-25 02:17:42,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 02:17:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2018-10-25 02:17:42,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-25 02:17:42,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:42,237 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 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] [2018-10-25 02:17:42,237 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:42,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:42,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1746386041, now seen corresponding path program 1 times [2018-10-25 02:17:42,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:42,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:42,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:42,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:42,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:42,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:42,409 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:42,409 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 78 with the following transitions: [2018-10-25 02:17:42,409 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [260], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-25 02:17:42,411 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:42,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:43,499 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:43,499 INFO L272 AbstractInterpreter]: Visited 46 different actions 199 times. Merged at 39 different actions 124 times. Widened at 4 different actions 10 times. Found 31 fixpoints after 8 different actions. Largest state had 50 variables. [2018-10-25 02:17:43,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:43,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:43,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:43,540 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:43,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:43,550 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:43,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:43,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:43,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:43,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-10-25 02:17:43,769 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:43,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:17:43,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:17:43,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-25 02:17:43,770 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 6 states. [2018-10-25 02:17:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:44,171 INFO L93 Difference]: Finished difference Result 865 states and 1269 transitions. [2018-10-25 02:17:44,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:17:44,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-10-25 02:17:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:44,175 INFO L225 Difference]: With dead ends: 865 [2018-10-25 02:17:44,175 INFO L226 Difference]: Without dead ends: 545 [2018-10-25 02:17:44,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-25 02:17:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-25 02:17:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 506. [2018-10-25 02:17:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-10-25 02:17:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 746 transitions. [2018-10-25 02:17:44,191 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 746 transitions. Word has length 77 [2018-10-25 02:17:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:44,192 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 746 transitions. [2018-10-25 02:17:44,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:17:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 746 transitions. [2018-10-25 02:17:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-25 02:17:44,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:44,193 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 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] [2018-10-25 02:17:44,193 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:44,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2139413051, now seen corresponding path program 1 times [2018-10-25 02:17:44,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:44,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:44,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:44,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:44,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:44,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:44,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:44,372 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 78 with the following transitions: [2018-10-25 02:17:44,372 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [260], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-25 02:17:44,374 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:44,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:44,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:44,747 INFO L272 AbstractInterpreter]: Visited 45 different actions 85 times. Merged at 19 different actions 32 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:17:44,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:44,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:44,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:44,782 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:44,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:44,798 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:44,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:45,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 35 proven. 43 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-25 02:17:45,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:45,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2018-10-25 02:17:45,434 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:45,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 02:17:45,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 02:17:45,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-10-25 02:17:45,435 INFO L87 Difference]: Start difference. First operand 506 states and 746 transitions. Second operand 12 states. [2018-10-25 02:17:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:45,691 INFO L93 Difference]: Finished difference Result 529 states and 778 transitions. [2018-10-25 02:17:45,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 02:17:45,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-10-25 02:17:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:45,694 INFO L225 Difference]: With dead ends: 529 [2018-10-25 02:17:45,694 INFO L226 Difference]: Without dead ends: 525 [2018-10-25 02:17:45,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-10-25 02:17:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-25 02:17:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2018-10-25 02:17:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-10-25 02:17:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 772 transitions. [2018-10-25 02:17:45,709 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 772 transitions. Word has length 77 [2018-10-25 02:17:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:45,710 INFO L481 AbstractCegarLoop]: Abstraction has 525 states and 772 transitions. [2018-10-25 02:17:45,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 02:17:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 772 transitions. [2018-10-25 02:17:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-25 02:17:45,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:45,711 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 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] [2018-10-25 02:17:45,711 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:45,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:45,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1314627048, now seen corresponding path program 1 times [2018-10-25 02:17:45,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:45,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:45,713 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 26 proven. 99 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 02:17:45,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:45,934 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:45,934 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-10-25 02:17:45,934 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [335], [338], [341], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-25 02:17:45,935 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:45,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:46,251 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:46,251 INFO L272 AbstractInterpreter]: Visited 47 different actions 87 times. Merged at 19 different actions 32 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:17:46,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:46,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:46,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:46,267 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:46,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:46,276 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:46,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-25 02:17:46,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:47,082 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2018-10-25 02:17:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-25 02:17:47,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:47,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 12 [2018-10-25 02:17:47,483 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:47,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 02:17:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 02:17:47,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-25 02:17:47,484 INFO L87 Difference]: Start difference. First operand 525 states and 772 transitions. Second operand 9 states. [2018-10-25 02:17:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:47,758 INFO L93 Difference]: Finished difference Result 555 states and 810 transitions. [2018-10-25 02:17:47,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 02:17:47,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-10-25 02:17:47,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:47,762 INFO L225 Difference]: With dead ends: 555 [2018-10-25 02:17:47,762 INFO L226 Difference]: Without dead ends: 551 [2018-10-25 02:17:47,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-25 02:17:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-10-25 02:17:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 544. [2018-10-25 02:17:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-25 02:17:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 798 transitions. [2018-10-25 02:17:47,779 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 798 transitions. Word has length 87 [2018-10-25 02:17:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:47,780 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 798 transitions. [2018-10-25 02:17:47,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 02:17:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 798 transitions. [2018-10-25 02:17:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-25 02:17:47,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:47,781 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 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] [2018-10-25 02:17:47,781 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:47,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:47,781 INFO L82 PathProgramCache]: Analyzing trace with hash 233904989, now seen corresponding path program 1 times [2018-10-25 02:17:47,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:47,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:47,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:48,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:48,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:48,147 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-10-25 02:17:48,147 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [386], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-25 02:17:48,148 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:48,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:48,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:48,524 INFO L272 AbstractInterpreter]: Visited 45 different actions 85 times. Merged at 19 different actions 32 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:17:48,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:48,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:48,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:48,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:48,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:48,562 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:48,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:48,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 67 proven. 64 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:49,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:49,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-10-25 02:17:49,716 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:49,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 02:17:49,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 02:17:49,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-10-25 02:17:49,717 INFO L87 Difference]: Start difference. First operand 544 states and 798 transitions. Second operand 14 states. [2018-10-25 02:17:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:50,141 INFO L93 Difference]: Finished difference Result 549 states and 803 transitions. [2018-10-25 02:17:50,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-25 02:17:50,142 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-10-25 02:17:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:50,144 INFO L225 Difference]: With dead ends: 549 [2018-10-25 02:17:50,144 INFO L226 Difference]: Without dead ends: 547 [2018-10-25 02:17:50,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-10-25 02:17:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-10-25 02:17:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2018-10-25 02:17:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-10-25 02:17:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 799 transitions. [2018-10-25 02:17:50,159 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 799 transitions. Word has length 90 [2018-10-25 02:17:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:50,159 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 799 transitions. [2018-10-25 02:17:50,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 02:17:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 799 transitions. [2018-10-25 02:17:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-25 02:17:50,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:50,161 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 6, 4, 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] [2018-10-25 02:17:50,161 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:50,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1342705169, now seen corresponding path program 1 times [2018-10-25 02:17:50,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:50,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:50,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-25 02:17:50,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:50,314 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:50,315 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2018-10-25 02:17:50,315 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [446], [449], [452], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-25 02:17:50,316 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:50,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:51,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:51,212 INFO L272 AbstractInterpreter]: Visited 48 different actions 204 times. Merged at 41 different actions 126 times. Widened at 4 different actions 10 times. Found 32 fixpoints after 9 different actions. Largest state had 50 variables. [2018-10-25 02:17:51,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:51,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:51,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:51,221 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:51,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:51,228 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:51,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-25 02:17:51,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-25 02:17:51,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:51,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-10-25 02:17:51,578 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:51,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 02:17:51,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 02:17:51,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-25 02:17:51,579 INFO L87 Difference]: Start difference. First operand 545 states and 799 transitions. Second operand 7 states. [2018-10-25 02:17:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:51,939 INFO L93 Difference]: Finished difference Result 1070 states and 1569 transitions. [2018-10-25 02:17:51,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:17:51,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-10-25 02:17:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:51,944 INFO L225 Difference]: With dead ends: 1070 [2018-10-25 02:17:51,944 INFO L226 Difference]: Without dead ends: 672 [2018-10-25 02:17:51,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-25 02:17:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-10-25 02:17:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 623. [2018-10-25 02:17:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-25 02:17:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 918 transitions. [2018-10-25 02:17:51,966 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 918 transitions. Word has length 102 [2018-10-25 02:17:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:51,967 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 918 transitions. [2018-10-25 02:17:51,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 02:17:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 918 transitions. [2018-10-25 02:17:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-25 02:17:51,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:51,969 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 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] [2018-10-25 02:17:51,969 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:51,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1084539731, now seen corresponding path program 1 times [2018-10-25 02:17:51,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:51,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:51,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-25 02:17:52,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:52,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:52,257 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2018-10-25 02:17:52,257 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [446], [449], [452], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-25 02:17:52,258 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:52,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:52,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:52,575 INFO L272 AbstractInterpreter]: Visited 47 different actions 87 times. Merged at 19 different actions 32 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:17:52,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:52,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:52,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:52,583 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:52,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:52,593 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:52,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-25 02:17:52,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 84 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-25 02:17:52,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:52,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 9 [2018-10-25 02:17:52,829 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:52,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 02:17:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 02:17:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:17:52,830 INFO L87 Difference]: Start difference. First operand 623 states and 918 transitions. Second operand 7 states. [2018-10-25 02:17:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:52,984 INFO L93 Difference]: Finished difference Result 670 states and 984 transitions. [2018-10-25 02:17:52,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:17:52,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-10-25 02:17:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:52,987 INFO L225 Difference]: With dead ends: 670 [2018-10-25 02:17:52,987 INFO L226 Difference]: Without dead ends: 664 [2018-10-25 02:17:52,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:17:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-10-25 02:17:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 661. [2018-10-25 02:17:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-10-25 02:17:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 972 transitions. [2018-10-25 02:17:53,007 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 972 transitions. Word has length 102 [2018-10-25 02:17:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:53,007 INFO L481 AbstractCegarLoop]: Abstraction has 661 states and 972 transitions. [2018-10-25 02:17:53,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 02:17:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 972 transitions. [2018-10-25 02:17:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-25 02:17:53,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:53,009 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 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] [2018-10-25 02:17:53,009 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:53,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:53,009 INFO L82 PathProgramCache]: Analyzing trace with hash 35576591, now seen corresponding path program 1 times [2018-10-25 02:17:53,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:53,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:53,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:53,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:53,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:53,482 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2018-10-25 02:17:53,482 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [512], [514], [526], [529], [530], [531] [2018-10-25 02:17:53,483 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:53,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:53,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:53,780 INFO L272 AbstractInterpreter]: Visited 45 different actions 85 times. Merged at 19 different actions 32 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:17:53,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:53,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:53,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:53,815 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:53,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:53,827 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:53,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 160 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:54,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 94 proven. 90 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 02:17:54,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:54,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2018-10-25 02:17:54,588 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:54,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 02:17:54,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 02:17:54,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-10-25 02:17:54,589 INFO L87 Difference]: Start difference. First operand 661 states and 972 transitions. Second operand 15 states. [2018-10-25 02:17:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:55,018 INFO L93 Difference]: Finished difference Result 664 states and 974 transitions. [2018-10-25 02:17:55,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-25 02:17:55,019 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2018-10-25 02:17:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:55,022 INFO L225 Difference]: With dead ends: 664 [2018-10-25 02:17:55,022 INFO L226 Difference]: Without dead ends: 662 [2018-10-25 02:17:55,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-10-25 02:17:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-10-25 02:17:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 661. [2018-10-25 02:17:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-10-25 02:17:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 971 transitions. [2018-10-25 02:17:55,041 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 971 transitions. Word has length 106 [2018-10-25 02:17:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:55,042 INFO L481 AbstractCegarLoop]: Abstraction has 661 states and 971 transitions. [2018-10-25 02:17:55,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 02:17:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 971 transitions. [2018-10-25 02:17:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-25 02:17:55,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:55,043 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:55,043 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:55,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:55,044 INFO L82 PathProgramCache]: Analyzing trace with hash -234907228, now seen corresponding path program 2 times [2018-10-25 02:17:55,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:55,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:55,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:55,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:55,045 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:17:55,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:55,500 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:55,500 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 02:17:55,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 02:17:55,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:55,501 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:55,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 02:17:55,510 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 02:17:55,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-25 02:17:55,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 02:17:55,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 140 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-25 02:17:55,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 139 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-25 02:17:56,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:56,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 19 [2018-10-25 02:17:56,036 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:56,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-25 02:17:56,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-25 02:17:56,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-10-25 02:17:56,037 INFO L87 Difference]: Start difference. First operand 661 states and 971 transitions. Second operand 18 states. [2018-10-25 02:17:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:57,633 INFO L93 Difference]: Finished difference Result 1080 states and 1568 transitions. [2018-10-25 02:17:57,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-25 02:17:57,633 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 113 [2018-10-25 02:17:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:57,636 INFO L225 Difference]: With dead ends: 1080 [2018-10-25 02:17:57,637 INFO L226 Difference]: Without dead ends: 596 [2018-10-25 02:17:57,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 229 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2018-10-25 02:17:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-10-25 02:17:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 528. [2018-10-25 02:17:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-25 02:17:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 743 transitions. [2018-10-25 02:17:57,656 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 743 transitions. Word has length 113 [2018-10-25 02:17:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:57,656 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 743 transitions. [2018-10-25 02:17:57,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-25 02:17:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 743 transitions. [2018-10-25 02:17:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-25 02:17:57,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:57,658 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:57,658 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:57,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:57,659 INFO L82 PathProgramCache]: Analyzing trace with hash -238306442, now seen corresponding path program 2 times [2018-10-25 02:17:57,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:57,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 02:17:57,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:57,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 68 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-25 02:17:57,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:57,841 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:57,841 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 02:17:57,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 02:17:57,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:57,841 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:57,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 02:17:57,850 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 02:17:57,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-10-25 02:17:57,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 02:17:58,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 68 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-25 02:17:58,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 68 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-25 02:17:58,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:17:58,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-10-25 02:17:58,118 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:17:58,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 02:17:58,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 02:17:58,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-25 02:17:58,119 INFO L87 Difference]: Start difference. First operand 528 states and 743 transitions. Second operand 8 states. [2018-10-25 02:17:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:58,245 INFO L93 Difference]: Finished difference Result 671 states and 934 transitions. [2018-10-25 02:17:58,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 02:17:58,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2018-10-25 02:17:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:58,247 INFO L225 Difference]: With dead ends: 671 [2018-10-25 02:17:58,248 INFO L226 Difference]: Without dead ends: 586 [2018-10-25 02:17:58,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-25 02:17:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-10-25 02:17:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 567. [2018-10-25 02:17:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-10-25 02:17:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 797 transitions. [2018-10-25 02:17:58,265 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 797 transitions. Word has length 123 [2018-10-25 02:17:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:58,266 INFO L481 AbstractCegarLoop]: Abstraction has 567 states and 797 transitions. [2018-10-25 02:17:58,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 02:17:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 797 transitions. [2018-10-25 02:17:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-25 02:17:58,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:58,267 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:17:58,268 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:58,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash 564488152, now seen corresponding path program 1 times [2018-10-25 02:17:58,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:58,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 02:17:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:58,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 36 proven. 302 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-25 02:17:58,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:58,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:17:58,731 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2018-10-25 02:17:58,731 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [365], [368], [371], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-25 02:17:58,732 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:17:58,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:17:59,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:17:59,055 INFO L272 AbstractInterpreter]: Visited 47 different actions 87 times. Merged at 19 different actions 32 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:17:59,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:59,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:17:59,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:17:59,061 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:17:59,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:59,069 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:17:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:17:59,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:17:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 02:17:59,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:17:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 277 proven. 64 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-25 02:17:59,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-25 02:17:59,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 9] total 21 [2018-10-25 02:17:59,500 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:17:59,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 02:17:59,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 02:17:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2018-10-25 02:17:59,501 INFO L87 Difference]: Start difference. First operand 567 states and 797 transitions. Second operand 8 states. [2018-10-25 02:17:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:17:59,614 INFO L93 Difference]: Finished difference Result 708 states and 994 transitions. [2018-10-25 02:17:59,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 02:17:59,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2018-10-25 02:17:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:17:59,618 INFO L225 Difference]: With dead ends: 708 [2018-10-25 02:17:59,618 INFO L226 Difference]: Without dead ends: 704 [2018-10-25 02:17:59,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 262 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2018-10-25 02:17:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-10-25 02:17:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 700. [2018-10-25 02:17:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-25 02:17:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 986 transitions. [2018-10-25 02:17:59,633 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 986 transitions. Word has length 135 [2018-10-25 02:17:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:17:59,634 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 986 transitions. [2018-10-25 02:17:59,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 02:17:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 986 transitions. [2018-10-25 02:17:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 02:17:59,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:17:59,635 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 02:17:59,636 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:17:59,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:17:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash 330710990, now seen corresponding path program 2 times [2018-10-25 02:17:59,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:17:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:59,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:17:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:17:59,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:17:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:00,088 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 02:18:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:00,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:00,441 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:00,441 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 02:18:00,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 02:18:00,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:00,442 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:00,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 02:18:00,453 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 02:18:00,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-25 02:18:00,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 02:18:00,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 314 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-25 02:18:00,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 191 proven. 156 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-25 02:18:02,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:02,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2018-10-25 02:18:02,324 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:02,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-25 02:18:02,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-25 02:18:02,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=628, Unknown=1, NotChecked=0, Total=756 [2018-10-25 02:18:02,326 INFO L87 Difference]: Start difference. First operand 700 states and 986 transitions. Second operand 20 states. [2018-10-25 02:18:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:03,292 INFO L93 Difference]: Finished difference Result 739 states and 1024 transitions. [2018-10-25 02:18:03,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-25 02:18:03,293 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 136 [2018-10-25 02:18:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:03,296 INFO L225 Difference]: With dead ends: 739 [2018-10-25 02:18:03,297 INFO L226 Difference]: Without dead ends: 737 [2018-10-25 02:18:03,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 258 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=216, Invalid=1265, Unknown=1, NotChecked=0, Total=1482 [2018-10-25 02:18:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-10-25 02:18:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 701. [2018-10-25 02:18:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-10-25 02:18:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 987 transitions. [2018-10-25 02:18:03,322 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 987 transitions. Word has length 136 [2018-10-25 02:18:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:03,322 INFO L481 AbstractCegarLoop]: Abstraction has 701 states and 987 transitions. [2018-10-25 02:18:03,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-25 02:18:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 987 transitions. [2018-10-25 02:18:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-25 02:18:03,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:03,324 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 02:18:03,324 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:03,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:03,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2022069990, now seen corresponding path program 1 times [2018-10-25 02:18:03,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:03,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:03,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 02:18:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:03,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 02:18:03,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:03,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:03,984 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-10-25 02:18:03,984 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [491], [494], [497], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-25 02:18:03,985 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:03,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:04,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:04,756 INFO L272 AbstractInterpreter]: Visited 48 different actions 205 times. Merged at 41 different actions 128 times. Widened at 4 different actions 10 times. Found 31 fixpoints after 8 different actions. Largest state had 50 variables. [2018-10-25 02:18:04,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:04,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:04,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:04,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:04,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:04,773 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:04,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 02:18:04,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 02:18:05,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:05,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-10-25 02:18:05,072 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:05,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 02:18:05,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 02:18:05,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-25 02:18:05,073 INFO L87 Difference]: Start difference. First operand 701 states and 987 transitions. Second operand 9 states. [2018-10-25 02:18:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:05,207 INFO L93 Difference]: Finished difference Result 1199 states and 1687 transitions. [2018-10-25 02:18:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 02:18:05,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2018-10-25 02:18:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:05,212 INFO L225 Difference]: With dead ends: 1199 [2018-10-25 02:18:05,212 INFO L226 Difference]: Without dead ends: 801 [2018-10-25 02:18:05,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-25 02:18:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-25 02:18:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 778. [2018-10-25 02:18:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-10-25 02:18:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1098 transitions. [2018-10-25 02:18:05,233 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1098 transitions. Word has length 151 [2018-10-25 02:18:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:05,233 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 1098 transitions. [2018-10-25 02:18:05,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 02:18:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1098 transitions. [2018-10-25 02:18:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-25 02:18:05,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:05,235 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:05,235 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:05,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1545010560, now seen corresponding path program 2 times [2018-10-25 02:18:05,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:05,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:05,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:05,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:05,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:05,493 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 02:18:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:05,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:05,901 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:05,901 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 02:18:05,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 02:18:05,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:05,901 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:05,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 02:18:05,909 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 02:18:06,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-25 02:18:06,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 02:18:06,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 414 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-25 02:18:06,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 380 proven. 57 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-25 02:18:07,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:07,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 12] total 34 [2018-10-25 02:18:07,029 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:07,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-25 02:18:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-25 02:18:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=804, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 02:18:07,030 INFO L87 Difference]: Start difference. First operand 778 states and 1098 transitions. Second operand 24 states. [2018-10-25 02:18:08,750 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-10-25 02:18:09,386 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-25 02:18:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:09,731 INFO L93 Difference]: Finished difference Result 826 states and 1143 transitions. [2018-10-25 02:18:09,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-25 02:18:09,732 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 152 [2018-10-25 02:18:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:09,735 INFO L225 Difference]: With dead ends: 826 [2018-10-25 02:18:09,736 INFO L226 Difference]: Without dead ends: 824 [2018-10-25 02:18:09,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=712, Invalid=2480, Unknown=0, NotChecked=0, Total=3192 [2018-10-25 02:18:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2018-10-25 02:18:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 778. [2018-10-25 02:18:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-10-25 02:18:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1095 transitions. [2018-10-25 02:18:09,759 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1095 transitions. Word has length 152 [2018-10-25 02:18:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:09,760 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 1095 transitions. [2018-10-25 02:18:09,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-25 02:18:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1095 transitions. [2018-10-25 02:18:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-25 02:18:09,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:09,762 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:09,762 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:09,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash -348083931, now seen corresponding path program 3 times [2018-10-25 02:18:09,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:09,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:09,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 02:18:09,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:09,763 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 02:18:10,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:10,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:10,144 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 02:18:10,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 02:18:10,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:10,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:10,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-25 02:18:10,186 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-25 02:18:10,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-25 02:18:10,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 02:18:10,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 02:18:10,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 02:18:10,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:10,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-10-25 02:18:10,540 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:10,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 02:18:10,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 02:18:10,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-25 02:18:10,542 INFO L87 Difference]: Start difference. First operand 778 states and 1095 transitions. Second operand 10 states. [2018-10-25 02:18:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:10,704 INFO L93 Difference]: Finished difference Result 967 states and 1346 transitions. [2018-10-25 02:18:10,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 02:18:10,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 169 [2018-10-25 02:18:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:10,708 INFO L225 Difference]: With dead ends: 967 [2018-10-25 02:18:10,708 INFO L226 Difference]: Without dead ends: 882 [2018-10-25 02:18:10,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-25 02:18:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2018-10-25 02:18:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 856. [2018-10-25 02:18:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-25 02:18:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1202 transitions. [2018-10-25 02:18:10,736 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1202 transitions. Word has length 169 [2018-10-25 02:18:10,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:10,737 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1202 transitions. [2018-10-25 02:18:10,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 02:18:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1202 transitions. [2018-10-25 02:18:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-25 02:18:10,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:10,738 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:10,738 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:10,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:10,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1339885547, now seen corresponding path program 2 times [2018-10-25 02:18:10,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:10,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:10,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 02:18:10,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:10,739 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-25 02:18:11,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:11,316 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:11,316 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 02:18:11,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 02:18:11,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:11,317 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:11,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 02:18:11,324 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 02:18:11,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-25 02:18:11,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 02:18:11,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-10-25 02:18:14,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-10-25 02:18:14,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:14,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 18 [2018-10-25 02:18:14,520 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:14,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 02:18:14,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 02:18:14,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=189, Unknown=1, NotChecked=0, Total=306 [2018-10-25 02:18:14,521 INFO L87 Difference]: Start difference. First operand 856 states and 1202 transitions. Second operand 15 states. [2018-10-25 02:18:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:15,604 INFO L93 Difference]: Finished difference Result 1006 states and 1400 transitions. [2018-10-25 02:18:15,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-25 02:18:15,605 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 197 [2018-10-25 02:18:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:15,607 INFO L225 Difference]: With dead ends: 1006 [2018-10-25 02:18:15,607 INFO L226 Difference]: Without dead ends: 530 [2018-10-25 02:18:15,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 401 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=407, Invalid=852, Unknown=1, NotChecked=0, Total=1260 [2018-10-25 02:18:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-25 02:18:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 507. [2018-10-25 02:18:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-25 02:18:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 697 transitions. [2018-10-25 02:18:15,630 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 697 transitions. Word has length 197 [2018-10-25 02:18:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:15,630 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 697 transitions. [2018-10-25 02:18:15,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 02:18:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 697 transitions. [2018-10-25 02:18:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-25 02:18:15,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:15,632 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 16, 16, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:15,633 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:15,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash -438655549, now seen corresponding path program 4 times [2018-10-25 02:18:15,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:15,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:15,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 02:18:15,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:15,634 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-25 02:18:16,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:16,676 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:16,676 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 02:18:16,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 02:18:16,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:16,677 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:16,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:16,685 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:16,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-25 02:18:16,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-25 02:18:17,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:17,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 19 [2018-10-25 02:18:17,505 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:17,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 02:18:17,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 02:18:17,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-25 02:18:17,506 INFO L87 Difference]: Start difference. First operand 507 states and 697 transitions. Second operand 14 states. [2018-10-25 02:18:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:17,684 INFO L93 Difference]: Finished difference Result 713 states and 982 transitions. [2018-10-25 02:18:17,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-25 02:18:17,684 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2018-10-25 02:18:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:17,688 INFO L225 Difference]: With dead ends: 713 [2018-10-25 02:18:17,689 INFO L226 Difference]: Without dead ends: 628 [2018-10-25 02:18:17,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 515 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-25 02:18:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-25 02:18:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 585. [2018-10-25 02:18:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-10-25 02:18:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 804 transitions. [2018-10-25 02:18:17,705 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 804 transitions. Word has length 261 [2018-10-25 02:18:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:17,705 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 804 transitions. [2018-10-25 02:18:17,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 02:18:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 804 transitions. [2018-10-25 02:18:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-25 02:18:17,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:17,708 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 19, 19, 12, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:17,708 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:17,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:17,709 INFO L82 PathProgramCache]: Analyzing trace with hash -209480526, now seen corresponding path program 5 times [2018-10-25 02:18:17,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:17,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:17,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:17,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2158 backedges. 188 proven. 1910 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-25 02:18:18,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:18,204 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:18,204 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 02:18:18,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 02:18:18,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:18,204 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:18,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 02:18:18,213 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 02:18:18,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-10-25 02:18:18,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 02:18:18,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2158 backedges. 188 proven. 1910 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-25 02:18:18,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2158 backedges. 188 proven. 1910 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-25 02:18:19,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:19,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 19 [2018-10-25 02:18:19,178 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:19,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-25 02:18:19,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-25 02:18:19,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-25 02:18:19,179 INFO L87 Difference]: Start difference. First operand 585 states and 804 transitions. Second operand 16 states. [2018-10-25 02:18:19,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:19,409 INFO L93 Difference]: Finished difference Result 791 states and 1089 transitions. [2018-10-25 02:18:19,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 02:18:19,409 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 307 [2018-10-25 02:18:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:19,414 INFO L225 Difference]: With dead ends: 791 [2018-10-25 02:18:19,414 INFO L226 Difference]: Without dead ends: 706 [2018-10-25 02:18:19,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 603 SyntacticMatches, 21 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-25 02:18:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-10-25 02:18:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 663. [2018-10-25 02:18:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-10-25 02:18:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 911 transitions. [2018-10-25 02:18:19,434 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 911 transitions. Word has length 307 [2018-10-25 02:18:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:19,435 INFO L481 AbstractCegarLoop]: Abstraction has 663 states and 911 transitions. [2018-10-25 02:18:19,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-25 02:18:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 911 transitions. [2018-10-25 02:18:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-10-25 02:18:19,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:19,437 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:19,437 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:19,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:19,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1748649631, now seen corresponding path program 6 times [2018-10-25 02:18:19,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:19,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:19,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 02:18:19,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:19,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-25 02:18:20,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:20,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:20,789 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 02:18:20,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 02:18:20,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:20,790 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:20,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-25 02:18:20,801 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-25 02:18:21,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-25 02:18:21,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 02:18:21,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-25 02:18:21,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-25 02:18:21,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:21,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 19 [2018-10-25 02:18:21,727 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:21,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-25 02:18:21,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-25 02:18:21,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-25 02:18:21,728 INFO L87 Difference]: Start difference. First operand 663 states and 911 transitions. Second operand 18 states. [2018-10-25 02:18:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:21,935 INFO L93 Difference]: Finished difference Result 869 states and 1196 transitions. [2018-10-25 02:18:21,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 02:18:21,935 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 353 [2018-10-25 02:18:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:21,939 INFO L225 Difference]: With dead ends: 869 [2018-10-25 02:18:21,939 INFO L226 Difference]: Without dead ends: 784 [2018-10-25 02:18:21,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 691 SyntacticMatches, 29 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-25 02:18:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-10-25 02:18:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 741. [2018-10-25 02:18:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-25 02:18:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1018 transitions. [2018-10-25 02:18:21,965 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1018 transitions. Word has length 353 [2018-10-25 02:18:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:21,966 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 1018 transitions. [2018-10-25 02:18:21,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-25 02:18:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1018 transitions. [2018-10-25 02:18:21,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-25 02:18:21,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:21,970 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:21,970 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:21,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:21,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1805057072, now seen corresponding path program 7 times [2018-10-25 02:18:21,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:21,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:21,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 02:18:21,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:21,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-25 02:18:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-25 02:18:23,609 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-25 02:18:23,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 02:18:23 BoogieIcfgContainer [2018-10-25 02:18:23,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 02:18:23,792 INFO L168 Benchmark]: Toolchain (without parser) took 67353.09 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -560.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 02:18:23,793 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 02:18:23,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-25 02:18:23,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 02:18:23,795 INFO L168 Benchmark]: Boogie Preprocessor took 60.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 02:18:23,795 INFO L168 Benchmark]: RCFGBuilder took 1766.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.0 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2018-10-25 02:18:23,796 INFO L168 Benchmark]: TraceAbstraction took 64984.49 ms. Allocated memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: 1.0 GB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 167.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 02:18:23,799 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 505.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1766.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.0 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64984.49 ms. Allocated memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: 1.0 GB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 167.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 569]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_Protocol = 1; [L6] int m_msg_2 = 2; [L7] int m_recv_ack_2 = 3; [L8] int m_msg_1_1 = 4; [L9] int m_msg_1_2 = 5; [L10] int m_recv_ack_1_1 = 6; [L11] int m_recv_ack_1_2 = 7; VAL [\old(m_msg_1_1)=23, \old(m_msg_1_2)=20, \old(m_msg_2)=21, \old(m_Protocol)=25, \old(m_recv_ack_1_1)=22, \old(m_recv_ack_1_2)=24, \old(m_recv_ack_2)=26, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L16] int q = 0; [L17] int method_id; [L20] int this_expect = 0; [L21] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, P1=3, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=1, P9=3, q=0, this_buffer_empty=0, this_expect=0] [L43] COND TRUE q == 0 [L44] COND TRUE __VERIFIER_nondet_int() [L46] COND TRUE 1 [L48] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=3, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=1, P9=3, q=0, this_buffer_empty=0, this_expect=0] [L50] COND FALSE !(0) [L54] q = 1 [L56] this_expect=0 [L56] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=3, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=1, P9=3, q=1, this_buffer_empty=1, this_expect=0] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=18, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=3, P9=3, q=1, this_buffer_empty=1, this_expect=0] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=18, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=3, P9=3, q=1, this_buffer_empty=1, this_expect=0] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=18, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=3, P9=3, q=1, this_buffer_empty=1, this_expect=0] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=18, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=3, P9=3, q=3, this_buffer_empty=0, this_expect=1] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=3, P3=0, P4=3, P5=0, P6=0, P7=0, P8=3, P9=0, q=4, this_buffer_empty=1, this_expect=1] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=1] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=7, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=2] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-3, q=5, this_buffer_empty=0, this_expect=2] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-3, q=5, this_buffer_empty=0, this_expect=2] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-3, q=5, this_buffer_empty=0, this_expect=2] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-3, q=5, this_buffer_empty=0, this_expect=2] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-3, q=5, this_buffer_empty=0, this_expect=2] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-3, q=5, this_buffer_empty=0, this_expect=2] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-3, q=5, this_buffer_empty=0, this_expect=2] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-3, q=1, this_buffer_empty=1, this_expect=2] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=14, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=2] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=14, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=2] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=14, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=2] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=14, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=19, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=19, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=19, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=19, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=19, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=19, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=19, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=4] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=0, q=1, this_buffer_empty=1, this_expect=4] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-10, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=4] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-10, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=4] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-10, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=4] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-10, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=5] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=5] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=5, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=6] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=6] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=6] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-4, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=6] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-4, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=6] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-4, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=6] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-4, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=7] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=7] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=9, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=8] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=8] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=8] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=8] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=8] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=2, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=9] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=9] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=11, P2=-1, P3=0, P4=-1, P5=0, P6=-2, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=10] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=4, q=5, this_buffer_empty=0, this_expect=10] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=4, q=5, this_buffer_empty=0, this_expect=10] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=4, q=5, this_buffer_empty=0, this_expect=10] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=4, q=5, this_buffer_empty=0, this_expect=10] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=4, q=5, this_buffer_empty=0, this_expect=10] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=4, q=5, this_buffer_empty=0, this_expect=10] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=4, q=5, this_buffer_empty=0, this_expect=10] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=4, q=1, this_buffer_empty=1, this_expect=10] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-12, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=10] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-12, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=10] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-12, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=10] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-12, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=11] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=11] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=13, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=12] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=12] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-6, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=12] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-6, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=12] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-6, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=12] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-6, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=13] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=13] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=15, P2=-1, P3=0, P4=-1, P5=0, P6=1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=14] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=14] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-8, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=14] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-8, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=14] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-8, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=14] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-8, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=15] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=1, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=4, this_buffer_empty=1, this_expect=15] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=17, P2=-1, P3=0, P4=-1, P5=0, P6=-1, P7=0, P8=-1, P9=-1, q=5, this_buffer_empty=0, this_expect=16] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=1, q=1, this_buffer_empty=1, this_expect=16] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-14, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=16] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-14, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=16] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-14, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=1, this_buffer_empty=1, this_expect=16] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-14, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=17] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND TRUE this_expect > 16 [L39] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L286] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] [L569] __VERIFIER_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-1, P3=0, P4=-1, P5=0, P6=0, P7=0, P8=-1, P9=-1, q=3, this_buffer_empty=0, this_expect=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 115 locations, 1 error locations. UNSAFE Result, 64.9s OverallTime, 38 OverallIterations, 35 TraceHistogramMax, 17.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7168 SDtfs, 11228 SDslu, 29658 SDs, 0 SdLazy, 5455 SolverSat, 839 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6890 GetRequests, 6331 SyntacticMatches, 110 SemanticMatches, 449 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 27.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=856occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.8s AbstIntTime, 20 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 656 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 7089 NumberOfCodeBlocks, 6905 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 9818 ConstructedInterpolants, 484 QuantifiedInterpolants, 7429717 SizeOfPredicates, 84 NumberOfNonLiveVariables, 18557 ConjunctsInSsa, 447 ConjunctsInUnsatCore, 95 InterpolantComputations, 11 PerfectInterpolantSequences, 8950/34599 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...