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 [2018-10-04 12:58:36,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:58:36,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:58:36,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:58:36,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:58:36,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:58:36,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:58:36,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:58:36,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:58:36,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:58:36,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:58:36,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:58:36,201 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:58:36,202 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:58:36,203 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:58:36,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:58:36,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:58:36,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:58:36,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:58:36,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:58:36,214 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:58:36,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:58:36,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:58:36,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:58:36,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:58:36,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:58:36,226 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:58:36,227 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:58:36,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:58:36,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:58:36,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:58:36,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:58:36,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:58:36,232 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:58:36,233 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:58:36,236 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:58:36,236 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 12:58:36,259 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:58:36,260 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:58:36,260 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:58:36,261 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:58:36,261 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:58:36,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:58:36,262 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:58:36,263 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:58:36,263 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:58:36,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:58:36,263 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:58:36,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:58:36,264 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:58:36,264 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:58:36,264 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:58:36,264 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:58:36,264 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:58:36,265 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:58:36,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:58:36,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:58:36,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:58:36,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:58:36,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:58:36,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:58:36,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:58:36,267 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:58:36,267 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:58:36,268 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:58:36,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:58:36,268 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:58:36,268 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:58:36,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:58:36,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:58:36,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:58:36,342 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:58:36,343 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:58:36,344 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 12:58:36,344 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-10-04 12:58:36,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:58:36,388 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:58:36,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:58:36,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:58:36,390 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:58:36,410 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 12:58:36" (1/1) ... [2018-10-04 12:58:36,422 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 12:58:36" (1/1) ... [2018-10-04 12:58:36,426 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:58:36,427 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:58:36,427 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:58:36,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:58:36,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:58:36,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:58:36,430 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:58:36,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:36" (1/1) ... [2018-10-04 12:58:36,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:36" (1/1) ... [2018-10-04 12:58:36,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:36" (1/1) ... [2018-10-04 12:58:36,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:36" (1/1) ... [2018-10-04 12:58:36,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:36" (1/1) ... [2018-10-04 12:58:36,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:36" (1/1) ... [2018-10-04 12:58:36,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:36" (1/1) ... [2018-10-04 12:58:36,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:58:36,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:58:36,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:58:36,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:58:36,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:36" (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 12:58:36,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 12:58:36,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:58:36,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:58:36,715 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:58:36,715 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:58:36 BoogieIcfgContainer [2018-10-04 12:58:36,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:58:36,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:58:36,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:58:36,720 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:58:36,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:36" (1/2) ... [2018-10-04 12:58:36,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d8d9eb and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:58:36, skipping insertion in model container [2018-10-04 12:58:36,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:58:36" (2/2) ... [2018-10-04 12:58:36,724 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-10-04 12:58:36,735 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:58:36,746 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:58:36,801 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:58:36,802 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:58:36,802 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:58:36,802 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:58:36,802 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:58:36,802 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:58:36,802 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:58:36,802 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:58:36,803 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:58:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 12:58:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 12:58:36,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:36,824 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 12:58:36,826 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:36,833 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:36,833 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-04 12:58:36,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:36,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:36,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:36,977 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 12:58:36,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:58:36,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:58:36,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:58:36,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:58:36,998 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:37,000 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 12:58:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:37,066 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:58:37,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:58:37,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 12:58:37,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:37,078 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:58:37,078 INFO L226 Difference]: Without dead ends: 4 [2018-10-04 12:58:37,082 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 12:58:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-04 12:58:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-04 12:58:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-04 12:58:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-04 12:58:37,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-04 12:58:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:37,117 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-04 12:58:37,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:58:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-04 12:58:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:58:37,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:37,117 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:58:37,118 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:37,118 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-04 12:58:37,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:37,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:37,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:37,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:37,302 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 12:58:37,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:37,303 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 12:58:37,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:37,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:37,421 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 12:58:37,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:37,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-10-04 12:58:37,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:58:37,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:58:37,444 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:37,444 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-10-04 12:58:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:37,510 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-04 12:58:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:58:37,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-10-04 12:58:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:37,511 INFO L225 Difference]: With dead ends: 6 [2018-10-04 12:58:37,511 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 12:58:37,512 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 12:58:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 12:58:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 12:58:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 12:58:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 12:58:37,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 12:58:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:37,515 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 12:58:37,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:58:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 12:58:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:58:37,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:37,516 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-04 12:58:37,516 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:37,517 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:37,517 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-04 12:58:37,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:37,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:37,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:37,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:37,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:37,648 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 12:58:37,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:37,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 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 12:58:37,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:37,674 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:37,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:37,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:37,772 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 12:58:37,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:37,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-04 12:58:37,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:58:37,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:58:37,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:37,794 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-10-04 12:58:37,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:37,830 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-04 12:58:37,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:58:37,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-10-04 12:58:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:37,831 INFO L225 Difference]: With dead ends: 7 [2018-10-04 12:58:37,832 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 12:58:37,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 4 [2018-10-04 12:58:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 12:58:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 12:58:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:58:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 12:58:37,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 12:58:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:37,835 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 12:58:37,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:58:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 12:58:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:58:37,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:37,836 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-04 12:58:37,836 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:37,836 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-04 12:58:37,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:37,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:37,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:37,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:38,026 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 12:58:38,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:38,027 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 12:58:38,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:38,075 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:58:38,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:38,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:38,303 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 12:58:38,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:38,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 12:58:38,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:58:38,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:58:38,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:38,325 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-10-04 12:58:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:38,366 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 12:58:38,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:58:38,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-10-04 12:58:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:38,367 INFO L225 Difference]: With dead ends: 8 [2018-10-04 12:58:38,367 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:58:38,368 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 12:58:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:58:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:58:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:58:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:58:38,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 12:58:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:38,371 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:58:38,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:58:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:58:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:58:38,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:38,372 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-04 12:58:38,372 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:38,373 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:38,373 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-04 12:58:38,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:38,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:38,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:38,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:38,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:38,553 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 12:58:38,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:38,554 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 12:58:38,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:38,580 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:38,580 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:38,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:38,792 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 12:58:38,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:38,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 12:58:38,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:38,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:38,814 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:38,814 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-10-04 12:58:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:38,905 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:58:38,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:58:38,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-10-04 12:58:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:38,906 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:58:38,906 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 12:58:38,907 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 12:58:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 12:58:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 12:58:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:58:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 12:58:38,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 12:58:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:38,912 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 12:58:38,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 12:58:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:58:38,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:38,913 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-04 12:58:38,913 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:38,914 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-04 12:58:38,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:38,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:38,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:38,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:39,117 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 12:58:39,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:39,118 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 12:58:39,130 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:39,168 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 12:58:39,169 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:39,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:39,684 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 12:58:39,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:39,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 12:58:39,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:58:39,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:58:39,705 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:39,706 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-10-04 12:58:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:39,880 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 12:58:39,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:58:39,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-10-04 12:58:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:39,882 INFO L225 Difference]: With dead ends: 10 [2018-10-04 12:58:39,882 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:58:39,883 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 12:58:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:58:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:58:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:58:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:58:39,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 12:58:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:39,887 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:58:39,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:58:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:58:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:58:39,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:39,888 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-04 12:58:39,889 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:39,889 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-04 12:58:39,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:39,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:39,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:39,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:39,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:40,220 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 12:58:40,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:40,221 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 12:58:40,230 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:40,238 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 12:58:40,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:40,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:40,432 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 12:58:40,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:40,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:58:40,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:58:40,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:58:40,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:40,454 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-10-04 12:58:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:40,565 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:58:40,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:58:40,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-10-04 12:58:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:40,567 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:58:40,567 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:58:40,567 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 12:58:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:58:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 12:58:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:58:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 12:58:40,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 12:58:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:40,572 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 12:58:40,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:58:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 12:58:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:58:40,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:40,573 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-04 12:58:40,574 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:40,574 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-04 12:58:40,574 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:40,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:40,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:40,731 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 12:58:40,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:40,731 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 12:58:40,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:40,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:41,185 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 12:58:41,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:41,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 12:58:41,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:58:41,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:58:41,207 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:41,208 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-10-04 12:58:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:41,341 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 12:58:41,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:41,341 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-10-04 12:58:41,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:41,342 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:58:41,343 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:58:41,343 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 12:58:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:58:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:58:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:58:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:58:41,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 12:58:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:41,348 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:58:41,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:58:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:58:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:58:41,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:41,349 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-04 12:58:41,349 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:41,349 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:41,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-04 12:58:41,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:41,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:41,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:41,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:41,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:41,901 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 12:58:41,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:41,901 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 12:58:41,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:41,919 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:41,919 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:41,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:42,198 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 12:58:42,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:42,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 12:58:42,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:58:42,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:58:42,221 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:42,221 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-10-04 12:58:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:42,363 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:58:42,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:42,364 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-10-04 12:58:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:42,365 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:58:42,365 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:58:42,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 10 [2018-10-04 12:58:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:58:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 12:58:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:58:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 12:58:42,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 12:58:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:42,370 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 12:58:42,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:58:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 12:58:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:58:42,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:42,371 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-04 12:58:42,371 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:42,372 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-04 12:58:42,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:42,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:42,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:42,815 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 12:58:42,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:42,816 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 12:58:42,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:42,846 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:58:42,846 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:42,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:43,130 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 12:58:43,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:43,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 12:58:43,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:58:43,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:58:43,153 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:43,153 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-10-04 12:58:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:43,333 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 12:58:43,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:58:43,334 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-10-04 12:58:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:43,335 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:58:43,335 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:58:43,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 11 [2018-10-04 12:58:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:58:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:58:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:58:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:58:43,340 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 12:58:43,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:43,340 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:58:43,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:58:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:58:43,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:58:43,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:43,345 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-04 12:58:43,345 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:43,345 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:43,346 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-04 12:58:43,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:43,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:43,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:43,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:43,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:43,722 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 12:58:43,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:43,722 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 12:58:43,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:43,741 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:43,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:43,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:44,548 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 12:58:44,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:44,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 12:58:44,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 12:58:44,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 12:58:44,569 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:44,569 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-10-04 12:58:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:44,846 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:58:44,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:58:44,847 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-10-04 12:58:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:44,849 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:58:44,849 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:58:44,850 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 12:58:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:58:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 12:58:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:58:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 12:58:44,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 12:58:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:44,855 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 12:58:44,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 12:58:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 12:58:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:58:44,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:44,856 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-04 12:58:44,857 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:44,857 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-04 12:58:44,857 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:44,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:44,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:45,559 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 12:58:45,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:45,559 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 12:58:45,567 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:45,584 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:58:45,584 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:45,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:45,934 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 12:58:45,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:45,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 12:58:45,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 12:58:45,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 12:58:45,958 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:45,958 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-10-04 12:58:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:46,383 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 12:58:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:58:46,385 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-10-04 12:58:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:46,386 INFO L225 Difference]: With dead ends: 16 [2018-10-04 12:58:46,386 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:58:46,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 13 [2018-10-04 12:58:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:58:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 12:58:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 12:58:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 12:58:46,390 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 12:58:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:46,390 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 12:58:46,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 12:58:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 12:58:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:58:46,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:46,391 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-04 12:58:46,391 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:46,391 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:46,391 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-04 12:58:46,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:46,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:46,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:46,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:46,754 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 12:58:46,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:46,755 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 12:58:46,764 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:46,784 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:58:46,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:46,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:47,210 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 12:58:47,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:47,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 12:58:47,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 12:58:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 12:58:47,231 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:47,232 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-10-04 12:58:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:47,521 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 12:58:47,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:58:47,522 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-10-04 12:58:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:47,523 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:58:47,523 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:58:47,524 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 12:58:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:58:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 12:58:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:58:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 12:58:47,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 12:58:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:47,529 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 12:58:47,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 12:58:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 12:58:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:58:47,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:47,531 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-04 12:58:47,531 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:47,531 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:47,531 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-04 12:58:47,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:47,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:47,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:47,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:47,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:48,032 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 12:58:48,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:48,033 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 12:58:48,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:48,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:49,000 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 12:58:49,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:49,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 12:58:49,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:58:49,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:58:49,024 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:49,024 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-10-04 12:58:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:49,434 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 12:58:49,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:58:49,434 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-10-04 12:58:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:49,435 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:58:49,435 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:58:49,435 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 12:58:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:58:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:58:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:58:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:58:49,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 12:58:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:49,440 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:58:49,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:58:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:58:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:58:49,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:49,441 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-04 12:58:49,441 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:49,441 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-04 12:58:49,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:49,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:49,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:49,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:49,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:49,880 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 12:58:49,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:49,881 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 12:58:49,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:49,903 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:49,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:49,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:50,800 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 12:58:50,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:50,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-04 12:58:50,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 12:58:50,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 12:58:50,822 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:50,822 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-10-04 12:58:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:51,325 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:58:51,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:58:51,325 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-10-04 12:58:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:51,326 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:58:51,326 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:58:51,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 1.0s impTime 16 [2018-10-04 12:58:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:58:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 12:58:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:58:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 12:58:51,331 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 12:58:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:51,333 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 12:58:51,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 12:58:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 12:58:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:51,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:51,334 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-04 12:58:51,334 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:51,334 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:51,334 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-04 12:58:51,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:51,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:51,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:51,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:51,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:52,032 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 12:58:52,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:52,033 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 12:58:52,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:52,061 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:58:52,061 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:52,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:52,656 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 12:58:52,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:52,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 12:58:52,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 12:58:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 12:58:52,678 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:52,678 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-10-04 12:58:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:53,190 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 12:58:53,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:58:53,190 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-10-04 12:58:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:53,191 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:58:53,191 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:58:53,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 17 [2018-10-04 12:58:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:58:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:58:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:58:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 12:58:53,195 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 12:58:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:53,195 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 12:58:53,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 12:58:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 12:58:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:58:53,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:53,196 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-04 12:58:53,197 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:53,197 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-04 12:58:53,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:53,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:53,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:53,904 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 12:58:53,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:53,905 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 12:58:53,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:53,940 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:53,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:53,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:54,580 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 12:58:54,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:54,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-04 12:58:54,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 12:58:54,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 12:58:54,602 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:54,602 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-10-04 12:58:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:55,068 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 12:58:55,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:58:55,069 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-10-04 12:58:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:55,069 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:58:55,069 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:58:55,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 1.0s impTime 18 [2018-10-04 12:58:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:58:55,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 12:58:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:58:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 12:58:55,074 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 12:58:55,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:55,075 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 12:58:55,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 12:58:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 12:58:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:55,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:55,076 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-04 12:58:55,076 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:55,076 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:55,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-04 12:58:55,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:55,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:55,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:55,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:55,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:55,699 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 12:58:55,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:55,700 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 12:58:55,707 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:55,727 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 12:58:55,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:55,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:56,982 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 12:58:57,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:57,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 12:58:57,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 12:58:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 12:58:57,004 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:57,004 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-10-04 12:58:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:57,794 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 12:58:57,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:58:57,794 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-10-04 12:58:57,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:57,795 INFO L225 Difference]: With dead ends: 22 [2018-10-04 12:58:57,795 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:58:57,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.5s impTime 19 [2018-10-04 12:58:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:58:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:58:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:58:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:58:57,801 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 12:58:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:57,801 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:58:57,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 12:58:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:58:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:58:57,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:57,802 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-04 12:58:57,802 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:57,802 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:57,802 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-04 12:58:57,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:57,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:57,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:57,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:57,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:58,635 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:58:58,637 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 12:58:58,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:58,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 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 12:58:58,649 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:58,670 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 12:58:58,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:58,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:59,682 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 12:58:59,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:59,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-04 12:58:59,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 12:58:59,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 12:58:59,705 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:59,705 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-10-04 12:59:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:00,559 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:59:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:59:00,559 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-10-04 12:59:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:00,560 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:59:00,560 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:59:00,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime 20 [2018-10-04 12:59:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:59:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 12:59:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:59:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 12:59:00,565 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 12:59:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:00,565 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 12:59:00,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 12:59:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 12:59:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:59:00,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:00,566 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-04 12:59:00,566 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:00,566 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-04 12:59:00,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:00,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:00,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:00,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:00,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:01,290 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 14 [2018-10-04 12:59:01,339 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 12:59:01,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:01,340 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 12:59:01,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:01,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:02,337 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 12:59:02,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:02,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 12:59:02,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 12:59:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 12:59:02,366 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:02,366 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-10-04 12:59:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:03,291 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 12:59:03,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:59:03,292 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-10-04 12:59:03,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:03,293 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:59:03,293 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:59:03,293 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 27 [2018-10-04 12:59:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:59:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:59:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:59:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 12:59:03,301 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 12:59:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:03,301 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 12:59:03,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 12:59:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 12:59:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:59:03,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:03,302 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-04 12:59:03,302 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:03,302 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-04 12:59:03,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:03,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:03,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:03,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:03,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:04,287 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 12:59:04,404 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 12:59:04,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:04,404 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 12:59:04,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:04,434 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:04,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:04,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:05,132 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 32 new depth: 19 [2018-10-04 12:59:05,491 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 12:59:05,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:05,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-04 12:59:05,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 12:59:05,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 12:59:05,512 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:05,512 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-10-04 12:59:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:06,376 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 12:59:06,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:59:06,377 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-10-04 12:59:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:06,377 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:59:06,378 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:59:06,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.6s impTime 19 [2018-10-04 12:59:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:59:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 12:59:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:59:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 12:59:06,382 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 12:59:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:06,382 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 12:59:06,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 12:59:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 12:59:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:59:06,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:06,383 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-04 12:59:06,383 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:06,383 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:06,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-04 12:59:06,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:06,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:06,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:06,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:06,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:07,296 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 12:59:07,493 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 12:59:07,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:07,494 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 12:59:07,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:07,529 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 12:59:07,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:07,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:08,709 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 32 new depth: 19 [2018-10-04 12:59:08,900 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 12:59:08,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:08,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-04 12:59:08,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:59:08,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:59:08,921 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:08,922 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-10-04 12:59:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:10,037 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 12:59:10,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:59:10,038 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-10-04 12:59:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:10,039 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:59:10,039 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:59:10,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 1.9s impTime 19 [2018-10-04 12:59:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:59:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 12:59:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:59:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 12:59:10,044 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 12:59:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:10,044 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 12:59:10,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:59:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 12:59:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:59:10,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:10,045 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-04 12:59:10,046 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:10,047 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-04 12:59:10,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:10,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:10,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:10,917 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 18 [2018-10-04 12:59:11,202 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 12:59:11,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:11,202 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 12:59:11,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:11,234 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:11,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:11,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:12,021 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 34 new depth: 20 [2018-10-04 12:59:12,590 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 12:59:12,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:12,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-04 12:59:12,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 12:59:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 12:59:12,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:12,613 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-10-04 12:59:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:13,817 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 12:59:13,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:59:13,818 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-10-04 12:59:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:13,818 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:59:13,819 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:59:13,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.9s impTime 20 [2018-10-04 12:59:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:59:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 12:59:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:59:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 12:59:13,825 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 12:59:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:13,825 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 12:59:13,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 12:59:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 12:59:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:59:13,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:13,826 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-04 12:59:13,826 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:13,826 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-04 12:59:13,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:13,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:13,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:13,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:13,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:14,720 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 11 [2018-10-04 12:59:15,067 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 12:59:15,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:15,068 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 12:59:15,077 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:15,110 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 12:59:15,110 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:15,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:16,513 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 27 new depth: 18 [2018-10-04 12:59:17,143 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 12:59:17,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:17,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-04 12:59:17,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 12:59:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 12:59:17,166 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:17,166 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-10-04 12:59:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:18,213 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 12:59:18,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:59:18,214 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-10-04 12:59:18,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:18,215 INFO L225 Difference]: With dead ends: 28 [2018-10-04 12:59:18,215 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:59:18,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.6s impTime 18 [2018-10-04 12:59:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:59:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 12:59:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:59:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 12:59:18,219 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 12:59:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:18,219 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 12:59:18,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 12:59:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 12:59:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:59:18,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:18,220 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-04 12:59:18,220 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:18,220 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:18,221 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-04 12:59:18,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:18,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:18,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:18,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:18,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:19,250 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 12:59:19,711 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 12:59:19,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:19,711 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 12:59:19,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:19,764 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:59:19,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:19,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:22,009 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 12:59:22,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:22,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-04 12:59:22,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 12:59:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 12:59:22,031 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:22,031 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-10-04 12:59:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:23,346 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 12:59:23,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:59:23,347 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-10-04 12:59:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:23,347 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:59:23,348 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 12:59:23,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time 3.1s impTime 30 [2018-10-04 12:59:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 12:59:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 12:59:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:59:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 12:59:23,353 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 12:59:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:23,353 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 12:59:23,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 12:59:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 12:59:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 12:59:23,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:23,354 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-04 12:59:23,354 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:23,355 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-04 12:59:23,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:23,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:23,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:23,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:24,347 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 12 [2018-10-04 12:59:24,900 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 12:59:24,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:24,900 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 12:59:24,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:24,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:27,430 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 28 new depth: 18 [2018-10-04 12:59:28,188 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 12:59:28,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:28,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-04 12:59:28,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:59:28,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:59:28,211 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:28,211 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-10-04 12:59:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:29,711 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 12:59:29,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:59:29,712 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-10-04 12:59:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:29,712 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:59:29,713 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:59:29,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s Time 4.0s impTime 18 [2018-10-04 12:59:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:59:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 12:59:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:59:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 12:59:29,718 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 12:59:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:29,718 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 12:59:29,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:59:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 12:59:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:59:29,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:29,719 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-04 12:59:29,719 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:29,719 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-04 12:59:29,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:29,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:29,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:29,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:29,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:31,407 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 14 [2018-10-04 12:59:32,098 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 12:59:32,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:32,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 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 12:59:32,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:32,137 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:32,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:32,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:33,214 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 30 new depth: 22 [2018-10-04 12:59:34,390 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 12:59:34,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:34,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-04 12:59:34,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 12:59:34,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 12:59:34,412 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:34,413 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-10-04 12:59:36,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:36,182 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 12:59:36,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:59:36,182 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-10-04 12:59:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:36,183 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:59:36,183 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:59:36,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s Time 3.7s impTime 22 [2018-10-04 12:59:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:59:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 12:59:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:59:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 12:59:36,188 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 12:59:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:36,188 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 12:59:36,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 12:59:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 12:59:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:59:36,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:36,189 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-04 12:59:36,189 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:36,189 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:36,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-04 12:59:36,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:36,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:36,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:36,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:36,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:37,105 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 15 [2018-10-04 12:59:38,004 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 12:59:38,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:38,005 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 12:59:38,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:38,059 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 12:59:38,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:38,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:39,100 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 31 new depth: 20 [2018-10-04 12:59:40,549 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 12:59:40,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:40,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-04 12:59:40,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 12:59:40,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 12:59:40,569 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:40,569 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-10-04 12:59:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:42,758 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 12:59:42,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:59:42,759 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-10-04 12:59:42,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:42,759 INFO L225 Difference]: With dead ends: 32 [2018-10-04 12:59:42,760 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:59:42,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s Time 3.6s impTime 20 [2018-10-04 12:59:42,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:59:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 12:59:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:59:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 12:59:42,766 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 12:59:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:42,766 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 12:59:42,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 12:59:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 12:59:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:59:42,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:42,767 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-04 12:59:42,767 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:42,767 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:42,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-04 12:59:42,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:42,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:42,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:42,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:42,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:43,771 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 17 [2018-10-04 12:59:44,707 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 12:59:44,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:44,708 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 12:59:44,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:44,750 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:44,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:44,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:45,805 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 33 new depth: 24 [2018-10-04 12:59:47,030 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 12:59:47,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:47,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-04 12:59:47,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 12:59:47,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 12:59:47,052 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:47,052 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-10-04 12:59:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:48,830 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 12:59:48,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:59:48,831 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-10-04 12:59:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:48,831 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:59:48,831 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:59:48,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time 3.5s impTime 24 [2018-10-04 12:59:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:59:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 12:59:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 12:59:48,838 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 12:59:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:48,838 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 12:59:48,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 12:59:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 12:59:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:59:48,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:48,839 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-04 12:59:48,839 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:48,839 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-04 12:59:48,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:48,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:48,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:48,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:48,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:50,223 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:59:51,331 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 12:59:51,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:51,332 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 12:59:51,345 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:51,396 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 12:59:51,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:51,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:54,198 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 12:59:54,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:54,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-04 12:59:54,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 12:59:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 12:59:54,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:54,220 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-10-04 12:59:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:56,527 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 12:59:56,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:59:56,528 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-10-04 12:59:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:56,528 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:59:56,528 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:59:56,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s Time 4.5s impTime 31 [2018-10-04 12:59:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:59:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:59:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:59:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 12:59:56,534 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 12:59:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:56,535 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 12:59:56,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 12:59:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 12:59:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:59:56,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:56,536 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-04 12:59:56,536 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:56,536 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:56,536 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-04 12:59:56,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:56,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:56,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:56,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:56,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:57,636 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 18 [2018-10-04 12:59:58,909 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 12:59:58,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:58,909 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 12:59:58,918 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:58,977 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 12:59:58,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:58,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:01,212 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 34 new depth: 28 [2018-10-04 13:00:02,399 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 13:00:02,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:02,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-04 13:00:02,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 13:00:02,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 13:00:02,422 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:02,422 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-10-04 13:00:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:05,385 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 13:00:05,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 13:00:05,385 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-10-04 13:00:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:05,386 INFO L225 Difference]: With dead ends: 35 [2018-10-04 13:00:05,386 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 13:00:05,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s Time 4.9s impTime 28 [2018-10-04 13:00:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 13:00:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 13:00:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 13:00:05,390 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 13:00:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:05,390 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 13:00:05,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 13:00:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 13:00:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 13:00:05,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:05,391 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-04 13:00:05,392 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:05,392 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:05,392 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-04 13:00:05,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:05,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:05,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:05,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:05,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:06,463 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 18 [2018-10-04 13:00:07,915 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 13:00:07,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:07,915 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 13:00:07,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:07,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:10,059 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 34 new depth: 29 [2018-10-04 13:00:11,537 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 13:00:11,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:11,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-04 13:00:11,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 13:00:11,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 13:00:11,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:11,559 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-10-04 13:00:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:14,172 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 13:00:14,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 13:00:14,172 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-10-04 13:00:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:14,173 INFO L225 Difference]: With dead ends: 36 [2018-10-04 13:00:14,173 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 13:00:14,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s Time 5.2s impTime 29 [2018-10-04 13:00:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 13:00:14,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 13:00:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 13:00:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 13:00:14,178 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 13:00:14,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:14,179 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 13:00:14,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 13:00:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 13:00:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 13:00:14,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:14,179 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-04 13:00:14,180 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:14,180 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-04 13:00:14,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:14,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:14,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:14,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:14,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:15,465 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 13:00:17,119 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 13:00:17,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:17,119 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 13:00:17,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 13:00:17,171 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 13:00:17,171 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:17,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:20,569 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 13:00:20,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:20,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-04 13:00:20,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 13:00:20,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 13:00:20,590 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:20,590 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-10-04 13:00:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:23,307 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 13:00:23,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 13:00:23,307 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-10-04 13:00:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:23,308 INFO L225 Difference]: With dead ends: 37 [2018-10-04 13:00:23,308 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 13:00:23,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s Time 5.5s impTime 34 [2018-10-04 13:00:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 13:00:23,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 13:00:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 13:00:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 13:00:23,313 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 13:00:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:23,314 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 13:00:23,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 13:00:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 13:00:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 13:00:23,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:23,314 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-04 13:00:23,315 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:23,315 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-04 13:00:23,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:23,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:23,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:23,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:23,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:24,446 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 17 [2018-10-04 13:00:26,268 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 13:00:26,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:26,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 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 13:00:26,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 13:00:26,349 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 13:00:26,349 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:26,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:27,710 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 33 new depth: 26 [2018-10-04 13:00:30,380 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 13:00:30,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:30,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-04 13:00:30,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 13:00:30,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 13:00:30,402 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:30,402 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-10-04 13:00:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:33,867 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 13:00:33,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 13:00:33,868 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-10-04 13:00:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:33,868 INFO L225 Difference]: With dead ends: 38 [2018-10-04 13:00:33,868 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 13:00:33,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s Time 6.1s impTime 26 [2018-10-04 13:00:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 13:00:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 13:00:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 13:00:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 13:00:33,874 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 13:00:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:33,874 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 13:00:33,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 13:00:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 13:00:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 13:00:33,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:33,874 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-04 13:00:33,875 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:33,875 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:33,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-04 13:00:33,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:33,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:33,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:33,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:33,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:35,064 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 15 [2018-10-04 13:00:37,305 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 31 new depth: 31 [2018-10-04 13:00:37,310 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 13:00:37,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:37,310 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 13:00:37,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 13:00:37,370 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 13:00:37,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:37,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:41,991 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 49 new depth: 35 [2018-10-04 13:00:42,212 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 13:00:42,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:42,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-04 13:00:42,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 13:00:42,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 13:00:42,233 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:42,233 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-10-04 13:00:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:45,670 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 13:00:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 13:00:45,670 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-10-04 13:00:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:45,671 INFO L225 Difference]: With dead ends: 39 [2018-10-04 13:00:45,671 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 13:00:45,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s Time 6.8s impTime 35 [2018-10-04 13:00:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 13:00:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 13:00:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 13:00:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 13:00:45,677 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 13:00:45,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:45,677 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 13:00:45,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 13:00:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 13:00:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 13:00:45,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:45,678 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-04 13:00:45,678 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:45,678 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:45,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-04 13:00:45,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:45,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:45,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:45,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:45,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:46,925 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 14 [2018-10-04 13:00:49,256 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 30 new depth: 30 [2018-10-04 13:00:49,399 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 13:00:49,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:49,399 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 13:00:49,408 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 13:00:49,482 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 13:00:49,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:49,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:53,542 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 48 new depth: 29 [2018-10-04 13:00:53,948 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 13:00:53,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:53,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-04 13:00:53,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 13:00:53,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 13:00:53,969 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:53,969 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-10-04 13:00:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:57,498 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 13:00:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 13:00:57,498 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-10-04 13:00:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:57,499 INFO L225 Difference]: With dead ends: 40 [2018-10-04 13:00:57,499 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 13:00:57,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s Time 6.9s impTime 29 [2018-10-04 13:00:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 13:00:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 13:00:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 13:00:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 13:00:57,507 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 13:00:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:57,507 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 13:00:57,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 13:00:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 13:00:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 13:00:57,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:57,508 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-04 13:00:57,508 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:57,508 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-04 13:00:57,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:57,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:57,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:57,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:57,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:58,990 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 12 [2018-10-04 13:01:01,457 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 13:01:01,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:01:01,458 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 13:01:01,466 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 13:01:01,530 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 13:01:01,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:01:01,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:01:03,329 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 28 new depth: 28 [2018-10-04 13:01:06,387 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 46 new depth: 29 [2018-10-04 13:01:06,397 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 13:01:06,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:01:06,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-04 13:01:06,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 13:01:06,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 13:01:06,419 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:01:06,419 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-10-04 13:01:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:01:09,745 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 13:01:09,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 13:01:09,746 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-10-04 13:01:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:01:09,746 INFO L225 Difference]: With dead ends: 41 [2018-10-04 13:01:09,747 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 13:01:09,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s Time 7.3s impTime 29 [2018-10-04 13:01:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 13:01:09,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 13:01:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 13:01:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 13:01:09,751 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 13:01:09,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:01:09,751 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 13:01:09,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 13:01:09,751 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 13:01:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 13:01:09,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:01:09,752 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-04 13:01:09,752 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:01:09,752 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:01:09,752 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-04 13:01:09,752 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:01:09,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:01:09,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:01:09,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:01:09,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:01:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:01:11,068 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 13:01:13,789 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 13:01:13,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:01:13,789 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 13:01:13,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:01:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:01:13,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:01:17,268 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 35 new depth: 23 [2018-10-04 13:01:18,776 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 13:01:18,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:01:18,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-04 13:01:18,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 13:01:18,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 13:01:18,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:01:18,798 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. [2018-10-04 13:01:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:01:22,329 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 13:01:22,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 13:01:22,330 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 39 [2018-10-04 13:01:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:01:22,330 INFO L225 Difference]: With dead ends: 42 [2018-10-04 13:01:22,331 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 13:01:22,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s Time 7.9s impTime 23 [2018-10-04 13:01:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 13:01:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 13:01:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 13:01:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 13:01:22,336 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 13:01:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:01:22,336 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 13:01:22,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 13:01:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 13:01:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 13:01:22,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:01:22,336 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-04 13:01:22,337 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:01:22,337 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:01:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-04 13:01:22,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:01:22,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:01:22,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:01:22,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:01:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:01:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:01:23,644 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 11 [2018-10-04 13:01:26,029 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 27 new depth: 26 [2018-10-04 13:01:26,735 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 13:01:26,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:01:26,735 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 13:01:26,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 13:01:26,804 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 13:01:26,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:01:26,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:01:28,269 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 41 new depth: 28 [2018-10-04 13:01:32,170 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 13:01:32,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:01:32,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-04 13:01:32,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 13:01:32,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 13:01:32,190 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:01:32,190 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 79 states. [2018-10-04 13:01:36,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:01:36,148 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 13:01:36,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 13:01:36,149 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 40 [2018-10-04 13:01:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:01:36,149 INFO L225 Difference]: With dead ends: 43 [2018-10-04 13:01:36,149 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 13:01:36,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s Time 8.5s impTime 30 [2018-10-04 13:01:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 13:01:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 13:01:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 13:01:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 13:01:36,155 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 13:01:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:01:36,155 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 13:01:36,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 13:01:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 13:01:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 13:01:36,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:01:36,156 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-04 13:01:36,156 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:01:36,156 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:01:36,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-04 13:01:36,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:01:36,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:01:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:01:36,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:01:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:01:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:01:37,522 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 18 [2018-10-04 13:01:40,016 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 34 new depth: 26 [2018-10-04 13:01:40,950 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 13:01:40,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:01:40,951 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 13:01:40,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 13:01:41,058 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 13:01:41,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:01:41,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:01:43,119 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 41 new depth: 23 [2018-10-04 13:01:46,890 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 13:01:46,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:01:46,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-04 13:01:46,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 13:01:46,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 13:01:46,911 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:01:46,911 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 81 states. [2018-10-04 13:01:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:01:51,842 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 13:01:51,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 13:01:51,842 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 41 [2018-10-04 13:01:51,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:01:51,843 INFO L225 Difference]: With dead ends: 44 [2018-10-04 13:01:51,843 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 13:01:51,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s Time 9.2s impTime 29 [2018-10-04 13:01:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 13:01:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 13:01:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 13:01:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 13:01:51,848 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 13:01:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:01:51,848 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 13:01:51,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 13:01:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 13:01:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 13:01:51,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:01:51,848 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-04 13:01:51,849 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:01:51,849 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:01:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-04 13:01:51,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:01:51,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:01:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:01:51,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:01:51,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:01:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:01:53,314 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 13:01:56,572 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 32 new depth: 32 [2018-10-04 13:01:56,945 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 13:01:56,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:01:56,945 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 13:01:56,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 13:01:57,025 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 13:01:57,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:01:57,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:02:02,802 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 50 new depth: 30 [2018-10-04 13:02:03,552 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 13:02:03,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:02:03,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-04 13:02:03,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 13:02:03,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 13:02:03,574 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:02:03,574 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 83 states. [2018-10-04 13:02:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:02:09,209 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 13:02:09,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 13:02:09,210 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 42 [2018-10-04 13:02:09,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:02:09,211 INFO L225 Difference]: With dead ends: 45 [2018-10-04 13:02:09,211 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 13:02:09,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s Time 10.0s impTime 30 [2018-10-04 13:02:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 13:02:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 13:02:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 13:02:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 13:02:09,216 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 13:02:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:02:09,216 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 13:02:09,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 13:02:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 13:02:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 13:02:09,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:02:09,217 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-04 13:02:09,217 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:02:09,217 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:02:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-04 13:02:09,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:02:09,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:02:09,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:02:09,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:02:09,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:02:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:02:10,630 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 13:02:13,158 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 32 new depth: 28 [2018-10-04 13:02:14,553 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 13:02:14,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:02:14,554 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 13:02:14,561 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 13:02:14,704 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 13:02:14,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:02:14,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:02:18,286 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 46 new depth: 28 [2018-10-04 13:02:22,138 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 13:02:22,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:02:22,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-04 13:02:22,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 13:02:22,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 13:02:22,159 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:02:22,159 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 85 states. [2018-10-04 13:02:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:02:28,793 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 13:02:28,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 13:02:28,794 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 43 [2018-10-04 13:02:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:02:28,794 INFO L225 Difference]: With dead ends: 46 [2018-10-04 13:02:28,795 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 13:02:28,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s Time 11.2s impTime 28 [2018-10-04 13:02:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 13:02:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 13:02:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 13:02:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 13:02:28,799 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 13:02:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:02:28,800 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 13:02:28,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 13:02:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 13:02:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 13:02:28,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:02:28,800 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-04 13:02:28,800 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:02:28,800 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:02:28,801 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-04 13:02:28,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:02:28,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:02:28,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:02:28,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:02:28,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:02:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:02:30,242 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 14 [2018-10-04 13:02:34,263 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 30 new depth: 30 [2018-10-04 13:02:34,445 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 13:02:34,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:02:34,445 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 13:02:34,453 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 13:02:34,626 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 13:02:34,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:02:34,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:02:41,113 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 48 new depth: 33 [2018-10-04 13:02:41,619 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 13:02:41,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:02:41,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-04 13:02:41,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 13:02:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 13:02:41,641 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:02:41,641 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 87 states. [2018-10-04 13:02:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:02:46,857 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 13:02:46,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 13:02:46,857 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 44 [2018-10-04 13:02:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:02:46,858 INFO L225 Difference]: With dead ends: 47 [2018-10-04 13:02:46,858 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 13:02:46,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s Time 10.9s impTime 33 [2018-10-04 13:02:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 13:02:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 13:02:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 13:02:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 13:02:46,863 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 13:02:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:02:46,863 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 13:02:46,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 13:02:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 13:02:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 13:02:46,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:02:46,864 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-04 13:02:46,864 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:02:46,864 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:02:46,864 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-04 13:02:46,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:02:46,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:02:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:02:46,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:02:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:02:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:02:48,362 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 13:02:50,944 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 35 new depth: 22 [2018-10-04 13:02:52,820 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 13:02:52,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:02:52,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 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 13:02:52,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:02:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:02:52,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:02:56,229 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 40 new depth: 23 [2018-10-04 13:03:00,941 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 13:03:00,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:03:00,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-04 13:03:00,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 13:03:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 13:03:00,962 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:03:00,962 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 89 states. Received shutdown request... [2018-10-04 13:03:03,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 13:03:03,391 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 13:03:03,396 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 13:03:03,396 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 01:03:03 BoogieIcfgContainer [2018-10-04 13:03:03,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 13:03:03,397 INFO L168 Benchmark]: Toolchain (without parser) took 267009.96 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 134.7 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 272.6 MB). Peak memory consumption was 407.3 MB. Max. memory is 7.1 GB. [2018-10-04 13:03:03,399 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 13:03:03,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.17 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 13:03:03,400 INFO L168 Benchmark]: Boogie Preprocessor took 19.37 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 13:03:03,400 INFO L168 Benchmark]: RCFGBuilder took 266.10 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 13:03:03,401 INFO L168 Benchmark]: TraceAbstraction took 266680.35 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 134.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 251.4 MB). Peak memory consumption was 386.2 MB. Max. memory is 7.1 GB. [2018-10-04 13:03:03,405 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.17 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 19.37 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 266.10 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 266680.35 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 134.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 251.4 MB). Peak memory consumption was 386.2 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 22 states, 89 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 266.6s OverallTime, 44 OverallIterations, 43 TraceHistogramMax, 76.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 88 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 33510 SolverSat, 946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1936 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 180.4s 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, 185.5s 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_13-03-03-415.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_13-03-03-415.csv Completed graceful shutdown