java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:56:55,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:56:55,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:56:55,437 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:56:55,437 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:56:55,439 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:56:55,440 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:56:55,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:56:55,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:56:55,447 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:56:55,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:56:55,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:56:55,451 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:56:55,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:56:55,453 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:56:55,453 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:56:55,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:56:55,456 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:56:55,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:56:55,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:56:55,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:56:55,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:56:55,464 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:56:55,464 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:56:55,464 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:56:55,465 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:56:55,466 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:56:55,467 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:56:55,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:56:55,469 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:56:55,469 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:56:55,470 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:56:55,471 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:56:55,471 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:56:55,472 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:56:55,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:56:55,473 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:56:55,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:56:55,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:56:55,501 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:56:55,502 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:56:55,502 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:56:55,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:56:55,503 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:56:55,503 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:56:55,503 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:56:55,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:56:55,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:56:55,504 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:56:55,504 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:56:55,504 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:56:55,504 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:56:55,506 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:56:55,507 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:56:55,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:56:55,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:56:55,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:56:55,507 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:56:55,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:56:55,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:56:55,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:56:55,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:56:55,508 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:56:55,509 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:56:55,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:56:55,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:56:55,509 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:56:55,510 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:56:55,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:56:55,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:56:55,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:56:55,591 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:56:55,592 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:56:55,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2018-10-01 00:56:55,593 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-10-01 00:56:55,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:56:55,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:56:55,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:56:55,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:56:55,693 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:56:55,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/1) ... [2018-10-01 00:56:55,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/1) ... [2018-10-01 00:56:55,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:56:55,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:56:55,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:56:55,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:56:55,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/1) ... [2018-10-01 00:56:55,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/1) ... [2018-10-01 00:56:55,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/1) ... [2018-10-01 00:56:55,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/1) ... [2018-10-01 00:56:55,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/1) ... [2018-10-01 00:56:55,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/1) ... [2018-10-01 00:56:55,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/1) ... [2018-10-01 00:56:55,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:56:55,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:56:55,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:56:55,785 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:56:55,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:56:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:56:55,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:56:56,486 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:56:56,486 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:56:56 BoogieIcfgContainer [2018-10-01 00:56:56,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:56:56,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:56:56,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:56:56,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:56:56,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:55" (1/2) ... [2018-10-01 00:56:56,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adb974b and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:56:56, skipping insertion in model container [2018-10-01 00:56:56,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:56:56" (2/2) ... [2018-10-01 00:56:56,494 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-10-01 00:56:56,503 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:56:56,511 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:56:56,556 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:56:56,557 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:56:56,557 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:56:56,557 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:56:56,557 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:56:56,557 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:56:56,557 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:56:56,558 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:56:56,558 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:56:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-10-01 00:56:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:56:56,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:56,581 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:56,582 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:56,588 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:56,588 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-10-01 00:56:56,590 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:56,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:56,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:56,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:56,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:56,774 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-01 00:56:56,776 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:56,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:56,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:56,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:56,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:56,799 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-10-01 00:56:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:56,953 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2018-10-01 00:56:56,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:56,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-01 00:56:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:56,969 INFO L225 Difference]: With dead ends: 82 [2018-10-01 00:56:56,969 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 00:56:56,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:56,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 00:56:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-01 00:56:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 00:56:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-10-01 00:56:57,016 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 8 [2018-10-01 00:56:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:57,016 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2018-10-01 00:56:57,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-10-01 00:56:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:56:57,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:57,018 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:57,018 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:57,018 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:57,018 INFO L82 PathProgramCache]: Analyzing trace with hash 120520176, now seen corresponding path program 1 times [2018-10-01 00:56:57,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:57,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:57,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:57,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:57,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:56:57,084 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:57,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:57,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:57,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:57,087 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:57,087 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2018-10-01 00:56:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:57,240 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-10-01 00:56:57,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:57,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-01 00:56:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:57,242 INFO L225 Difference]: With dead ends: 98 [2018-10-01 00:56:57,242 INFO L226 Difference]: Without dead ends: 53 [2018-10-01 00:56:57,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-01 00:56:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-01 00:56:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 00:56:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2018-10-01 00:56:57,255 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2018-10-01 00:56:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:57,255 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-10-01 00:56:57,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2018-10-01 00:56:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:56:57,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:57,257 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:57,257 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:57,257 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1929846560, now seen corresponding path program 1 times [2018-10-01 00:56:57,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:57,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:57,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:56:57,328 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:57,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:57,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:57,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:57,329 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:57,330 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 3 states. [2018-10-01 00:56:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:57,435 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2018-10-01 00:56:57,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:57,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:56:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:57,440 INFO L225 Difference]: With dead ends: 105 [2018-10-01 00:56:57,440 INFO L226 Difference]: Without dead ends: 59 [2018-10-01 00:56:57,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-01 00:56:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-01 00:56:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 00:56:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-10-01 00:56:57,461 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 18 [2018-10-01 00:56:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:57,464 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2018-10-01 00:56:57,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-10-01 00:56:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:56:57,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:57,466 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:57,466 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:57,466 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:57,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1005370575, now seen corresponding path program 1 times [2018-10-01 00:56:57,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:57,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:57,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:57,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:57,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:56:57,575 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:57,575 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:57,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:57,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:57,576 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:57,576 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2018-10-01 00:56:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:57,701 INFO L93 Difference]: Finished difference Result 122 states and 187 transitions. [2018-10-01 00:56:57,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:57,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-01 00:56:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:57,703 INFO L225 Difference]: With dead ends: 122 [2018-10-01 00:56:57,703 INFO L226 Difference]: Without dead ends: 73 [2018-10-01 00:56:57,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-01 00:56:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-01 00:56:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 00:56:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-10-01 00:56:57,726 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 20 [2018-10-01 00:56:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:57,728 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-10-01 00:56:57,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-10-01 00:56:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:56:57,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:57,730 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:57,731 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:57,731 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash -880878013, now seen corresponding path program 1 times [2018-10-01 00:56:57,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:57,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:57,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:57,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:57,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:56:57,836 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:57,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:57,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:57,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:57,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:57,838 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-10-01 00:56:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:58,058 INFO L93 Difference]: Finished difference Result 145 states and 222 transitions. [2018-10-01 00:56:58,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:58,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-01 00:56:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:58,061 INFO L225 Difference]: With dead ends: 145 [2018-10-01 00:56:58,062 INFO L226 Difference]: Without dead ends: 104 [2018-10-01 00:56:58,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-01 00:56:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-01 00:56:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-01 00:56:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2018-10-01 00:56:58,086 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 22 [2018-10-01 00:56:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:58,087 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2018-10-01 00:56:58,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2018-10-01 00:56:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:56:58,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:58,088 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:58,089 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:58,089 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1639081921, now seen corresponding path program 1 times [2018-10-01 00:56:58,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:58,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:58,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:58,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:56:58,149 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:58,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:58,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:58,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:58,150 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:58,150 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand 3 states. [2018-10-01 00:56:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:58,286 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2018-10-01 00:56:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:58,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-01 00:56:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:58,288 INFO L225 Difference]: With dead ends: 235 [2018-10-01 00:56:58,288 INFO L226 Difference]: Without dead ends: 163 [2018-10-01 00:56:58,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-01 00:56:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-10-01 00:56:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-01 00:56:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2018-10-01 00:56:58,310 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 22 [2018-10-01 00:56:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:58,310 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2018-10-01 00:56:58,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2018-10-01 00:56:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 00:56:58,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:58,313 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:58,313 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:58,313 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:58,314 INFO L82 PathProgramCache]: Analyzing trace with hash 149370772, now seen corresponding path program 1 times [2018-10-01 00:56:58,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:58,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:58,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:58,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:58,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-01 00:56:58,392 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:58,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:58,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:58,393 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:58,393 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand 3 states. [2018-10-01 00:56:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:58,572 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2018-10-01 00:56:58,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:58,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-01 00:56:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:58,575 INFO L225 Difference]: With dead ends: 288 [2018-10-01 00:56:58,575 INFO L226 Difference]: Without dead ends: 164 [2018-10-01 00:56:58,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-01 00:56:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-10-01 00:56:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-01 00:56:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 243 transitions. [2018-10-01 00:56:58,599 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 243 transitions. Word has length 50 [2018-10-01 00:56:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:58,600 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 243 transitions. [2018-10-01 00:56:58,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 243 transitions. [2018-10-01 00:56:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 00:56:58,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:58,603 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:58,603 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:58,603 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:58,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1535574166, now seen corresponding path program 1 times [2018-10-01 00:56:58,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:58,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:58,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-01 00:56:58,719 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:58,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:58,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:58,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:58,720 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:58,720 INFO L87 Difference]: Start difference. First operand 164 states and 243 transitions. Second operand 3 states. [2018-10-01 00:56:59,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:59,109 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2018-10-01 00:56:59,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:59,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-01 00:56:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:59,111 INFO L225 Difference]: With dead ends: 312 [2018-10-01 00:56:59,111 INFO L226 Difference]: Without dead ends: 182 [2018-10-01 00:56:59,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:59,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-01 00:56:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-01 00:56:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-01 00:56:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2018-10-01 00:56:59,135 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 50 [2018-10-01 00:56:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:59,136 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2018-10-01 00:56:59,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2018-10-01 00:56:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 00:56:59,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:59,138 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:59,139 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:59,139 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:59,139 INFO L82 PathProgramCache]: Analyzing trace with hash -129315558, now seen corresponding path program 1 times [2018-10-01 00:56:59,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:59,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:59,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:59,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:59,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:56:59,238 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:59,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:59,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:59,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:59,239 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:59,239 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 3 states. [2018-10-01 00:56:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:59,500 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2018-10-01 00:56:59,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:59,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-01 00:56:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:59,502 INFO L225 Difference]: With dead ends: 345 [2018-10-01 00:56:59,502 INFO L226 Difference]: Without dead ends: 177 [2018-10-01 00:56:59,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-01 00:56:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-01 00:56:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-01 00:56:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2018-10-01 00:56:59,532 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 50 [2018-10-01 00:56:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:59,533 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2018-10-01 00:56:59,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2018-10-01 00:56:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:56:59,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:59,540 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:59,540 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:59,541 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1114557934, now seen corresponding path program 1 times [2018-10-01 00:56:59,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:59,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:59,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:59,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:59,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:56:59,671 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:59,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:59,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:59,672 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:59,673 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand 3 states. [2018-10-01 00:56:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:59,918 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2018-10-01 00:56:59,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:59,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-01 00:56:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:59,920 INFO L225 Difference]: With dead ends: 335 [2018-10-01 00:56:59,920 INFO L226 Difference]: Without dead ends: 174 [2018-10-01 00:56:59,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-01 00:56:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-10-01 00:56:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-01 00:56:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2018-10-01 00:56:59,940 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 52 [2018-10-01 00:56:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:59,940 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2018-10-01 00:56:59,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2018-10-01 00:56:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:56:59,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:59,942 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:59,942 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:59,942 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1372723372, now seen corresponding path program 1 times [2018-10-01 00:56:59,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:59,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:59,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:59,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:59,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:00,076 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:00,077 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:00,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:00,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-01 00:57:00,991 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:57:00,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-01 00:57:00,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:57:00,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:57:00,993 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:00,993 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 5 states. [2018-10-01 00:57:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:01,939 INFO L93 Difference]: Finished difference Result 451 states and 641 transitions. [2018-10-01 00:57:01,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:57:01,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-10-01 00:57:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:01,943 INFO L225 Difference]: With dead ends: 451 [2018-10-01 00:57:01,943 INFO L226 Difference]: Without dead ends: 293 [2018-10-01 00:57:01,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:57:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-01 00:57:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2018-10-01 00:57:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-01 00:57:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 388 transitions. [2018-10-01 00:57:01,993 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 388 transitions. Word has length 52 [2018-10-01 00:57:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:01,993 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 388 transitions. [2018-10-01 00:57:01,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:57:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 388 transitions. [2018-10-01 00:57:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:57:01,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:01,995 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:57:01,995 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:01,995 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:01,997 INFO L82 PathProgramCache]: Analyzing trace with hash -784981334, now seen corresponding path program 1 times [2018-10-01 00:57:01,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:01,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:01,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-01 00:57:02,152 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:57:02,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:57:02,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:57:02,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:57:02,153 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:02,154 INFO L87 Difference]: Start difference. First operand 284 states and 388 transitions. Second operand 3 states. [2018-10-01 00:57:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:02,490 INFO L93 Difference]: Finished difference Result 726 states and 990 transitions. [2018-10-01 00:57:02,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:57:02,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-01 00:57:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:02,495 INFO L225 Difference]: With dead ends: 726 [2018-10-01 00:57:02,495 INFO L226 Difference]: Without dead ends: 486 [2018-10-01 00:57:02,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:57:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-01 00:57:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 410. [2018-10-01 00:57:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-01 00:57:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 570 transitions. [2018-10-01 00:57:02,580 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 570 transitions. Word has length 52 [2018-10-01 00:57:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:02,581 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 570 transitions. [2018-10-01 00:57:02,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:57:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 570 transitions. [2018-10-01 00:57:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:57:02,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:02,584 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:57:02,584 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:02,584 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:02,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1664618796, now seen corresponding path program 1 times [2018-10-01 00:57:02,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:02,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:02,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:02,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:02,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-01 00:57:02,674 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:57:02,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:57:02,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:57:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:57:02,675 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:02,675 INFO L87 Difference]: Start difference. First operand 410 states and 570 transitions. Second operand 3 states. [2018-10-01 00:57:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:03,200 INFO L93 Difference]: Finished difference Result 782 states and 1089 transitions. [2018-10-01 00:57:03,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:57:03,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-01 00:57:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:03,203 INFO L225 Difference]: With dead ends: 782 [2018-10-01 00:57:03,204 INFO L226 Difference]: Without dead ends: 404 [2018-10-01 00:57:03,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:57:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-01 00:57:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-10-01 00:57:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-01 00:57:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 556 transitions. [2018-10-01 00:57:03,267 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 556 transitions. Word has length 52 [2018-10-01 00:57:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:03,268 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 556 transitions. [2018-10-01 00:57:03,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:57:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 556 transitions. [2018-10-01 00:57:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-01 00:57:03,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:03,269 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:57:03,270 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:03,270 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash -232860399, now seen corresponding path program 1 times [2018-10-01 00:57:03,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:03,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:03,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:03,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-01 00:57:03,352 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:57:03,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:57:03,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:57:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:57:03,353 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:03,353 INFO L87 Difference]: Start difference. First operand 404 states and 556 transitions. Second operand 3 states. [2018-10-01 00:57:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:03,670 INFO L93 Difference]: Finished difference Result 581 states and 795 transitions. [2018-10-01 00:57:03,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:57:03,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-10-01 00:57:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:03,673 INFO L225 Difference]: With dead ends: 581 [2018-10-01 00:57:03,673 INFO L226 Difference]: Without dead ends: 192 [2018-10-01 00:57:03,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:57:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-01 00:57:03,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2018-10-01 00:57:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-01 00:57:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2018-10-01 00:57:03,706 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 61 [2018-10-01 00:57:03,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:03,706 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2018-10-01 00:57:03,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:57:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2018-10-01 00:57:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-01 00:57:03,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:03,708 INFO L375 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:57:03,708 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:03,708 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:03,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1407140972, now seen corresponding path program 1 times [2018-10-01 00:57:03,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:03,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:03,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:03,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:03,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-01 00:57:03,872 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:57:03,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:57:03,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:57:03,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:57:03,872 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:03,873 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand 3 states. [2018-10-01 00:57:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:04,529 INFO L93 Difference]: Finished difference Result 430 states and 550 transitions. [2018-10-01 00:57:04,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:57:04,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-10-01 00:57:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:04,531 INFO L225 Difference]: With dead ends: 430 [2018-10-01 00:57:04,532 INFO L226 Difference]: Without dead ends: 273 [2018-10-01 00:57:04,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:57:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-01 00:57:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-10-01 00:57:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-01 00:57:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2018-10-01 00:57:04,575 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 75 [2018-10-01 00:57:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:04,575 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2018-10-01 00:57:04,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:57:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2018-10-01 00:57:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-01 00:57:04,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:04,577 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:57:04,577 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:04,577 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645264, now seen corresponding path program 1 times [2018-10-01 00:57:04,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:04,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:04,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-01 00:57:05,016 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:05,016 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:05,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:05,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-01 00:57:06,498 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:06,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:57:06,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:57:06,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:57:06,500 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:06,500 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 8 states. [2018-10-01 00:57:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:09,091 INFO L93 Difference]: Finished difference Result 1096 states and 1350 transitions. [2018-10-01 00:57:09,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:57:09,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-10-01 00:57:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:09,099 INFO L225 Difference]: With dead ends: 1096 [2018-10-01 00:57:09,099 INFO L226 Difference]: Without dead ends: 840 [2018-10-01 00:57:09,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:57:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-10-01 00:57:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 457. [2018-10-01 00:57:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-01 00:57:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 580 transitions. [2018-10-01 00:57:09,181 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 580 transitions. Word has length 75 [2018-10-01 00:57:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:09,182 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 580 transitions. [2018-10-01 00:57:09,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:57:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 580 transitions. [2018-10-01 00:57:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-01 00:57:09,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:09,183 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:57:09,184 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:09,184 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:09,184 INFO L82 PathProgramCache]: Analyzing trace with hash 44732949, now seen corresponding path program 1 times [2018-10-01 00:57:09,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:09,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:09,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:09,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:09,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-01 00:57:09,266 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:57:09,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:57:09,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:57:09,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:57:09,267 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:09,267 INFO L87 Difference]: Start difference. First operand 457 states and 580 transitions. Second operand 3 states. [2018-10-01 00:57:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:09,380 INFO L93 Difference]: Finished difference Result 702 states and 883 transitions. [2018-10-01 00:57:09,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:57:09,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-10-01 00:57:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:09,384 INFO L225 Difference]: With dead ends: 702 [2018-10-01 00:57:09,384 INFO L226 Difference]: Without dead ends: 259 [2018-10-01 00:57:09,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:57:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-01 00:57:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-10-01 00:57:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-01 00:57:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 313 transitions. [2018-10-01 00:57:09,430 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 313 transitions. Word has length 82 [2018-10-01 00:57:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:09,430 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 313 transitions. [2018-10-01 00:57:09,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:57:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 313 transitions. [2018-10-01 00:57:09,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-01 00:57:09,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:09,432 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:57:09,432 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:09,432 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:09,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1071152936, now seen corresponding path program 2 times [2018-10-01 00:57:09,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:09,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:09,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:09,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:09,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-01 00:57:09,563 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:09,563 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:09,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:57:09,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:57:09,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:09,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-01 00:57:09,743 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:57:09,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-01 00:57:09,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:57:09,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:57:09,744 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:09,744 INFO L87 Difference]: Start difference. First operand 257 states and 313 transitions. Second operand 5 states. [2018-10-01 00:57:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:10,077 INFO L93 Difference]: Finished difference Result 549 states and 665 transitions. [2018-10-01 00:57:10,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:57:10,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-10-01 00:57:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:10,079 INFO L225 Difference]: With dead ends: 549 [2018-10-01 00:57:10,080 INFO L226 Difference]: Without dead ends: 306 [2018-10-01 00:57:10,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:57:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-01 00:57:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 251. [2018-10-01 00:57:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-01 00:57:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2018-10-01 00:57:10,128 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 102 [2018-10-01 00:57:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:10,128 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2018-10-01 00:57:10,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:57:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2018-10-01 00:57:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-01 00:57:10,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:10,130 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:57:10,130 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:10,130 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2108568021, now seen corresponding path program 3 times [2018-10-01 00:57:10,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:10,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:10,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:10,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:10,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-01 00:57:10,278 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:10,278 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:10,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:57:10,346 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-01 00:57:10,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:10,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-01 00:57:10,416 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:57:10,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-01 00:57:10,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:57:10,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:57:10,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:10,417 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand 4 states. [2018-10-01 00:57:10,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:10,520 INFO L93 Difference]: Finished difference Result 397 states and 473 transitions. [2018-10-01 00:57:10,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:57:10,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-01 00:57:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:10,521 INFO L225 Difference]: With dead ends: 397 [2018-10-01 00:57:10,521 INFO L226 Difference]: Without dead ends: 160 [2018-10-01 00:57:10,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:57:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-01 00:57:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-10-01 00:57:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-01 00:57:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2018-10-01 00:57:10,567 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 102 [2018-10-01 00:57:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:10,568 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2018-10-01 00:57:10,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:57:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2018-10-01 00:57:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-01 00:57:10,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:10,570 INFO L375 BasicCegarLoop]: trace histogram [9, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:57:10,570 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:10,570 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:10,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1804980960, now seen corresponding path program 4 times [2018-10-01 00:57:10,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:10,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:10,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 177 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-01 00:57:10,779 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:10,779 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:10,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:57:10,871 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:57:10,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:10,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-01 00:57:11,000 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:57:11,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-01 00:57:11,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:57:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:57:11,000 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:11,001 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand 5 states. [2018-10-01 00:57:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:11,073 INFO L93 Difference]: Finished difference Result 231 states and 259 transitions. [2018-10-01 00:57:11,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:57:11,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-10-01 00:57:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:11,073 INFO L225 Difference]: With dead ends: 231 [2018-10-01 00:57:11,074 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:57:11,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:57:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:57:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:57:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:57:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:57:11,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2018-10-01 00:57:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:11,075 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:57:11,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:57:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:57:11,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:57:11,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:57:11,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:11,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:57:13,909 WARN L178 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2018-10-01 00:57:14,413 WARN L178 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-10-01 00:57:14,775 WARN L178 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2018-10-01 00:57:15,388 WARN L178 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2018-10-01 00:57:15,911 WARN L178 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2018-10-01 00:57:16,059 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-10-01 00:57:16,435 WARN L178 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-10-01 00:57:16,662 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-10-01 00:57:16,801 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-10-01 00:57:16,951 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-10-01 00:57:17,997 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2018-10-01 00:57:18,369 WARN L178 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2018-10-01 00:57:18,659 WARN L178 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-10-01 00:57:18,871 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2018-10-01 00:57:19,030 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-10-01 00:57:19,399 WARN L178 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-10-01 00:57:19,672 WARN L178 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-10-01 00:57:19,978 WARN L178 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2018-10-01 00:57:20,421 WARN L178 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-10-01 00:57:20,629 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-10-01 00:57:21,181 WARN L178 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-10-01 00:57:23,011 WARN L178 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-10-01 00:57:23,310 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-10-01 00:57:23,555 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-10-01 00:57:23,728 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-10-01 00:57:24,161 WARN L178 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2018-10-01 00:57:25,049 WARN L178 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-10-01 00:57:25,322 WARN L178 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-10-01 00:57:25,326 INFO L422 ceAbstractionStarter]: At program point L192(lines 166 192) the Hoare annotation is: (let ((.cse17 (+ ~t_b 2))) (let ((.cse9 (<= ~c_t .cse17)) (.cse2 (<= 1 ~c1_pc)) (.cse10 (= ~wl_pc 2)) (.cse11 (<= ~c .cse17)) (.cse12 (<= .cse17 ~c_t)) (.cse13 (<= 1 ~processed)) (.cse6 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse14 (<= .cse17 ~c)) (.cse1 (= ~wb_pc 1)) (.cse15 (<= ~data .cse17)) (.cse16 (<= .cse17 ~data)) (.cse5 (<= 2 ~r_st)) (.cse0 (not (= ~e_c 1))) (.cse3 (<= 2 ~e_wl)) (.cse4 (= ~wl_st 0)) (.cse7 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) (and .cse9 .cse2 .cse10 (<= 2 ~wl_st) .cse11 .cse12 .cse13 .cse6 .cse8 .cse14 .cse0 .cse1 .cse15 .cse3 .cse16 .cse7) (and .cse9 .cse2 .cse10 .cse11 .cse5 .cse12 .cse13 (<= ~d .cse17) .cse6 .cse8 .cse14 (<= .cse17 ~d) .cse0 .cse1 .cse15 .cse3 .cse4 .cse16 .cse7) (and .cse5 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse0 .cse3 .cse4 (< ~c (+ ~c_t 1)) .cse7)))) [2018-10-01 00:57:25,326 INFO L422 ceAbstractionStarter]: At program point L448(lines 445 454) the Hoare annotation is: (let ((.cse7 (<= 2 ~c2_st)) (.cse3 (<= 2 ~e_wl)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse4 (<= 2 ~r_st)) (.cse5 (<= 1 ~c2_pc)) (.cse6 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7) (let ((.cse8 (+ ~t_b 2))) (and (<= ~c_t .cse8) .cse2 (= ~wl_pc 2) .cse9 (<= ~c .cse8) (<= .cse8 ~c_t) (<= 1 ~processed) .cse5 .cse7 (<= .cse8 ~c) .cse0 .cse1 (<= ~data .cse8) .cse3 (<= .cse8 ~data) .cse6)) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse6))) [2018-10-01 00:57:25,326 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 423) the Hoare annotation is: (let ((.cse15 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse0 (<= 1 ~c1_pc)) (.cse2 (= ~wl_pc 2)) (.cse1 (<= 2 ~wl_st)) (.cse3 (<= ~c .cse15)) (.cse5 (<= 1 ~processed)) (.cse6 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse8 (<= .cse15 ~c)) (.cse14 (not (= ~e_c 1))) (.cse9 (= ~wb_pc 1)) (.cse10 (<= ~data .cse15)) (.cse11 (<= 2 ~e_wl)) (.cse12 (<= .cse15 ~data)) (.cse13 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_t ~c) .cse9 .cse10 .cse11 (< ~c (+ ~c_t 1)) .cse12 .cse13) (and .cse14 .cse9 .cse0 .cse1 .cse4 .cse6 .cse13) (and (and (not (= ~c1_st 0)) (and (= ~wl_pc 1) .cse14 .cse9 .cse0 (= ~wl_st 0) .cse4 .cse6 .cse13) (= ~e_wl 1)) .cse7) (and (<= ~c_t .cse15) .cse0 .cse2 .cse1 .cse3 (<= .cse15 ~c_t) .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 (<= 2 ~c1_st) .cse12 .cse13)))) [2018-10-01 00:57:25,326 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 53 461) no Hoare annotation was computed. [2018-10-01 00:57:25,326 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 53 461) no Hoare annotation was computed. [2018-10-01 00:57:25,327 INFO L422 ceAbstractionStarter]: At program point L408(lines 403 409) the Hoare annotation is: (let ((.cse7 (+ ~t_b 2))) (let ((.cse0 (not (= ~e_c 1))) (.cse2 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse8 (= ~wl_pc 2)) (.cse10 (<= ~c .cse7)) (.cse3 (<= 2 ~r_st)) (.cse11 (<= 1 ~processed)) (.cse4 (<= 1 ~c2_pc)) (.cse6 (<= 2 ~c2_st)) (.cse12 (<= .cse7 ~c)) (.cse1 (= ~wb_pc 1)) (.cse13 (<= ~data .cse7)) (.cse14 (<= 2 ~e_wl)) (.cse15 (<= .cse7 ~data)) (.cse5 (not (= ~e_c 0)))) (or (and (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse3 .cse4 .cse5) (= ~e_wl 1)) .cse6) (and (<= ~c_t .cse7) .cse2 .cse8 .cse9 .cse10 (<= .cse7 ~c_t) .cse11 .cse4 .cse6 .cse12 .cse0 .cse1 .cse13 .cse14 .cse15 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse2 .cse9 .cse8 .cse10 .cse3 .cse11 .cse4 .cse6 .cse12 (<= ~c_t ~c) .cse1 .cse13 .cse14 (< ~c (+ ~c_t 1)) (<= 2 ~c1_st) .cse15 .cse5)))) [2018-10-01 00:57:25,327 INFO L422 ceAbstractionStarter]: At program point L342(lines 339 388) the Hoare annotation is: (let ((.cse2 (+ ~t_b 2)) (.cse5 (<= 2 ~wl_st)) (.cse11 (not (= ~e_c 1))) (.cse12 (= ~wb_pc 1)) (.cse3 (<= 1 ~c1_pc)) (.cse16 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse15 (not (= ~e_c 0)))) (let ((.cse1 (or (and .cse11 .cse12 .cse3 .cse5 .cse16 .cse8 .cse15) (and .cse11 .cse12 (= ~wl_pc 1) .cse3 .cse16 .cse8 .cse15))) (.cse4 (= ~wl_pc 2)) (.cse6 (<= ~c .cse2)) (.cse7 (<= 1 ~processed)) (.cse9 (<= 2 ~c2_st)) (.cse10 (<= .cse2 ~c)) (.cse13 (<= ~data .cse2)) (.cse0 (<= 2 ~e_wl)) (.cse14 (<= .cse2 ~data))) (or (and .cse0 .cse1) (and (<= ~c_t .cse2) .cse3 .cse4 .cse5 .cse6 (<= .cse2 ~c_t) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse0 .cse14 .cse15) (and .cse1 .cse9) (= ~wl_pc 0) (and .cse3 .cse5 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 (<= ~c_t ~c) .cse12 .cse13 .cse0 (< ~c (+ ~c_t 1)) (<= 2 ~c1_st) .cse14 .cse15)))) [2018-10-01 00:57:25,327 INFO L422 ceAbstractionStarter]: At program point L334(lines 296 340) the Hoare annotation is: (let ((.cse15 (+ ~t_b 2)) (.cse3 (<= 2 ~wl_st)) (.cse10 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse6 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse16 (not (= ~e_c 0)))) (let ((.cse0 (or (and .cse10 .cse11 .cse2 .cse3 .cse6 .cse8 .cse16) (and .cse10 .cse11 (= ~wl_pc 1) .cse2 .cse6 .cse8 .cse16))) (.cse4 (= ~wl_pc 2)) (.cse5 (<= ~c .cse15)) (.cse7 (<= 1 ~processed)) (.cse1 (<= 2 ~c2_st)) (.cse9 (<= .cse15 ~c)) (.cse12 (<= ~data .cse15)) (.cse13 (<= 2 ~e_wl)) (.cse14 (<= .cse15 ~data))) (or (and (and (not (= ~c1_st 0)) .cse0) .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (<= ~c_t ~c) .cse10 .cse11 .cse12 .cse13 (< ~c (+ ~c_t 1)) .cse14) (and .cse13 .cse0) (= ~wl_pc 0) (and (<= ~c_t .cse15) .cse2 .cse4 .cse3 .cse5 (<= .cse15 ~c_t) .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 ~c1_st) .cse14 .cse16)))) [2018-10-01 00:57:25,327 INFO L422 ceAbstractionStarter]: At program point L425(lines 422 426) the Hoare annotation is: (let ((.cse7 (+ ~t_b 2))) (let ((.cse8 (= ~wl_pc 2)) (.cse10 (<= ~c .cse7)) (.cse11 (<= 1 ~processed)) (.cse6 (<= 2 ~c2_st)) (.cse12 (<= .cse7 ~c)) (.cse13 (<= ~data .cse7)) (.cse14 (<= 2 ~e_wl)) (.cse15 (<= .cse7 ~data)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse3 (<= 2 ~r_st)) (.cse4 (<= 1 ~c2_pc)) (.cse5 (not (= ~e_c 0)))) (or (and (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse3 .cse4 .cse5) (= ~e_wl 1)) .cse6) (and (<= ~c_t .cse7) .cse2 .cse8 .cse9 .cse10 (<= .cse7 ~c_t) .cse11 .cse4 .cse6 .cse12 .cse0 .cse1 .cse13 .cse14 .cse15 .cse5) (and .cse2 .cse9 .cse8 .cse10 .cse11 .cse4 .cse6 .cse12 (<= ~c_t ~c) .cse1 .cse13 .cse14 (< ~c (+ ~c_t 1)) (<= 2 ~c1_st) .cse15 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5)))) [2018-10-01 00:57:25,328 INFO L422 ceAbstractionStarter]: At program point L161(lines 161 167) the Hoare annotation is: (let ((.cse21 (+ ~t_b 2))) (let ((.cse0 (= ~wl_pc 1)) (.cse15 (<= ~c .cse21)) (.cse18 (<= .cse21 ~c)) (.cse9 (<= ~c_t ~c)) (.cse12 (= ~wl_st 0)) (.cse5 (< ~c (+ ~c_t 1))) (.cse13 (<= ~c_t .cse21)) (.cse3 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~wl_st)) (.cse14 (= ~wl_pc 2)) (.cse6 (<= 2 ~r_st)) (.cse16 (<= .cse21 ~c_t)) (.cse17 (<= 1 ~processed)) (.cse7 (<= 1 ~c2_pc)) (.cse10 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse19 (<= ~data .cse21)) (.cse11 (<= 2 ~e_wl)) (.cse20 (<= .cse21 ~data)) (.cse8 (not (= ~e_c 0)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse6 .cse7 .cse8) .cse10) (and .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse17 .cse7 .cse10 .cse18 .cse1 .cse2 .cse19 .cse11 .cse20 .cse8) (and .cse13 .cse3 .cse14 .cse15 .cse6 .cse16 .cse17 (<= ~d .cse21) .cse7 .cse10 .cse18 (<= .cse21 ~d) .cse1 .cse2 .cse19 .cse11 .cse12 .cse20 .cse8) (and .cse6 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) .cse9 (= ~c2_st 0) .cse1 .cse11 .cse12 .cse5 .cse8) (and .cse13 .cse3 .cse4 .cse14 .cse6 .cse16 .cse17 .cse7 .cse10 .cse1 .cse2 .cse19 .cse11 .cse20 .cse8)))) [2018-10-01 00:57:25,328 INFO L422 ceAbstractionStarter]: At program point L318(lines 307 343) the Hoare annotation is: (let ((.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse3 (= ~wb_st 0)) (.cse4 (not (= ~e_c 1))) (.cse5 (not (= ~c2_st 0))) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 (<= ~t_b ~data) .cse3 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse4 (< ~c (+ ~c_t 1)) .cse5 .cse6) (let ((.cse7 (+ ~t_b 2))) (and .cse0 (= ~wl_pc 2) .cse1 .cse2 .cse3 (<= 1 ~c2_pc) .cse4 (= ~wb_pc 1) (<= ~data .cse7) (<= 2 ~e_wl) .cse5 .cse6 (<= .cse7 ~data))))) [2018-10-01 00:57:25,328 INFO L422 ceAbstractionStarter]: At program point L302(lines 209 302) the Hoare annotation is: (let ((.cse3 (<= 2 ~r_st)) (.cse4 (= ~wb_st 0)) (.cse7 (= ~c2_st 0)) (.cse0 (<= 1 ~c1_pc)) (.cse1 (= ~wl_pc 2)) (.cse2 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse8 (not (= ~e_c 1))) (.cse9 (= ~wb_pc 1)) (.cse10 (<= 2 ~e_wl)) (.cse11 (not (= ~e_c 0)))) (or (let ((.cse6 (+ ~t_b 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~data .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse6 ~data))) (and .cse0 .cse2 .cse3 (<= ~t_b ~data) .cse4 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) .cse7 (= ~wl_pc 1) .cse8 (< ~c (+ ~c_t 1)) .cse11) (let ((.cse12 (+ ~t_b 2))) (and (<= ~c_t .cse12) .cse0 .cse1 .cse2 (<= ~c .cse12) (<= .cse12 ~c_t) (<= 1 ~processed) .cse5 (<= 2 ~c2_st) (<= .cse12 ~c) .cse8 .cse9 (<= ~data .cse12) .cse10 (<= .cse12 ~data) .cse11)))) [2018-10-01 00:57:25,328 INFO L422 ceAbstractionStarter]: At program point L360(lines 353 391) the Hoare annotation is: (let ((.cse7 (+ ~t_b 2))) (let ((.cse4 (<= ~c .cse7)) (.cse9 (<= .cse7 ~c)) (.cse1 (<= ~c_t .cse7)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse15 (= ~wl_pc 2)) (.cse5 (<= 2 ~r_st)) (.cse6 (<= .cse7 ~c_t)) (.cse16 (<= 1 ~processed)) (.cse8 (<= 1 ~c2_pc)) (.cse0 (<= 2 ~c2_st)) (.cse11 (not (= ~e_c 1))) (.cse17 (= ~wb_pc 1)) (.cse12 (<= ~data .cse7)) (.cse18 (<= 2 ~e_wl)) (.cse14 (<= .cse7 ~data)) (.cse13 (not (= ~e_c 0)))) (or (and .cse0 (let ((.cse10 (= ~wl_pc 1))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~d .cse7) .cse8 .cse9 (<= .cse7 ~d) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse10 .cse11 .cse2 .cse3 .cse5 (< ~c (+ ~c_t 1)) (<= ~t_b ~data) .cse8 (<= ~data ~t_b) .cse13 (= ~wb_pc 0) (<= ~c_t ~c))))) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse8 .cse0 .cse9 .cse11 .cse17 .cse12 .cse18 .cse14 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse16 .cse8 .cse0 .cse11 .cse17 .cse12 .cse18 .cse14 .cse13)))) [2018-10-01 00:57:25,329 INFO L422 ceAbstractionStarter]: At program point L220(lines 220 271) the Hoare annotation is: (and (let ((.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse3 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~e_wl)) (.cse5 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse7 (not (= ~e_c 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= .cse0 ~d) .cse1 .cse2 .cse3 .cse4 (<= ~c .cse0) .cse5 (<= ~d .cse0) .cse6 (<= .cse0 ~c) .cse7)) (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (<= 2 ~c2_st)) [2018-10-01 00:57:25,329 INFO L422 ceAbstractionStarter]: At program point L187(lines 187 218) the Hoare annotation is: (let ((.cse2 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~r_st)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse3 (<= 2 ~e_wl)) (.cse6 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (and .cse4 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse0 .cse3 (< ~c (+ ~c_t 1)) .cse6) (let ((.cse8 (+ ~t_b 2))) (and (<= ~c_t .cse8) .cse2 (= ~wl_pc 2) (<= ~c .cse8) .cse4 (<= .cse8 ~c_t) (<= 1 ~processed) (<= ~d .cse8) .cse5 .cse7 (<= .cse8 ~c) (<= .cse8 ~d) .cse0 .cse1 (<= ~data .cse8) .cse3 (<= .cse8 ~data) .cse6)))) [2018-10-01 00:57:25,329 INFO L422 ceAbstractionStarter]: At program point L270(lines 270 332) the Hoare annotation is: false [2018-10-01 00:57:25,329 INFO L422 ceAbstractionStarter]: At program point L460(lines 146 460) the Hoare annotation is: (let ((.cse2 (<= 1 ~c1_pc)) (.cse6 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse1 (= ~wb_pc 1)) (.cse5 (<= 2 ~r_st)) (.cse0 (not (= ~e_c 1))) (.cse3 (<= 2 ~e_wl)) (.cse4 (= ~wl_st 0)) (.cse7 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) (let ((.cse9 (+ ~t_b 2))) (and (<= ~c_t .cse9) .cse2 (= ~wl_pc 2) (<= 2 ~wl_st) (<= ~c .cse9) (<= .cse9 ~c_t) (<= 1 ~processed) .cse6 .cse8 (<= .cse9 ~c) .cse0 .cse1 (<= ~data .cse9) .cse3 (<= .cse9 ~data) .cse7)) (and .cse5 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse0 .cse3 .cse4 (< ~c (+ ~c_t 1)) .cse7))) [2018-10-01 00:57:25,329 INFO L422 ceAbstractionStarter]: At program point L328(lines 328 354) the Hoare annotation is: (let ((.cse12 (+ ~t_b 2))) (let ((.cse7 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse5 (= ~wl_pc 2)) (.cse6 (<= 2 ~wl_st)) (.cse8 (<= 1 ~c2_pc)) (.cse9 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse2 (<= ~data .cse12)) (.cse4 (<= 2 ~e_wl)) (.cse11 (not (= ~e_c 0))) (.cse10 (<= .cse12 ~data))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse3 .cse6 .cse7 (<= ~t_b ~data) .cse8 (<= ~data ~t_b) .cse9 (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse0 (< ~c (+ ~c_t 1)) .cse11) (and (<= ~c_t .cse12) .cse3 .cse5 (<= ~c .cse12) .cse6 (<= .cse12 ~c_t) (<= 1 ~processed) .cse8 .cse9 (<= .cse12 ~c) .cse0 .cse1 .cse2 .cse4 .cse11 .cse10)))) [2018-10-01 00:57:25,330 INFO L422 ceAbstractionStarter]: At program point L196(lines 196 226) the Hoare annotation is: (let ((.cse4 (+ ~t_b 2))) (let ((.cse0 (<= ~c_t .cse4)) (.cse1 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse2 (= ~wl_pc 2)) (.cse15 (<= 2 ~r_st)) (.cse5 (<= .cse4 ~c_t)) (.cse6 (<= 1 ~processed)) (.cse7 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse9 (not (= ~e_c 1))) (.cse10 (= ~wb_pc 1)) (.cse11 (<= ~data .cse4)) (.cse12 (<= 2 ~e_wl)) (.cse13 (<= .cse4 ~data)) (.cse14 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~c .cse4) .cse5 .cse6 .cse7 .cse8 (<= .cse4 ~c) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse8 (and .cse9 .cse10 (= ~wl_pc 1) .cse1 (< ~c (+ ~c_t 1)) .cse15 .cse7 .cse14 (<= ~c_t ~c))) (= ~wl_pc 0) (and .cse0 .cse1 .cse3 .cse2 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2018-10-01 00:57:25,330 INFO L422 ceAbstractionStarter]: At program point L172(lines 172 193) the Hoare annotation is: (let ((.cse16 (+ ~t_b 2))) (let ((.cse3 (<= 2 ~r_st)) (.cse7 (<= ~c_t .cse16)) (.cse2 (<= 1 ~c1_pc)) (.cse9 (= ~wl_pc 2)) (.cse8 (<= 2 ~wl_st)) (.cse10 (<= .cse16 ~c_t)) (.cse11 (<= 1 ~processed)) (.cse4 (<= 1 ~c2_pc)) (.cse6 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse12 (<= ~data .cse16)) (.cse13 (<= 2 ~e_wl)) (.cse14 (<= 2 ~c1_st)) (.cse15 (<= .cse16 ~data)) (.cse5 (not (= ~e_c 0)))) (or (and (and (not (= ~c1_st 0)) (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 (< ~c (+ ~c_t 1)) .cse4 .cse5 (<= ~c_t ~c))) .cse6) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse6 .cse0 .cse1 .cse12 .cse13 .cse14 .cse15 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~wl_pc 0) .cse5) (and .cse7 .cse2 .cse9 .cse8 (<= ~c .cse16) .cse10 .cse11 .cse4 .cse6 (<= .cse16 ~c) .cse0 .cse1 .cse12 .cse13 .cse14 .cse15 .cse5)))) [2018-10-01 00:57:25,330 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 333) no Hoare annotation was computed. [2018-10-01 00:57:25,330 INFO L422 ceAbstractionStarter]: At program point L206(lines 206 238) the Hoare annotation is: (let ((.cse0 (<= 2 ~wl_st)) (.cse1 (<= 2 ~r_st)) (.cse2 (<= ~t_b ~data)) (.cse3 (<= ~data ~t_b)) (.cse4 (= ~c2_st 0)) (.cse5 (not (= ~e_c 1))) (.cse6 (not (= ~c1_st 0))) (.cse7 (not (= ~e_c 0)))) (or (and (<= 1 ~c1_pc) (= ~wl_pc 2) .cse0 .cse1 .cse2 (<= 1 ~c2_pc) .cse3 .cse4 .cse5 (= ~wb_pc 1) .cse6 (<= 2 ~e_wl) .cse7) (and .cse0 .cse1 .cse2 (= ~wb_st 0) .cse3 (= ~wb_pc 0) (<= ~c_t ~c) .cse4 (= ~wl_pc 1) .cse5 .cse6 (< ~c (+ ~c_t 1)) .cse7))) [2018-10-01 00:57:25,331 INFO L422 ceAbstractionStarter]: At program point L396(lines 331 396) the Hoare annotation is: (let ((.cse10 (+ ~t_b 2))) (let ((.cse8 (<= ~c_t .cse10)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse9 (= ~wl_pc 2)) (.cse4 (<= 2 ~r_st)) (.cse11 (<= .cse10 ~c_t)) (.cse12 (<= 1 ~processed)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse13 (<= ~data .cse10)) (.cse14 (<= 2 ~e_wl)) (.cse15 (<= .cse10 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 (< ~c (+ ~c_t 1)) .cse4 .cse5 .cse6 (<= ~c_t ~c)) .cse7) (and .cse8 .cse2 .cse9 .cse3 (<= ~c .cse10) .cse11 .cse12 .cse5 .cse7 (<= .cse10 ~c) .cse0 .cse1 .cse13 .cse14 .cse15 .cse6) (and .cse8 .cse2 .cse3 .cse9 .cse4 .cse11 .cse12 .cse5 .cse7 .cse0 .cse1 .cse13 .cse14 .cse15 .cse6)))) [2018-10-01 00:57:25,331 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 53 461) no Hoare annotation was computed. [2018-10-01 00:57:25,331 INFO L422 ceAbstractionStarter]: At program point L248(lines 237 297) the Hoare annotation is: (let ((.cse0 (<= 2 ~wl_st)) (.cse1 (<= 2 ~r_st)) (.cse2 (= ~wb_st 0)) (.cse4 (= ~c2_st 0)) (.cse5 (not (= ~e_c 1))) (.cse6 (not (= ~c1_st 0))) (.cse7 (not (= ~e_c 0)))) (or (let ((.cse3 (+ ~t_b 1))) (and (<= 1 ~c1_pc) (= ~wl_pc 2) .cse0 .cse1 .cse2 (<= 1 ~c2_pc) (<= ~data .cse3) .cse4 .cse5 (= ~wb_pc 1) .cse6 (<= 2 ~e_wl) .cse7 (<= .cse3 ~data))) (and .cse0 .cse1 (<= ~t_b ~data) .cse2 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) .cse4 (= ~wl_pc 1) .cse5 .cse6 (< ~c (+ ~c_t 1)) .cse7))) [2018-10-01 00:57:25,331 INFO L422 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (let ((.cse0 (not (= ~e_c 1))) (.cse4 (<= 2 ~r_st)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse1 (= ~wb_pc 1)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (and (not (= ~c1_st 0)) (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse4 .cse5 .cse6) (= ~e_wl 1)) .cse7) (let ((.cse8 (+ ~t_b 2))) (and .cse2 .cse3 (= ~wl_pc 2) (<= ~c .cse8) (<= 1 ~processed) .cse5 .cse7 (<= .cse8 ~c) (<= ~c_t ~c) .cse1 (<= ~data .cse8) (<= 2 ~e_wl) (< ~c (+ ~c_t 1)) (<= .cse8 ~data) .cse6)))) [2018-10-01 00:57:25,331 INFO L422 ceAbstractionStarter]: At program point L232(lines 225 291) the Hoare annotation is: (let ((.cse1 (<= 2 ~wl_st)) (.cse9 (not (= ~e_c 1))) (.cse10 (= ~wb_pc 1)) (.cse0 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse16 (not (= ~e_c 0))) (.cse15 (+ ~t_b 2))) (let ((.cse2 (= ~wl_pc 2)) (.cse3 (<= ~c .cse15)) (.cse5 (<= 1 ~processed)) (.cse8 (<= .cse15 ~c)) (.cse11 (<= ~data .cse15)) (.cse12 (<= 2 ~e_wl)) (.cse13 (<= .cse15 ~data)) (.cse14 (or (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse6 .cse16) (and .cse9 .cse10 (= ~wl_pc 1) .cse0 .cse4 .cse6 .cse16))) (.cse7 (<= 2 ~c2_st))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_t ~c) .cse9 .cse10 .cse11 .cse12 (< ~c (+ ~c_t 1)) (<= 2 ~c1_st) .cse13) (and .cse12 .cse14) (and (<= ~c_t .cse15) .cse0 .cse2 .cse1 .cse3 (<= .cse15 ~c_t) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16) (and .cse14 .cse7) (= ~wl_pc 0)))) [2018-10-01 00:57:25,331 INFO L422 ceAbstractionStarter]: At program point L290(lines 177 290) the Hoare annotation is: (let ((.cse3 (<= 2 ~r_st)) (.cse4 (<= ~t_b ~data)) (.cse5 (= ~c1_st 0)) (.cse7 (<= ~data ~t_b)) (.cse8 (= ~c2_st 0)) (.cse0 (<= 1 ~c1_pc)) (.cse1 (= ~wl_pc 2)) (.cse2 (<= 2 ~wl_st)) (.cse6 (<= 1 ~c2_pc)) (.cse9 (not (= ~e_c 1))) (.cse10 (= ~wb_pc 1)) (.cse11 (<= 2 ~e_wl)) (.cse12 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse5 (= ~wb_st 0) .cse7 (= ~wb_pc 0) (<= ~c_t ~c) .cse8 (= ~wl_pc 1) .cse9 (< ~c (+ ~c_t 1)) .cse12) (let ((.cse13 (+ ~t_b 2))) (and (<= ~c_t .cse13) .cse0 .cse1 .cse2 (<= ~c .cse13) (<= .cse13 ~c_t) (<= 1 ~processed) .cse6 (<= 2 ~c2_st) (<= .cse13 ~c) .cse9 .cse10 (<= ~data .cse13) .cse11 (<= 2 ~c1_st) (<= .cse13 ~data) .cse12)))) [2018-10-01 00:57:25,332 INFO L422 ceAbstractionStarter]: At program point L381(lines 157 381) the Hoare annotation is: (let ((.cse21 (+ ~t_b 2))) (let ((.cse0 (= ~wl_pc 1)) (.cse15 (<= ~c .cse21)) (.cse18 (<= .cse21 ~c)) (.cse9 (<= ~c_t ~c)) (.cse12 (= ~wl_st 0)) (.cse5 (< ~c (+ ~c_t 1))) (.cse13 (<= ~c_t .cse21)) (.cse3 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~wl_st)) (.cse14 (= ~wl_pc 2)) (.cse6 (<= 2 ~r_st)) (.cse16 (<= .cse21 ~c_t)) (.cse17 (<= 1 ~processed)) (.cse7 (<= 1 ~c2_pc)) (.cse10 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse19 (<= ~data .cse21)) (.cse11 (<= 2 ~e_wl)) (.cse20 (<= .cse21 ~data)) (.cse8 (not (= ~e_c 0)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse6 .cse7 .cse8) .cse10) (and .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse17 .cse7 .cse10 .cse18 .cse1 .cse2 .cse19 .cse11 .cse20 .cse8) (and .cse13 .cse3 .cse14 .cse15 .cse6 .cse16 .cse17 (<= ~d .cse21) .cse7 .cse10 .cse18 (<= .cse21 ~d) .cse1 .cse2 .cse19 .cse11 .cse12 .cse20 .cse8) (and .cse6 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) .cse9 (= ~c2_st 0) .cse1 .cse11 .cse12 .cse5 .cse8) (and .cse13 .cse3 .cse4 .cse14 .cse6 .cse16 .cse17 .cse7 .cse10 .cse1 .cse2 .cse19 .cse11 .cse20 .cse8)))) [2018-10-01 00:57:25,332 INFO L422 ceAbstractionStarter]: At program point L348(lines 261 348) the Hoare annotation is: (let ((.cse13 (+ ~t_b 2))) (let ((.cse1 (= ~wl_pc 2)) (.cse8 (= ~wb_pc 1)) (.cse9 (<= ~data .cse13)) (.cse10 (<= 2 ~e_wl)) (.cse12 (<= .cse13 ~data)) (.cse0 (<= 1 ~c1_pc)) (.cse2 (<= 2 ~wl_st)) (.cse3 (<= 2 ~r_st)) (.cse4 (= ~wb_st 0)) (.cse5 (<= 1 ~c2_pc)) (.cse6 (<= 2 ~c2_st)) (.cse7 (not (= ~e_c 1))) (.cse11 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ~c_t .cse13) .cse0 .cse1 .cse2 (<= ~c .cse13) (<= .cse13 ~c_t) (<= 1 ~processed) .cse5 .cse6 (<= .cse13 ~c) .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (and .cse0 .cse2 .cse3 (<= ~t_b ~data) .cse4 .cse5 (<= ~data ~t_b) .cse6 (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse7 (< ~c (+ ~c_t 1)) .cse11)))) [2018-10-01 00:57:25,332 INFO L422 ceAbstractionStarter]: At program point L439(lines 436 446) the Hoare annotation is: (let ((.cse6 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse3 (<= 2 ~r_st)) (.cse4 (<= 1 ~c2_pc)) (.cse5 (not (= ~e_c 0)))) (or (and (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse3 .cse4 .cse5) (= ~e_wl 1)) .cse6) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse2 (= ~wl_pc 2) .cse8 (<= ~c .cse7) (<= .cse7 ~c_t) (<= 1 ~processed) .cse4 .cse6 (<= .cse7 ~c) .cse0 .cse1 (<= ~data .cse7) (<= 2 ~e_wl) (<= .cse7 ~data) .cse5)) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5))) [2018-10-01 00:57:25,332 INFO L422 ceAbstractionStarter]: At program point L390(lines 387 404) the Hoare annotation is: (let ((.cse15 (+ ~t_b 2)) (.cse4 (<= 2 ~wl_st)) (.cse16 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse3 (<= 1 ~c1_pc)) (.cse7 (<= 2 ~r_st)) (.cse9 (<= 1 ~c2_pc)) (.cse14 (not (= ~e_c 0)))) (let ((.cse1 (or (and .cse16 .cse11 .cse3 .cse4 .cse7 .cse9 .cse14) (and .cse16 .cse11 (= ~wl_pc 1) .cse3 .cse7 .cse9 .cse14))) (.cse5 (= ~wl_pc 2)) (.cse6 (<= ~c .cse15)) (.cse8 (<= 1 ~processed)) (.cse0 (<= 2 ~c2_st)) (.cse10 (<= .cse15 ~c)) (.cse12 (<= ~data .cse15)) (.cse2 (<= 2 ~e_wl)) (.cse13 (<= .cse15 ~data))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 (<= ~c_t ~c) .cse11 .cse12 .cse2 (< ~c (+ ~c_t 1)) .cse13 .cse14) (= ~wl_pc 0) (and (<= ~c_t .cse15) .cse3 .cse5 .cse4 .cse6 (<= .cse15 ~c_t) .cse8 .cse9 .cse0 .cse10 .cse16 .cse11 .cse12 .cse2 (<= 2 ~c1_st) .cse13 .cse14)))) [2018-10-01 00:57:25,333 INFO L422 ceAbstractionStarter]: At program point L258(lines 258 308) the Hoare annotation is: (let ((.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 2 ~wl_st)) (.cse3 (<= 2 ~r_st)) (.cse0 (not (= ~e_c 1))) (.cse5 (not (= ~c2_st 0))) (.cse4 (not (= ~e_c 0)))) (or (let ((.cse6 (+ ~t_b 1))) (and (and (= ~wb_pc 1) .cse0 .cse1 .cse2 .cse3 (<= 1 ~c2_pc) .cse4) (<= 2 ~e_wl) (= ~wl_pc 2) .cse5 (<= ~data .cse6) (<= .cse6 ~data))) (and .cse1 .cse2 .cse3 (<= ~t_b ~data) (= ~wb_st 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse0 (< ~c (+ ~c_t 1)) .cse5 .cse4))) [2018-10-01 00:57:25,392 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:57:25 BoogieIcfgContainer [2018-10-01 00:57:25,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:57:25,394 INFO L168 Benchmark]: Toolchain (without parser) took 29707.03 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 215.5 MB). Free memory was 1.5 GB in the beginning and 940.0 MB in the end (delta: 526.1 MB). Peak memory consumption was 742.0 MB. Max. memory is 7.1 GB. [2018-10-01 00:57:25,395 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-01 00:57:25,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.92 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-01 00:57:25,396 INFO L168 Benchmark]: Boogie Preprocessor took 44.71 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-01 00:57:25,400 INFO L168 Benchmark]: RCFGBuilder took 701.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:57:25,400 INFO L168 Benchmark]: TraceAbstraction took 28905.44 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 215.5 MB). Free memory was 1.4 GB in the beginning and 940.0 MB in the end (delta: 494.4 MB). Peak memory consumption was 710.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:57:25,408 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 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. * Boogie Procedure Inliner took 46.92 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. * Boogie Preprocessor took 44.71 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. * RCFGBuilder took 701.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28905.44 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 215.5 MB). Free memory was 1.4 GB in the beginning and 940.0 MB in the end (delta: 494.4 MB). Peak memory consumption was 710.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 333]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((!(~c1_st == 0) && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) && 2 <= ~c2_st) || (((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && ~t_b + 2 <= ~data)) || (2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))))) || ~wl_pc == 0) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && ~c < ~c_t + 1) && !(~e_c == 0)) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) || (2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))))) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) && 2 <= ~c2_st)) || ~wl_pc == 0 - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((!(~c1_st == 0) && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~e_wl == 1) && 2 <= ~c2_st)) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~c2_st == 0)) && !(~e_c == 0)) || ((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~c2_st == 0)) && !(~e_c == 0)) && ~t_b + 2 <= ~data) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((2 <= ~c2_st && (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~data <= ~t_b + 2) && !(~e_c == 0)) && ~t_b + 2 <= ~data) || (((((((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~c < ~c_t + 1) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && !(~e_c == 0)) && ~wb_pc == 0) && ~c_t <= ~c))) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~c1_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && 2 <= ~e_wl) && !(~e_c == 0)) || ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~e_c == 0))) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b + 1) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && !(~c1_st == 0)) && 2 <= ~e_wl) && !(~e_c == 0)) && ~t_b + 1 <= ~data) || ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && !(~c1_st == 0)) && ~c < ~c_t + 1) && !(~e_c == 0)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && !(~c1_st == 0)) && 2 <= ~e_wl) && !(~e_c == 0)) || ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && !(~c1_st == 0)) && ~c < ~c_t + 1) && !(~e_c == 0)) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || (((!(~c1_st == 0) && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~e_wl == 1) && 2 <= ~c2_st)) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) || ((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~c < ~c_t + 1) && !(~e_c == 0))) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~e_wl == 1) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || ((((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((((((((((~t_b + 2 <= ~d && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 0)) || (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) && 2 <= ~c2_st - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~e_wl == 1) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) && 2 <= ~c2_st)) || ~wl_pc == 0) || ((((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~e_wl == 1) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~wl_st == 0) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && ~c < ~c_t + 1) && !(~e_c == 0)) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: ((((((((((((!(~e_c == 1) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && 2 <= ~c2_st) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~e_c == 0))) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~wl_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~e_c == 0)) && ~t_b + 2 <= ~data) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c2_st) || (((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st)) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~wl_st == 0) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && ~c < ~c_t + 1) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c2_st) || (((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st)) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~wl_st == 0) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && ~c < ~c_t + 1) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((!(~c1_st == 0) && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && ~c < ~c_t + 1) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && ~wl_pc == 0) && !(~e_c == 0))) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~e_c == 0)) && ~t_b + 2 <= ~data) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b) && 2 <= ~c2_st) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~e_c == 0)) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((((((((~wb_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~e_wl) && ~wl_pc == 2) && !(~c2_st == 0)) && ~data <= ~t_b + 1) && ~t_b + 1 <= ~data) || ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~c2_st == 0)) && !(~e_c == 0)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((2 <= ~c2_st && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) || (2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))))) || (((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ~wl_pc == 0) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b + 1) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && 2 <= ~e_wl) && !(~e_c == 0)) && ~t_b + 1 <= ~data) || ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~e_c == 0))) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || (2 <= ~c2_st && (((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c)) || ~wl_pc == 0) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. SAFE Result, 28.7s OverallTime, 20 OverallIterations, 9 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 14.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1205 SDtfs, 748 SDslu, 1352 SDs, 0 SdLazy, 263 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 511 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 565 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 129 NumberOfFragments, 4821 HoareAnnotationTreeSize, 29 FomulaSimplifications, 22106 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 29 FomulaSimplificationsInter, 11690 FormulaSimplificationTreeSizeReductionInter, 13.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1526 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1501 ConstructedInterpolants, 0 QuantifiedInterpolants, 267533 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2025 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 1645/1680 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-57-25-451.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-57-25-451.csv Received shutdown request...