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/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:37:51,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:37:51,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:37:51,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:37:51,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:37:51,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:37:51,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:37:51,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:37:51,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:37:51,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:37:51,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:37:51,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:37:51,592 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:37:51,593 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:37:51,594 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:37:51,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:37:51,596 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:37:51,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:37:51,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:37:51,612 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:37:51,614 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:37:51,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:37:51,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:37:51,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:37:51,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:37:51,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:37:51,622 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:37:51,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:37:51,627 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:37:51,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:37:51,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:37:51,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:37:51,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:37:51,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:37:51,632 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:37:51,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:37:51,633 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-04 14:37:51,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:37:51,657 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:37:51,658 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:37:51,659 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:37:51,659 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:37:51,659 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:37:51,660 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:37:51,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:37:51,660 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:37:51,660 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:37:51,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:37:51,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:37:51,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:37:51,662 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:37:51,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:37:51,662 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:37:51,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:37:51,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:37:51,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:37:51,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:37:51,663 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:37:51,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:37:51,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:37:51,665 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:37:51,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:37:51,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:37:51,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:37:51,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:37:51,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:37:51,666 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:37:51,667 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:37:51,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:37:51,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:37:51,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:37:51,746 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:37:51,747 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:37:51,748 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl [2018-10-04 14:37:51,748 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-10-04 14:37:51,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:37:51,796 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:37:51,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:37:51,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:37:51,797 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:37:51,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (1/1) ... [2018-10-04 14:37:51,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (1/1) ... [2018-10-04 14:37:51,834 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:37:51,835 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:37:51,835 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:37:51,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:37:51,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:37:51,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:37:51,838 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:37:51,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (1/1) ... [2018-10-04 14:37:51,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (1/1) ... [2018-10-04 14:37:51,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (1/1) ... [2018-10-04 14:37:51,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (1/1) ... [2018-10-04 14:37:51,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (1/1) ... [2018-10-04 14:37:51,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (1/1) ... [2018-10-04 14:37:51,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (1/1) ... [2018-10-04 14:37:51,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:37:51,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:37:51,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:37:51,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:37:51,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (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-04 14:37:51,941 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 14:37:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 14:37:51,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 14:37:52,136 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:37:52,137 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:37:52 BoogieIcfgContainer [2018-10-04 14:37:52,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:37:52,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:37:52,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:37:52,142 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:37:52,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:37:51" (1/2) ... [2018-10-04 14:37:52,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2080008e and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:37:52, skipping insertion in model container [2018-10-04 14:37:52,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:37:52" (2/2) ... [2018-10-04 14:37:52,145 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-10-04 14:37:52,153 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:37:52,161 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:37:52,205 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:37:52,206 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:37:52,206 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:37:52,207 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:37:52,207 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:37:52,207 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:37:52,207 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:37:52,207 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:37:52,208 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:37:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 14:37:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 14:37:52,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:52,229 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 14:37:52,230 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:52,237 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:52,238 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-04 14:37:52,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:52,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:52,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:52,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:52,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:52,371 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-04 14:37:52,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:37:52,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 14:37:52,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:37:52,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:37:52,390 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:52,392 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 14:37:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:52,427 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 14:37:52,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:37:52,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 14:37:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:52,440 INFO L225 Difference]: With dead ends: 9 [2018-10-04 14:37:52,440 INFO L226 Difference]: Without dead ends: 4 [2018-10-04 14:37:52,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:37:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-04 14:37:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-04 14:37:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-04 14:37:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-04 14:37:52,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-04 14:37:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:52,476 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-04 14:37:52,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:37:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-04 14:37:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 14:37:52,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:52,477 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 14:37:52,477 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:52,477 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-04 14:37:52,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:52,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:52,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:52,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:52,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:52,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:52,638 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-04 14:37:52,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:52,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:52,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:52,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-10-04 14:37:52,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:37:52,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:37:52,850 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:52,850 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-10-04 14:37:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:52,959 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-04 14:37:52,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:37:52,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-10-04 14:37:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:52,960 INFO L225 Difference]: With dead ends: 6 [2018-10-04 14:37:52,961 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 14:37:52,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 3 [2018-10-04 14:37:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 14:37:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 14:37:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 14:37:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 14:37:52,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 14:37:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:52,965 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 14:37:52,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:37:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 14:37:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 14:37:52,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:52,966 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-04 14:37:52,966 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:52,966 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:52,966 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-04 14:37:52,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:52,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:52,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:52,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:52,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:53,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:53,217 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-04 14:37:53,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:53,259 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:53,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:53,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:53,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:53,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-04 14:37:53,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:37:53,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:37:53,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:53,396 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-10-04 14:37:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:53,434 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-04 14:37:53,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:37:53,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-10-04 14:37:53,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:53,435 INFO L225 Difference]: With dead ends: 7 [2018-10-04 14:37:53,435 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 14:37:53,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 4 [2018-10-04 14:37:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 14:37:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 14:37:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 14:37:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 14:37:53,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 14:37:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:53,439 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 14:37:53,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:37:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 14:37:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:37:53,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:53,440 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-04 14:37:53,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:53,443 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:53,444 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-04 14:37:53,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:53,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:53,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:53,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:53,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:53,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:53,631 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-04 14:37:53,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:53,677 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 14:37:53,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:53,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:53,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:53,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 14:37:53,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:37:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:37:53,963 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:53,963 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-10-04 14:37:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:54,014 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 14:37:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:37:54,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-10-04 14:37:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:54,015 INFO L225 Difference]: With dead ends: 8 [2018-10-04 14:37:54,016 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:37:54,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 5 [2018-10-04 14:37:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:37:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 14:37:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 14:37:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 14:37:54,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 14:37:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:54,020 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 14:37:54,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:37:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 14:37:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:37:54,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:54,021 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-04 14:37:54,021 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:54,021 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:54,022 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-04 14:37:54,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:54,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:54,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:54,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:54,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:54,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:54,185 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-04 14:37:54,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:54,200 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:54,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:54,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:54,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:54,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 14:37:54,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:54,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:54,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:54,415 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-10-04 14:37:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:54,510 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 14:37:54,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:37:54,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-10-04 14:37:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:54,511 INFO L225 Difference]: With dead ends: 9 [2018-10-04 14:37:54,511 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 14:37:54,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 6 [2018-10-04 14:37:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 14:37:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 14:37:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 14:37:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 14:37:54,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 14:37:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:54,516 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 14:37:54,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 14:37:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:37:54,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:54,517 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-04 14:37:54,518 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:54,518 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:54,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-04 14:37:54,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:54,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:54,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:54,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:54,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:54,687 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-04 14:37:54,695 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:54,728 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 14:37:54,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:54,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:55,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:55,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 14:37:55,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:37:55,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:37:55,254 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:55,255 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-10-04 14:37:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:55,375 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 14:37:55,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:37:55,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-10-04 14:37:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:55,378 INFO L225 Difference]: With dead ends: 10 [2018-10-04 14:37:55,378 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 14:37:55,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 7 [2018-10-04 14:37:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 14:37:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 14:37:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 14:37:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 14:37:55,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 14:37:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:55,385 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 14:37:55,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:37:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 14:37:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:37:55,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:55,386 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-04 14:37:55,386 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:55,386 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-04 14:37:55,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:55,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:55,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:55,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:55,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:55,701 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:55,714 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:55,732 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 14:37:55,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:55,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:55,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:55,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 14:37:55,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:37:55,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:37:55,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:55,926 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-10-04 14:37:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:56,042 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 14:37:56,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:37:56,043 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-10-04 14:37:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:56,044 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:37:56,044 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 14:37:56,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 8 [2018-10-04 14:37:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 14:37:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 14:37:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 14:37:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 14:37:56,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 14:37:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:56,049 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 14:37:56,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:37:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 14:37:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:37:56,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:56,050 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-04 14:37:56,051 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:56,051 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:56,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-04 14:37:56,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:56,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:56,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:56,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:56,211 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:56,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:56,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:56,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:56,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 14:37:56,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:37:56,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:37:56,731 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:56,732 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-10-04 14:37:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:56,863 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 14:37:56,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:56,864 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-10-04 14:37:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:56,865 INFO L225 Difference]: With dead ends: 12 [2018-10-04 14:37:56,865 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 14:37:56,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 9 [2018-10-04 14:37:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 14:37:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 14:37:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 14:37:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 14:37:56,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 14:37:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:56,870 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 14:37:56,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:37:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 14:37:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:37:56,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:56,871 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-04 14:37:56,871 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:56,871 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-04 14:37:56,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:56,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:56,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:56,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:57,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:57,253 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:57,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:57,272 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:57,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:57,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:57,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:57,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 14:37:57,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:37:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:37:57,568 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:57,568 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-10-04 14:37:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:57,725 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 14:37:57,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:57,726 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-10-04 14:37:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:57,726 INFO L225 Difference]: With dead ends: 13 [2018-10-04 14:37:57,727 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 14:37:57,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 10 [2018-10-04 14:37:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 14:37:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 14:37:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 14:37:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 14:37:57,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 14:37:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:57,733 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 14:37:57,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:37:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 14:37:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:37:57,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:57,734 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-04 14:37:57,734 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:57,734 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-04 14:37:57,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:57,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:57,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:58,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:58,114 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:58,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:58,152 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:37:58,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:58,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:58,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:58,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 14:37:58,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:37:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:37:58,439 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:58,439 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-10-04 14:37:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:58,632 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 14:37:58,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:37:58,632 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-10-04 14:37:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:58,634 INFO L225 Difference]: With dead ends: 14 [2018-10-04 14:37:58,634 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 14:37:58,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 11 [2018-10-04 14:37:58,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 14:37:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 14:37:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 14:37:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 14:37:58,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 14:37:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:58,640 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 14:37:58,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:37:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 14:37:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:37:58,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:58,641 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-04 14:37:58,641 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:58,641 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-04 14:37:58,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:58,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:58,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:58,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:58,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:59,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:59,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:59,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:59,038 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:59,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:59,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:59,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:59,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 14:37:59,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:37:59,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:37:59,912 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:59,913 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-10-04 14:38:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:00,185 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 14:38:00,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:38:00,185 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-10-04 14:38:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:00,186 INFO L225 Difference]: With dead ends: 15 [2018-10-04 14:38:00,187 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 14:38:00,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 12 [2018-10-04 14:38:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 14:38:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 14:38:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:38:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 14:38:00,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 14:38:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:00,191 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 14:38:00,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:38:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 14:38:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:38:00,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:00,192 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-04 14:38:00,192 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:00,192 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:00,193 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-04 14:38:00,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:00,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:00,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:00,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:00,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:00,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:00,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:00,511 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:00,531 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:38:00,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:00,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:00,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:00,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 14:38:00,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 14:38:00,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 14:38:00,915 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:00,916 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-10-04 14:38:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:01,338 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 14:38:01,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:38:01,338 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-10-04 14:38:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:01,339 INFO L225 Difference]: With dead ends: 16 [2018-10-04 14:38:01,339 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:38:01,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 13 [2018-10-04 14:38:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:38:01,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 14:38:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 14:38:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 14:38:01,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 14:38:01,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:01,343 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 14:38:01,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 14:38:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 14:38:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:38:01,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:01,343 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-04 14:38:01,344 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:01,344 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:01,344 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-04 14:38:01,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:01,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:01,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:01,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:01,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:01,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:01,694 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:01,701 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:01,719 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:38:01,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:01,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:02,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:02,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 14:38:02,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:38:02,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:38:02,166 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:02,166 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-10-04 14:38:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:02,448 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 14:38:02,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:38:02,448 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-10-04 14:38:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:02,449 INFO L225 Difference]: With dead ends: 17 [2018-10-04 14:38:02,449 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 14:38:02,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 14 [2018-10-04 14:38:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 14:38:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 14:38:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:38:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 14:38:02,455 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 14:38:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:02,455 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 14:38:02,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:38:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 14:38:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:38:02,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:02,456 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-04 14:38:02,456 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:02,457 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-04 14:38:02,457 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:02,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:02,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:02,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:02,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:02,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:02,964 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:02,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:02,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:03,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:03,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 14:38:03,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:38:03,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:38:03,935 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:03,935 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-10-04 14:38:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:04,414 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 14:38:04,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:38:04,414 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-10-04 14:38:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:04,415 INFO L225 Difference]: With dead ends: 18 [2018-10-04 14:38:04,415 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 14:38:04,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.1s impTime 15 [2018-10-04 14:38:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 14:38:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 14:38:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 14:38:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 14:38:04,420 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 14:38:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:04,420 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 14:38:04,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:38:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 14:38:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:38:04,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:04,421 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-04 14:38:04,421 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:04,421 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:04,421 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-04 14:38:04,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:04,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:04,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:04,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:04,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:05,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:05,109 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:05,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:05,138 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:05,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:05,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:06,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:06,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-04 14:38:06,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 14:38:06,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 14:38:06,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:06,022 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-10-04 14:38:06,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:06,519 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 14:38:06,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:38:06,519 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-10-04 14:38:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:06,520 INFO L225 Difference]: With dead ends: 19 [2018-10-04 14:38:06,520 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 14:38:06,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime 16 [2018-10-04 14:38:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 14:38:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 14:38:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:38:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 14:38:06,526 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 14:38:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:06,526 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 14:38:06,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 14:38:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 14:38:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:38:06,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:06,527 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-04 14:38:06,527 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:06,527 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-04 14:38:06,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:06,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:06,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:07,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:07,073 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:07,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:07,105 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:38:07,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:07,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:07,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:07,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 14:38:07,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:38:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:38:07,734 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:07,734 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-10-04 14:38:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:08,229 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 14:38:08,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:38:08,230 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-10-04 14:38:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:08,231 INFO L225 Difference]: With dead ends: 20 [2018-10-04 14:38:08,231 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:38:08,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.8s impTime 17 [2018-10-04 14:38:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:38:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 14:38:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 14:38:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 14:38:08,235 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 14:38:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:08,236 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 14:38:08,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:38:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 14:38:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:38:08,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:08,237 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-04 14:38:08,237 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:08,237 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:08,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-04 14:38:08,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:08,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:08,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:08,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:08,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:08,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:08,999 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:09,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:09,025 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:09,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:09,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:09,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:09,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-04 14:38:09,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 14:38:09,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 14:38:09,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:09,697 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-10-04 14:38:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:10,240 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 14:38:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:38:10,240 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-10-04 14:38:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:10,241 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:38:10,242 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 14:38:10,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 18 [2018-10-04 14:38:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 14:38:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 14:38:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:38:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 14:38:10,247 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 14:38:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:10,248 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 14:38:10,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 14:38:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 14:38:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:10,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:10,248 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-04 14:38:10,249 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:10,249 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-04 14:38:10,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:10,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:10,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:10,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:10,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:10,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:10,928 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:10,936 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:10,956 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 14:38:10,956 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:10,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:12,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:12,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 14:38:12,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 14:38:12,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 14:38:12,287 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:12,287 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-10-04 14:38:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:13,089 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 14:38:13,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:38:13,090 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-10-04 14:38:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:13,091 INFO L225 Difference]: With dead ends: 22 [2018-10-04 14:38:13,091 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:38:13,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.6s impTime 19 [2018-10-04 14:38:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:38:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 14:38:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 14:38:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 14:38:13,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 14:38:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:13,096 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 14:38:13,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 14:38:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 14:38:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:38:13,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:13,096 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-04 14:38:13,096 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:13,097 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-04 14:38:13,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:13,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:13,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:13,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:13,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:13,817 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:13,840 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 14:38:13,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:13,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:14,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:14,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-04 14:38:14,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 14:38:14,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 14:38:14,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:14,955 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-10-04 14:38:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:15,838 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 14:38:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:38:15,839 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-10-04 14:38:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:15,840 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:38:15,840 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 14:38:15,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.5s impTime 20 [2018-10-04 14:38:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 14:38:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 14:38:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:38:15,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 14:38:15,845 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 14:38:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:15,845 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 14:38:15,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 14:38:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 14:38:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:38:15,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:15,846 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-04 14:38:15,847 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:15,847 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:15,847 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-04 14:38:15,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:15,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:15,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:16,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:16,598 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:16,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:16,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:17,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:17,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 14:38:17,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:38:17,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:38:17,671 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:17,671 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-10-04 14:38:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:18,664 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 14:38:18,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:38:18,665 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-10-04 14:38:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:18,665 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:38:18,666 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:38:18,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.3s impTime 21 [2018-10-04 14:38:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:38:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 14:38:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 14:38:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 14:38:18,671 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 14:38:18,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:18,671 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 14:38:18,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:38:18,671 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 14:38:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:38:18,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:18,672 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-04 14:38:18,672 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:18,673 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:18,673 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-04 14:38:18,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:18,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:18,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:18,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:18,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:19,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:19,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:19,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:19,677 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:19,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:19,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:20,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:20,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-04 14:38:20,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 14:38:20,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 14:38:20,707 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:20,707 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-10-04 14:38:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:21,607 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 14:38:21,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:38:21,608 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-10-04 14:38:21,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:21,609 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:38:21,609 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 14:38:21,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.6s impTime 22 [2018-10-04 14:38:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 14:38:21,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 14:38:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:38:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 14:38:21,613 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 14:38:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:21,613 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 14:38:21,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 14:38:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 14:38:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 14:38:21,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:21,614 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-04 14:38:21,615 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:21,615 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:21,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-04 14:38:21,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:21,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:21,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:21,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:21,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:23,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:23,017 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:23,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:23,055 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 14:38:23,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:23,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:24,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:24,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-04 14:38:24,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:38:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:38:24,424 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:24,424 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-10-04 14:38:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:25,627 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 14:38:25,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:38:25,628 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-10-04 14:38:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:25,629 INFO L225 Difference]: With dead ends: 26 [2018-10-04 14:38:25,629 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 14:38:25,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.2s impTime 23 [2018-10-04 14:38:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 14:38:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 14:38:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 14:38:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 14:38:25,634 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 14:38:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:25,634 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 14:38:25,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:38:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 14:38:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 14:38:25,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:25,635 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-04 14:38:25,635 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:25,636 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-04 14:38:25,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:25,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:25,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:25,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:26,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:26,782 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:26,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:26,813 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:26,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:26,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:28,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:28,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-04 14:38:28,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 14:38:28,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 14:38:28,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:28,180 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-10-04 14:38:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:29,393 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 14:38:29,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:38:29,393 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-10-04 14:38:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:29,394 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:38:29,394 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 14:38:29,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 2.1s impTime 24 [2018-10-04 14:38:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 14:38:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 14:38:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:38:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 14:38:29,400 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 14:38:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:29,401 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 14:38:29,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 14:38:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 14:38:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 14:38:29,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:29,402 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-04 14:38:29,402 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:29,402 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-04 14:38:29,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:29,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:29,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:29,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:29,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:30,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:30,696 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:30,706 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:30,748 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 14:38:30,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:30,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:33,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:33,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-04 14:38:33,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 14:38:33,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 14:38:33,015 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:33,015 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-10-04 14:38:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:34,095 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 14:38:34,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:38:34,095 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-10-04 14:38:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:34,096 INFO L225 Difference]: With dead ends: 28 [2018-10-04 14:38:34,096 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:38:34,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s Time 3.0s impTime 25 [2018-10-04 14:38:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:38:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 14:38:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 14:38:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 14:38:34,100 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 14:38:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:34,101 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 14:38:34,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 14:38:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 14:38:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 14:38:34,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:34,102 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-04 14:38:34,102 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:34,102 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-04 14:38:34,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:34,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:34,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:34,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:34,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:36,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:36,007 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:36,015 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:36,055 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 14:38:36,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:36,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:38,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:38,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-04 14:38:38,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 14:38:38,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 14:38:38,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:38,391 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-10-04 14:38:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:39,762 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 14:38:39,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:38:39,763 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-10-04 14:38:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:39,763 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:38:39,764 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 14:38:39,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s Time 3.6s impTime 26 [2018-10-04 14:38:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 14:38:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 14:38:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:38:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 14:38:39,770 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 14:38:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:39,770 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 14:38:39,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 14:38:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 14:38:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 14:38:39,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:39,771 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-04 14:38:39,771 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:39,771 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-04 14:38:39,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:39,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:39,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:39,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:39,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:41,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:41,268 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:41,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:41,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:43,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:43,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-04 14:38:43,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:38:43,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:38:43,594 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:43,594 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-10-04 14:38:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:45,159 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 14:38:45,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:38:45,160 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-10-04 14:38:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:45,160 INFO L225 Difference]: With dead ends: 30 [2018-10-04 14:38:45,161 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:38:45,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time 3.2s impTime 27 [2018-10-04 14:38:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:38:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 14:38:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 14:38:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 14:38:45,166 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 14:38:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:45,167 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 14:38:45,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:38:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 14:38:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 14:38:45,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:45,168 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-04 14:38:45,168 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:45,168 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:45,168 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-04 14:38:45,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:45,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:45,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:46,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:46,843 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:46,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:46,891 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:46,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:46,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:49,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:49,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-04 14:38:49,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 14:38:49,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 14:38:49,010 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:49,010 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-10-04 14:38:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:50,839 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 14:38:50,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:38:50,839 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-10-04 14:38:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:50,840 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:38:50,840 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 14:38:50,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time 3.3s impTime 28 [2018-10-04 14:38:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 14:38:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 14:38:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:38:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 14:38:50,845 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 14:38:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:50,846 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 14:38:50,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 14:38:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 14:38:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 14:38:50,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:50,846 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-04 14:38:50,847 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:50,847 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:50,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-04 14:38:50,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:50,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:50,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:50,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:50,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:53,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:53,081 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:53,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:53,139 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 14:38:53,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:53,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:55,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:55,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-04 14:38:55,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 14:38:55,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 14:38:55,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:55,674 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-10-04 14:38:57,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:57,858 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 14:38:57,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:38:57,858 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-10-04 14:38:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:57,859 INFO L225 Difference]: With dead ends: 32 [2018-10-04 14:38:57,859 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:38:57,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s Time 4.1s impTime 29 [2018-10-04 14:38:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:38:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 14:38:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:38:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 14:38:57,866 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 14:38:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:57,867 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 14:38:57,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 14:38:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 14:38:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:38:57,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:57,868 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-04 14:38:57,868 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:57,868 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-04 14:38:57,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:57,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:57,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:57,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:00,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:00,284 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:00,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:39:00,331 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:39:00,331 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:00,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:02,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:02,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-04 14:39:02,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 14:39:02,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 14:39:02,675 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:02,675 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-10-04 14:39:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:04,689 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 14:39:04,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:39:04,689 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-10-04 14:39:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:04,690 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:39:04,690 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 14:39:04,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s Time 4.0s impTime 30 [2018-10-04 14:39:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 14:39:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 14:39:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:39:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 14:39:04,697 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 14:39:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:04,697 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 14:39:04,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 14:39:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 14:39:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 14:39:04,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:04,698 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-04 14:39:04,698 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:04,698 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-04 14:39:04,698 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:04,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:04,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:06,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:06,910 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:06,924 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:39:06,977 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 14:39:06,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:06,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:09,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:09,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-04 14:39:09,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 14:39:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 14:39:09,996 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:09,996 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-10-04 14:39:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:12,347 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 14:39:12,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:39:12,348 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-10-04 14:39:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:12,348 INFO L225 Difference]: With dead ends: 34 [2018-10-04 14:39:12,349 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:39:12,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s Time 4.5s impTime 31 [2018-10-04 14:39:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:39:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 14:39:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 14:39:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 14:39:12,355 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 14:39:12,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:12,356 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 14:39:12,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 14:39:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 14:39:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 14:39:12,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:12,356 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-04 14:39:12,357 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:12,357 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-04 14:39:12,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:12,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:12,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:14,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:14,820 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:14,828 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:39:14,891 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 14:39:14,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:14,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:18,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:18,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-04 14:39:18,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 14:39:18,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 14:39:18,394 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:18,394 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-10-04 14:39:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:21,457 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 14:39:21,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:39:21,457 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-10-04 14:39:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:21,458 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:39:21,458 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 14:39:21,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s Time 5.3s impTime 32 [2018-10-04 14:39:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 14:39:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 14:39:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 14:39:21,462 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 14:39:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:21,463 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 14:39:21,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 14:39:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 14:39:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:39:21,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:21,463 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-04 14:39:21,464 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:21,464 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-04 14:39:21,464 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:21,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:21,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:21,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:21,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:24,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:24,099 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:24,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:24,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:27,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:27,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-04 14:39:27,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 14:39:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 14:39:27,767 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:27,767 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-10-04 14:39:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:30,477 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 14:39:30,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:39:30,478 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-10-04 14:39:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:30,479 INFO L225 Difference]: With dead ends: 36 [2018-10-04 14:39:30,479 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:39:30,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s Time 5.6s impTime 33 [2018-10-04 14:39:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:39:30,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 14:39:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:39:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 14:39:30,484 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 14:39:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:30,485 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 14:39:30,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 14:39:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 14:39:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:39:30,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:30,485 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-04 14:39:30,486 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:30,486 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:30,486 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-04 14:39:30,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:30,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:30,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:30,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:30,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:33,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:33,398 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:33,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:39:33,452 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:39:33,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:33,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:37,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:37,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-04 14:39:37,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 14:39:37,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 14:39:37,037 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:37,037 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-10-04 14:39:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:39,818 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 14:39:39,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:39:39,819 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-10-04 14:39:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:39,819 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:39:39,819 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 14:39:39,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s Time 5.7s impTime 34 [2018-10-04 14:39:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 14:39:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 14:39:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 14:39:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 14:39:39,827 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 14:39:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:39,827 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 14:39:39,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 14:39:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 14:39:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 14:39:39,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:39,828 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-04 14:39:39,828 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:39,828 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-04 14:39:39,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:39,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:39,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:39,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:42,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:42,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:42,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:39:43,060 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 14:39:43,060 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:43,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:47,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:47,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-04 14:39:47,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 14:39:47,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 14:39:47,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:47,152 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-10-04 14:39:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:50,672 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 14:39:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:39:50,673 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-10-04 14:39:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:50,674 INFO L225 Difference]: With dead ends: 38 [2018-10-04 14:39:50,674 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:39:50,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s Time 6.5s impTime 35 [2018-10-04 14:39:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:39:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 14:39:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 14:39:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 14:39:50,679 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 14:39:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:50,679 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 14:39:50,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 14:39:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 14:39:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 14:39:50,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:50,679 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-04 14:39:50,680 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:50,680 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-04 14:39:50,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:50,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:50,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:50,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:50,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:53,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:53,980 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:53,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:39:54,040 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:39:54,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:54,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:58,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:58,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-04 14:39:58,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 14:39:58,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 14:39:58,402 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:58,402 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-10-04 14:40:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:40:01,906 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 14:40:01,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:40:01,907 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-10-04 14:40:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:40:01,907 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:40:01,908 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 14:40:01,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s Time 6.9s impTime 36 [2018-10-04 14:40:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 14:40:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 14:40:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 14:40:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 14:40:01,912 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 14:40:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:40:01,913 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 14:40:01,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 14:40:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 14:40:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 14:40:01,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:40:01,913 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-04 14:40:01,913 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:40:01,913 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:40:01,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-04 14:40:01,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:40:01,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:40:01,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:40:01,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:40:01,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:40:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:40:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:40:05,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:40:05,515 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:40:05,523 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:40:05,598 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 14:40:05,598 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:40:05,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:40:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:40:10,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:40:10,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-04 14:40:10,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 14:40:10,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 14:40:10,005 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:40:10,005 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-10-04 14:40:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:40:13,707 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 14:40:13,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:40:13,707 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-10-04 14:40:13,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:40:13,708 INFO L225 Difference]: With dead ends: 40 [2018-10-04 14:40:13,708 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:40:13,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s Time 7.2s impTime 37 [2018-10-04 14:40:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:40:13,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 14:40:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 14:40:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 14:40:13,713 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 14:40:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:40:13,713 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 14:40:13,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 14:40:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 14:40:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 14:40:13,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:40:13,714 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-04 14:40:13,714 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:40:13,714 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:40:13,714 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-04 14:40:13,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:40:13,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:40:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:40:13,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:40:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:40:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:40:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:40:17,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:40:17,513 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:40:17,521 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:40:17,586 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 14:40:17,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:40:17,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:40:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:40:22,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:40:22,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-04 14:40:22,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 14:40:22,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 14:40:22,172 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:40:22,173 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-10-04 14:40:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:40:25,628 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 14:40:25,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:40:25,628 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-10-04 14:40:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:40:25,629 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:40:25,629 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 14:40:25,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s Time 7.5s impTime 38 [2018-10-04 14:40:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 14:40:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 14:40:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 14:40:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 14:40:25,634 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 14:40:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:40:25,635 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 14:40:25,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 14:40:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 14:40:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 14:40:25,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:40:25,635 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-04 14:40:25,636 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:40:25,636 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:40:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-04 14:40:25,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:40:25,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:40:25,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:40:25,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:40:25,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:40:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:40:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:40:29,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:40:29,744 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:40:29,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:40:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:40:29,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:40:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:40:34,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:40:34,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-04 14:40:34,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 14:40:34,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 14:40:34,746 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:40:34,746 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. [2018-10-04 14:40:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:40:38,393 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 14:40:38,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:40:38,393 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 39 [2018-10-04 14:40:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:40:38,394 INFO L225 Difference]: With dead ends: 42 [2018-10-04 14:40:38,394 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:40:38,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s Time 8.1s impTime 39 [2018-10-04 14:40:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:40:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 14:40:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 14:40:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 14:40:38,399 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 14:40:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:40:38,399 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 14:40:38,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 14:40:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 14:40:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 14:40:38,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:40:38,399 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-04 14:40:38,399 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:40:38,400 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:40:38,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-04 14:40:38,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:40:38,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:40:38,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:40:38,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:40:38,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:40:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:40:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:40:42,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:40:42,641 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:40:42,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:40:42,713 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:40:42,713 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:40:42,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:40:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:40:48,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:40:48,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-04 14:40:48,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 14:40:48,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 14:40:48,020 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:40:48,020 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 79 states. [2018-10-04 14:40:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:40:52,035 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 14:40:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:40:52,035 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 40 [2018-10-04 14:40:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:40:52,036 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:40:52,036 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 14:40:52,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s Time 8.6s impTime 40 [2018-10-04 14:40:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 14:40:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 14:40:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 14:40:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 14:40:52,041 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 14:40:52,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:40:52,042 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 14:40:52,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 14:40:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 14:40:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 14:40:52,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:40:52,042 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-04 14:40:52,043 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:40:52,043 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:40:52,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-04 14:40:52,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:40:52,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:40:52,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:40:52,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:40:52,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:40:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:40:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:40:56,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:40:56,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:40:56,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:40:56,741 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 14:40:56,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:40:56,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:41:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:41:02,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:41:02,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-04 14:41:02,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 14:41:02,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 14:41:02,587 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:41:02,587 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 81 states. [2018-10-04 14:41:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:41:07,726 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 14:41:07,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:41:07,727 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 41 [2018-10-04 14:41:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:41:07,728 INFO L225 Difference]: With dead ends: 44 [2018-10-04 14:41:07,728 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:41:07,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s Time 9.4s impTime 41 [2018-10-04 14:41:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:41:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 14:41:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 14:41:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 14:41:07,732 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 14:41:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:41:07,732 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 14:41:07,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 14:41:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 14:41:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 14:41:07,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:41:07,733 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-04 14:41:07,733 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:41:07,733 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:41:07,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-04 14:41:07,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:41:07,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:41:07,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:41:07,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:41:07,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:41:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:41:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:41:12,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:41:12,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:41:12,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:41:12,655 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:41:12,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:41:12,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:41:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:41:19,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:41:19,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-04 14:41:19,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 14:41:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 14:41:19,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:41:19,069 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 83 states. [2018-10-04 14:41:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:41:24,799 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 14:41:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:41:24,800 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 42 [2018-10-04 14:41:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:41:24,801 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:41:24,801 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 14:41:24,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s Time 10.2s impTime 42 [2018-10-04 14:41:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 14:41:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 14:41:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 14:41:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 14:41:24,805 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 14:41:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:41:24,806 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 14:41:24,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 14:41:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 14:41:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 14:41:24,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:41:24,806 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-04 14:41:24,807 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:41:24,807 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:41:24,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-04 14:41:24,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:41:24,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:41:24,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:41:24,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:41:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:41:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:41:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:41:30,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:41:30,043 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:41:30,051 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:41:30,172 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 14:41:30,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:41:30,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:41:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:41:37,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:41:37,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-04 14:41:37,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 14:41:37,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 14:41:37,525 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:41:37,526 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 85 states. [2018-10-04 14:41:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:41:44,343 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 14:41:44,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:41:44,344 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 43 [2018-10-04 14:41:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:41:44,345 INFO L225 Difference]: With dead ends: 46 [2018-10-04 14:41:44,345 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:41:44,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s Time 11.5s impTime 43 [2018-10-04 14:41:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:41:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 14:41:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 14:41:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 14:41:44,350 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 14:41:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:41:44,350 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 14:41:44,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 14:41:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 14:41:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 14:41:44,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:41:44,350 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-04 14:41:44,351 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:41:44,351 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:41:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-04 14:41:44,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:41:44,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:41:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:41:44,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:41:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:41:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:41:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:41:49,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:41:49,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:41:49,875 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:41:50,008 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 14:41:50,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:41:50,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:41:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:41:56,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:41:56,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-04 14:41:56,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 14:41:56,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 14:41:56,851 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:41:56,851 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 87 states. [2018-10-04 14:42:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:42:02,242 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 14:42:02,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:42:02,243 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 44 [2018-10-04 14:42:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:42:02,244 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:42:02,244 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 14:42:02,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s Time 11.1s impTime 44 [2018-10-04 14:42:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 14:42:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 14:42:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 14:42:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 14:42:02,249 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 14:42:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:42:02,249 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 14:42:02,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 14:42:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 14:42:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 14:42:02,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:42:02,250 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-04 14:42:02,250 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:42:02,250 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:42:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-04 14:42:02,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:42:02,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:42:02,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:42:02,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:42:02,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:42:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:42:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:42:08,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:42:08,063 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:42:08,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:42:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:42:08,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:42:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:42:16,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:42:16,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-04 14:42:16,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 14:42:16,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 14:42:16,196 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:42:16,196 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 89 states. Received shutdown request... [2018-10-04 14:42:20,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:42:20,570 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:42:20,575 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:42:20,575 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:42:20 BoogieIcfgContainer [2018-10-04 14:42:20,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:42:20,576 INFO L168 Benchmark]: Toolchain (without parser) took 268781.43 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 98.0 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 369.8 MB). Peak memory consumption was 467.8 MB. Max. memory is 7.1 GB. [2018-10-04 14:42:20,578 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 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-04 14:42:20,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.00 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-04 14:42:20,579 INFO L168 Benchmark]: Boogie Preprocessor took 25.29 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-04 14:42:20,579 INFO L168 Benchmark]: RCFGBuilder took 273.66 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:42:20,580 INFO L168 Benchmark]: TraceAbstraction took 268436.97 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 98.0 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 348.6 MB). Peak memory consumption was 446.7 MB. Max. memory is 7.1 GB. [2018-10-04 14:42:20,585 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.27 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 41.00 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 25.29 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 273.66 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 268436.97 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 98.0 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 348.6 MB). Peak memory consumption was 446.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (46states) and FLOYD_HOARE automaton (currently 33 states, 89 states before enhancement), while ReachableStatesComputation was computing reachable states (31 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 268.3s OverallTime, 44 OverallIterations, 43 TraceHistogramMax, 80.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 88 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 34142 SolverSat, 946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 74.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1936 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 177.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=43, 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.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 182.9s InterpolantComputationTime, 2066 NumberOfCodeBlocks, 2066 NumberOfCodeBlocksAsserted, 339 NumberOfCheckSat, 1979 ConstructedInterpolants, 0 QuantifiedInterpolants, 569581 SizeOfPredicates, 43 NumberOfNonLiveVariables, 4085 ConjunctsInSsa, 2021 ConjunctsInUnsatCore, 87 InterpolantComputations, 1 PerfectInterpolantSequences, 0/28380 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-42-20-605.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-42-20-605.csv Completed graceful shutdown