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-133090d [2018-10-04 09:53:00,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:53:00,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:53:00,050 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:53:00,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:53:00,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:53:00,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:53:00,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:53:00,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:53:00,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:53:00,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:53:00,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:53:00,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:53:00,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:53:00,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:53:00,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:53:00,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:53:00,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:53:00,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:53:00,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:53:00,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:53:00,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:53:00,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:53:00,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:53:00,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:53:00,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:53:00,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:53:00,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:53:00,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:53:00,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:53:00,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:53:00,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:53:00,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:53:00,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:53:00,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:53:00,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:53:00,080 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 09:53:00,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:53:00,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:53:00,106 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:53:00,106 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:53:00,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:53:00,109 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:53:00,110 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:53:00,110 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:53:00,110 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:53:00,110 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:53:00,111 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:53:00,111 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:53:00,111 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:53:00,111 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:53:00,111 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:53:00,111 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:53:00,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:53:00,113 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:53:00,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:53:00,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:53:00,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:53:00,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:53:00,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:53:00,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:53:00,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:53:00,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:53:00,115 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:53:00,115 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:53:00,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:53:00,116 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:53:00,116 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:53:00,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:53:00,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:53:00,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:53:00,198 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:53:00,198 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:53:00,199 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 09:53:00,199 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-10-04 09:53:00,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:53:00,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:53:00,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:53:00,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:53:00,252 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:53:00,275 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 09:53:00" (1/1) ... [2018-10-04 09:53:00,288 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 09:53:00" (1/1) ... [2018-10-04 09:53:00,293 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:53:00,293 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:53:00,293 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:53:00,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:53:00,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:53:00,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:53:00,296 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:53:00,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:53:00" (1/1) ... [2018-10-04 09:53:00,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:53:00" (1/1) ... [2018-10-04 09:53:00,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:53:00" (1/1) ... [2018-10-04 09:53:00,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:53:00" (1/1) ... [2018-10-04 09:53:00,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:53:00" (1/1) ... [2018-10-04 09:53:00,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:53:00" (1/1) ... [2018-10-04 09:53:00,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:53:00" (1/1) ... [2018-10-04 09:53:00,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:53:00,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:53:00,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:53:00,322 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:53:00,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:53:00" (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 09:53:00,398 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 09:53:00,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 09:53:00,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 09:53:00,597 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:53:00,598 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:53:00 BoogieIcfgContainer [2018-10-04 09:53:00,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:53:00,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:53:00,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:53:00,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:53:00,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:53:00" (1/2) ... [2018-10-04 09:53:00,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3650a7a1 and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:53:00, skipping insertion in model container [2018-10-04 09:53:00,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:53:00" (2/2) ... [2018-10-04 09:53:00,610 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-10-04 09:53:00,620 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:53:00,627 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:53:00,671 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:53:00,672 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:53:00,672 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:53:00,672 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:53:00,673 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:53:00,673 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:53:00,673 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:53:00,673 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:53:00,673 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:53:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 09:53:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 09:53:00,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:00,696 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 09:53:00,697 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:00,704 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:00,705 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-04 09:53:00,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:00,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:00,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:00,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:00,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:00,869 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 09:53:00,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:53:00,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 09:53:00,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:53:00,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:53:00,889 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:00,891 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 09:53:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:00,932 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 09:53:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:53:00,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 09:53:00,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:00,947 INFO L225 Difference]: With dead ends: 9 [2018-10-04 09:53:00,947 INFO L226 Difference]: Without dead ends: 4 [2018-10-04 09:53:00,950 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 09:53:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-04 09:53:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-04 09:53:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-04 09:53:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-04 09:53:00,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-04 09:53:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:00,983 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-04 09:53:00,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:53:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-04 09:53:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 09:53:00,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:00,984 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 09:53:00,984 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:00,985 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-04 09:53:00,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:00,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:00,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:00,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:00,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:01,165 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 09:53:01,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:01,166 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 09:53:01,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:01,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:01,307 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 09:53:01,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:01,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-10-04 09:53:01,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:53:01,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:53:01,337 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:01,338 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-10-04 09:53:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:01,392 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-04 09:53:01,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:53:01,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-10-04 09:53:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:01,393 INFO L225 Difference]: With dead ends: 6 [2018-10-04 09:53:01,394 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 09:53:01,395 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 09:53:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 09:53:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 09:53:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 09:53:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 09:53:01,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 09:53:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:01,398 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 09:53:01,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:53:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 09:53:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 09:53:01,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:01,398 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-04 09:53:01,399 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:01,399 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:01,399 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-04 09:53:01,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:01,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:01,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:01,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:01,500 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 09:53:01,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:01,501 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 09:53:01,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:01,532 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:01,532 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:01,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:01,616 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 09:53:01,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:01,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-04 09:53:01,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:53:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:53:01,637 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:01,637 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-10-04 09:53:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:01,672 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-04 09:53:01,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:53:01,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-10-04 09:53:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:01,673 INFO L225 Difference]: With dead ends: 7 [2018-10-04 09:53:01,674 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 09:53:01,674 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 09:53:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 09:53:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 09:53:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 09:53:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 09:53:01,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 09:53:01,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:01,678 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 09:53:01,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:53:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 09:53:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:53:01,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:01,679 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-04 09:53:01,679 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:01,680 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:01,680 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-04 09:53:01,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:01,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:01,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:01,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:01,906 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 09:53:01,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:01,907 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 09:53:01,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:01,954 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 09:53:01,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:01,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:02,219 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 09:53:02,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:02,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 09:53:02,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:53:02,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:53:02,240 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:02,241 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-10-04 09:53:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:02,299 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 09:53:02,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:53:02,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-10-04 09:53:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:02,300 INFO L225 Difference]: With dead ends: 8 [2018-10-04 09:53:02,300 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:53:02,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 5 [2018-10-04 09:53:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:53:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 09:53:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 09:53:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 09:53:02,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 09:53:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:02,306 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 09:53:02,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:53:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 09:53:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:53:02,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:02,307 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-04 09:53:02,307 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:02,307 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-04 09:53:02,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:02,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:02,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:02,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:02,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:02,467 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 09:53:02,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:02,468 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 09:53:02,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:02,504 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:02,504 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:02,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:02,700 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 09:53:02,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:02,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 09:53:02,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:02,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:02,723 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:02,723 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-10-04 09:53:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:02,815 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 09:53:02,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:53:02,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-10-04 09:53:02,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:02,817 INFO L225 Difference]: With dead ends: 9 [2018-10-04 09:53:02,817 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 09:53:02,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 6 [2018-10-04 09:53:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 09:53:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 09:53:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 09:53:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 09:53:02,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 09:53:02,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:02,823 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 09:53:02,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 09:53:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:53:02,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:02,824 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-04 09:53:02,824 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:02,824 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:02,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-04 09:53:02,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:02,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:02,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:02,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:02,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:03,005 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 09:53:03,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:03,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 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 09:53:03,015 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:03,026 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 09:53:03,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:03,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:03,590 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 09:53:03,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:03,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 09:53:03,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 09:53:03,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 09:53:03,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:03,613 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-10-04 09:53:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:03,789 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 09:53:03,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:53:03,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-10-04 09:53:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:03,790 INFO L225 Difference]: With dead ends: 10 [2018-10-04 09:53:03,790 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 09:53:03,791 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 09:53:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 09:53:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 09:53:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:53:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 09:53:03,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 09:53:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:03,794 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 09:53:03,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 09:53:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 09:53:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:53:03,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:03,795 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-04 09:53:03,796 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:03,796 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-04 09:53:03,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:03,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:03,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:03,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:04,138 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 09:53:04,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:04,138 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 09:53:04,147 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:04,175 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 09:53:04,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:04,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:04,321 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 09:53:04,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:04,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 09:53:04,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 09:53:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 09:53:04,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:04,344 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-10-04 09:53:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:04,457 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 09:53:04,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:53:04,457 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-10-04 09:53:04,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:04,458 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:53:04,458 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 09:53:04,459 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 09:53:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 09:53:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 09:53:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 09:53:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 09:53:04,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 09:53:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:04,463 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 09:53:04,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 09:53:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 09:53:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:53:04,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:04,464 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-04 09:53:04,464 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:04,465 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:04,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-04 09:53:04,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:04,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:04,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:04,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:04,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:04,633 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 09:53:04,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:04,634 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 09:53:04,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:04,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:05,241 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 09:53:05,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:05,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 09:53:05,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:53:05,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:53:05,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:05,263 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-10-04 09:53:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:05,398 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 09:53:05,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:53:05,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-10-04 09:53:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:05,400 INFO L225 Difference]: With dead ends: 12 [2018-10-04 09:53:05,400 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 09:53:05,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 9 [2018-10-04 09:53:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 09:53:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 09:53:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 09:53:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 09:53:05,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 09:53:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:05,406 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 09:53:05,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:53:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 09:53:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:53:05,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:05,406 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-04 09:53:05,407 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:05,407 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:05,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-04 09:53:05,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:05,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:05,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:05,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:05,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:05,824 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 09:53:05,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:05,824 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 09:53:05,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:05,843 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:05,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:05,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:06,115 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 09:53:06,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:06,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 09:53:06,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 09:53:06,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 09:53:06,139 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:06,139 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-10-04 09:53:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:06,284 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 09:53:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:06,285 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-10-04 09:53:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:06,286 INFO L225 Difference]: With dead ends: 13 [2018-10-04 09:53:06,287 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 09:53:06,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 10 [2018-10-04 09:53:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 09:53:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 09:53:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:53:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 09:53:06,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 09:53:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:06,291 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 09:53:06,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 09:53:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 09:53:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:53:06,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:06,292 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-04 09:53:06,292 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:06,292 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:06,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-04 09:53:06,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:06,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:06,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:06,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:06,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:06,625 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 09:53:06,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:06,626 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 09:53:06,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:06,663 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 09:53:06,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:06,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:06,929 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 09:53:06,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:06,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 09:53:06,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 09:53:06,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 09:53:06,952 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:06,952 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-10-04 09:53:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:07,149 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 09:53:07,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:53:07,149 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-10-04 09:53:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:07,150 INFO L225 Difference]: With dead ends: 14 [2018-10-04 09:53:07,150 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 09:53:07,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 11 [2018-10-04 09:53:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 09:53:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 09:53:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 09:53:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 09:53:07,155 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 09:53:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:07,156 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 09:53:07,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 09:53:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 09:53:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:53:07,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:07,157 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-04 09:53:07,157 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:07,157 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:07,158 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-04 09:53:07,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:07,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:07,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:07,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:07,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:07,444 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 09:53:07,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:07,444 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 09:53:07,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:07,464 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:07,465 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:07,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:08,371 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 09:53:08,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:08,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 09:53:08,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 09:53:08,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 09:53:08,394 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:08,395 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-10-04 09:53:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:08,678 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 09:53:08,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:53:08,679 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-10-04 09:53:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:08,680 INFO L225 Difference]: With dead ends: 15 [2018-10-04 09:53:08,680 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 09:53:08,681 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 09:53:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 09:53:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 09:53:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:53:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 09:53:08,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 09:53:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:08,686 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 09:53:08,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 09:53:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 09:53:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:53:08,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:08,687 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-04 09:53:08,687 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:08,687 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-04 09:53:08,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:08,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:08,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:08,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:08,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:09,114 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 09:53:09,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:09,115 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 09:53:09,150 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:09,189 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:53:09,190 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:09,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:09,567 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 09:53:09,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:09,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 09:53:09,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 09:53:09,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 09:53:09,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:09,589 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-10-04 09:53:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:10,021 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 09:53:10,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:53:10,021 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-10-04 09:53:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:10,022 INFO L225 Difference]: With dead ends: 16 [2018-10-04 09:53:10,022 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 09:53:10,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 13 [2018-10-04 09:53:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 09:53:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 09:53:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 09:53:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 09:53:10,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 09:53:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:10,026 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 09:53:10,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 09:53:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 09:53:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:53:10,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:10,027 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-04 09:53:10,027 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:10,027 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:10,027 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-04 09:53:10,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:10,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:10,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:10,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:10,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:10,746 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 09:53:10,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:10,747 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 09:53:10,755 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:10,775 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:53:10,775 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:10,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:11,179 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 09:53:11,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:11,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 09:53:11,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 09:53:11,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 09:53:11,201 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:11,201 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-10-04 09:53:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:11,473 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 09:53:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:53:11,474 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-10-04 09:53:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:11,475 INFO L225 Difference]: With dead ends: 17 [2018-10-04 09:53:11,475 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 09:53:11,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 14 [2018-10-04 09:53:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 09:53:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 09:53:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:53:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 09:53:11,481 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 09:53:11,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:11,481 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 09:53:11,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 09:53:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 09:53:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:53:11,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:11,482 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-04 09:53:11,483 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:11,483 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:11,483 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-04 09:53:11,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:11,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:11,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:11,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:11,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:11,980 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 09:53:11,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:11,981 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 09:53:11,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:12,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:12,915 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 09:53:12,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:12,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 09:53:12,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 09:53:12,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 09:53:12,936 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:12,936 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-10-04 09:53:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:13,348 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 09:53:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:53:13,349 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-10-04 09:53:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:13,349 INFO L225 Difference]: With dead ends: 18 [2018-10-04 09:53:13,349 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 09:53:13,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 15 [2018-10-04 09:53:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 09:53:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 09:53:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 09:53:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 09:53:13,353 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 09:53:13,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:13,354 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 09:53:13,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 09:53:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 09:53:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:53:13,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:13,355 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-04 09:53:13,355 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:13,355 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:13,355 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-04 09:53:13,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:13,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:13,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:13,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:13,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:13,790 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 09:53:13,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:13,790 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 09:53:13,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:13,817 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:13,817 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:13,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:14,602 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 09:53:14,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:14,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-04 09:53:14,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 09:53:14,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 09:53:14,624 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:14,624 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-10-04 09:53:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:15,111 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 09:53:15,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:53:15,112 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-10-04 09:53:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:15,113 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:53:15,113 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 09:53:15,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 16 [2018-10-04 09:53:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 09:53:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 09:53:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:53:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 09:53:15,118 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 09:53:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:15,119 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 09:53:15,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 09:53:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 09:53:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:53:15,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:15,120 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-04 09:53:15,120 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:15,120 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:15,120 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-04 09:53:15,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:15,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:15,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:15,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:15,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:15,629 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 09:53:15,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:15,630 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 09:53:15,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:15,659 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:15,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:15,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:16,264 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 09:53:16,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:16,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 09:53:16,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 09:53:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 09:53:16,286 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:16,286 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-10-04 09:53:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:16,787 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 09:53:16,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:53:16,788 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-10-04 09:53:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:16,789 INFO L225 Difference]: With dead ends: 20 [2018-10-04 09:53:16,789 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 09:53:16,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 17 [2018-10-04 09:53:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 09:53:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 09:53:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 09:53:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 09:53:16,795 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 09:53:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:16,795 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 09:53:16,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 09:53:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 09:53:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:53:16,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:16,797 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-04 09:53:16,797 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:16,797 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-04 09:53:16,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:16,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:16,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:16,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:16,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:17,432 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 09:53:17,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:17,432 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 09:53:17,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:17,456 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:17,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:17,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:18,065 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 09:53:18,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:18,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-04 09:53:18,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 09:53:18,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 09:53:18,087 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:18,087 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-10-04 09:53:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:18,579 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 09:53:18,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 09:53:18,580 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-10-04 09:53:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:18,580 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:53:18,581 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 09:53:18,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 18 [2018-10-04 09:53:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 09:53:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 09:53:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:53:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 09:53:18,586 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 09:53:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:18,586 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 09:53:18,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 09:53:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 09:53:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:18,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:18,587 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-04 09:53:18,587 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:18,588 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:18,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-04 09:53:18,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:18,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:18,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:18,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:18,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:19,235 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 09:53:19,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:19,236 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 09:53:19,244 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:19,270 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 09:53:19,270 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:19,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:20,562 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 09:53:20,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:20,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 09:53:20,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 09:53:20,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 09:53:20,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:20,585 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-10-04 09:53:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:21,375 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 09:53:21,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 09:53:21,375 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-10-04 09:53:21,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:21,376 INFO L225 Difference]: With dead ends: 22 [2018-10-04 09:53:21,376 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:53:21,376 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 09:53:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:53:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 09:53:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 09:53:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 09:53:21,380 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 09:53:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:21,381 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 09:53:21,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 09:53:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 09:53:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:53:21,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:21,381 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-04 09:53:21,382 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:21,382 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:21,382 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-04 09:53:21,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:21,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:21,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:22,202 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:53:22,204 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 09:53:22,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:22,204 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 09:53:22,214 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:22,239 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 09:53:22,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:22,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:23,284 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 09:53:23,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:23,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-04 09:53:23,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 09:53:23,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 09:53:23,306 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:23,306 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-10-04 09:53:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:24,233 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 09:53:24,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:53:24,233 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-10-04 09:53:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:24,234 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:53:24,235 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 09:53:24,235 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 09:53:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 09:53:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 09:53:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:53:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 09:53:24,240 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 09:53:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:24,240 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 09:53:24,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 09:53:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 09:53:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 09:53:24,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:24,241 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-04 09:53:24,241 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:24,241 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:24,241 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-04 09:53:24,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:24,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:24,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:24,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:24,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:25,032 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 14 [2018-10-04 09:53:25,082 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 09:53:25,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:25,082 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 09:53:25,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:25,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:26,106 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 09:53:26,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:26,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 09:53:26,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 09:53:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 09:53:26,136 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:26,136 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-10-04 09:53:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:27,131 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 09:53:27,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:53:27,132 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-10-04 09:53:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:27,133 INFO L225 Difference]: With dead ends: 24 [2018-10-04 09:53:27,133 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:53:27,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime 27 [2018-10-04 09:53:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:53:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 09:53:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 09:53:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 09:53:27,142 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 09:53:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:27,143 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 09:53:27,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 09:53:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 09:53:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 09:53:27,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:27,145 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-04 09:53:27,145 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:27,145 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-04 09:53:27,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:27,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:27,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:28,052 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 09:53:28,169 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 09:53:28,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:28,169 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 09:53:28,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:28,198 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:28,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:28,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:28,874 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 32 new depth: 19 [2018-10-04 09:53:29,237 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 09:53:29,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:29,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-04 09:53:29,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 09:53:29,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 09:53:29,260 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:29,260 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-10-04 09:53:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:30,184 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 09:53:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:53:30,184 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-10-04 09:53:30,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:30,185 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:53:30,185 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 09:53:30,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.5s impTime 19 [2018-10-04 09:53:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 09:53:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 09:53:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:53:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 09:53:30,190 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 09:53:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:30,190 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 09:53:30,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 09:53:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 09:53:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 09:53:30,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:30,191 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-04 09:53:30,192 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:30,192 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:30,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-04 09:53:30,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:30,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:30,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:30,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:30,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:31,125 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 09:53:31,319 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 09:53:31,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:31,320 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 09:53:31,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:31,357 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 09:53:31,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:31,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:32,493 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 32 new depth: 19 [2018-10-04 09:53:32,689 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 09:53:32,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:32,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-04 09:53:32,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 09:53:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 09:53:32,712 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:32,712 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-10-04 09:53:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:33,844 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 09:53:33,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:53:33,847 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-10-04 09:53:33,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:33,848 INFO L225 Difference]: With dead ends: 26 [2018-10-04 09:53:33,848 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:53:33,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.9s impTime 19 [2018-10-04 09:53:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:53:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 09:53:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 09:53:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 09:53:33,852 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 09:53:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:33,852 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 09:53:33,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 09:53:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 09:53:33,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 09:53:33,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:33,853 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-04 09:53:33,854 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:33,854 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:33,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-04 09:53:33,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:33,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:33,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:33,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:33,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:34,753 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 18 [2018-10-04 09:53:35,028 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 09:53:35,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:35,029 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 09:53:35,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:35,059 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:35,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:35,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:35,880 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 34 new depth: 20 [2018-10-04 09:53:36,441 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 09:53:36,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:36,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-04 09:53:36,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 09:53:36,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 09:53:36,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:36,463 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-10-04 09:53:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:37,709 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 09:53:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 09:53:37,709 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-10-04 09:53:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:37,710 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:53:37,710 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 09:53:37,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 2.0s impTime 20 [2018-10-04 09:53:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 09:53:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 09:53:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:53:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 09:53:37,717 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 09:53:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:37,717 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 09:53:37,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 09:53:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 09:53:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 09:53:37,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:37,718 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-04 09:53:37,719 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:37,719 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-04 09:53:37,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:37,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:37,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:37,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:37,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:38,619 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 11 [2018-10-04 09:53:38,977 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 09:53:38,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:38,978 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 09:53:38,986 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:39,026 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 09:53:39,027 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:39,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:40,683 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 27 new depth: 18 [2018-10-04 09:53:41,307 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 09:53:41,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:41,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-04 09:53:41,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 09:53:41,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 09:53:41,334 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:41,334 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-10-04 09:53:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:42,373 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 09:53:42,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 09:53:42,373 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-10-04 09:53:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:42,374 INFO L225 Difference]: With dead ends: 28 [2018-10-04 09:53:42,374 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:53:42,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 2.9s impTime 18 [2018-10-04 09:53:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:53:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 09:53:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 09:53:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 09:53:42,379 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 09:53:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:42,380 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 09:53:42,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 09:53:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 09:53:42,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:53:42,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:42,380 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-04 09:53:42,381 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:42,381 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-04 09:53:42,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:42,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:42,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:43,366 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 09:53:43,825 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 09:53:43,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:43,825 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 09:53:43,832 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:43,872 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 09:53:43,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:43,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:46,157 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 09:53:46,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:46,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-04 09:53:46,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 09:53:46,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 09:53:46,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:46,178 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-10-04 09:53:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:47,557 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 09:53:47,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 09:53:47,558 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-10-04 09:53:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:47,559 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:53:47,559 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 09:53:47,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 3.1s impTime 30 [2018-10-04 09:53:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 09:53:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 09:53:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:53:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 09:53:47,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 09:53:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:47,565 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 09:53:47,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 09:53:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 09:53:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 09:53:47,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:47,566 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-04 09:53:47,566 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:47,566 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-04 09:53:47,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:47,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:47,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:47,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:47,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:49,108 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 12 [2018-10-04 09:53:49,703 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 09:53:49,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:49,704 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 09:53:49,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:49,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:51,402 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 28 new depth: 18 [2018-10-04 09:53:52,152 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 09:53:52,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:52,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-04 09:53:52,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 09:53:52,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 09:53:52,175 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:52,175 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-10-04 09:53:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:53,700 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 09:53:53,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 09:53:53,700 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-10-04 09:53:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:53,701 INFO L225 Difference]: With dead ends: 30 [2018-10-04 09:53:53,701 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:53:53,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s Time 3.7s impTime 18 [2018-10-04 09:53:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:53:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 09:53:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 09:53:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 09:53:53,707 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 09:53:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:53,708 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 09:53:53,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 09:53:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 09:53:53,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:53:53,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:53,709 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-04 09:53:53,709 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:53,709 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:53,709 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-04 09:53:53,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:53,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:53,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:54,628 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 14 [2018-10-04 09:53:55,371 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 09:53:55,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:55,371 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 09:53:55,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:55,412 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:55,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:55,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:56,584 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 30 new depth: 22 [2018-10-04 09:53:57,746 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 09:53:57,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:57,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-04 09:53:57,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 09:53:57,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 09:53:57,769 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:57,769 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-10-04 09:53:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:59,545 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 09:53:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 09:53:59,545 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-10-04 09:53:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:59,546 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:53:59,546 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 09:53:59,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 3.2s impTime 22 [2018-10-04 09:53:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 09:53:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 09:53:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:53:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 09:53:59,551 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 09:53:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:59,551 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 09:53:59,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 09:53:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 09:53:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 09:53:59,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:59,552 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-04 09:53:59,552 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:59,552 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:59,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-04 09:53:59,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:59,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:59,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:01,114 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 15 [2018-10-04 09:54:02,118 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 09:54:02,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:02,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 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 09:54:02,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:54:02,172 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 09:54:02,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:02,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:03,214 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 31 new depth: 20 [2018-10-04 09:54:04,721 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 09:54:04,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:04,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-04 09:54:04,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 09:54:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 09:54:04,744 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:04,744 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-10-04 09:54:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:07,010 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 09:54:07,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:54:07,011 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-10-04 09:54:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:07,011 INFO L225 Difference]: With dead ends: 32 [2018-10-04 09:54:07,011 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:54:07,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s Time 4.1s impTime 20 [2018-10-04 09:54:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:54:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 09:54:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 09:54:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 09:54:07,018 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 09:54:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:07,018 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 09:54:07,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 09:54:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 09:54:07,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:54:07,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:07,019 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-04 09:54:07,019 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:07,019 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:07,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-04 09:54:07,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:07,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:07,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:07,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:07,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:07,975 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 17 [2018-10-04 09:54:08,897 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 09:54:08,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:08,898 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 09:54:08,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:54:08,942 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:54:08,942 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:08,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:10,031 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 33 new depth: 24 [2018-10-04 09:54:11,357 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 09:54:11,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:11,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-04 09:54:11,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 09:54:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 09:54:11,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:11,378 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-10-04 09:54:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:13,189 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 09:54:13,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 09:54:13,190 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-10-04 09:54:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:13,191 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:54:13,191 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 09:54:13,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.5s impTime 24 [2018-10-04 09:54:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 09:54:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 09:54:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 09:54:13,196 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 09:54:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:13,197 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 09:54:13,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 09:54:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 09:54:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 09:54:13,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:13,198 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-04 09:54:13,198 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:13,198 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-04 09:54:13,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:13,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:13,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:14,231 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:54:15,407 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 09:54:15,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:15,408 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 09:54:15,418 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:54:15,470 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 09:54:15,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:15,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:18,295 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 09:54:18,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:18,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-04 09:54:18,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 09:54:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 09:54:18,317 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:18,317 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-10-04 09:54:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:20,694 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 09:54:20,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 09:54:20,695 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-10-04 09:54:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:20,696 INFO L225 Difference]: With dead ends: 34 [2018-10-04 09:54:20,696 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:54:20,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s Time 4.4s impTime 31 [2018-10-04 09:54:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:54:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 09:54:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 09:54:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 09:54:20,703 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 09:54:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:20,703 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 09:54:20,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 09:54:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 09:54:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 09:54:20,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:20,704 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-04 09:54:20,704 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:20,704 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:20,704 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-04 09:54:20,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:20,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:20,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:20,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:20,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:21,701 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 18 [2018-10-04 09:54:23,011 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 09:54:23,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:23,011 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 09:54:23,020 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:54:23,084 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 09:54:23,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:23,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:25,379 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 34 new depth: 28 [2018-10-04 09:54:26,594 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 09:54:26,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:26,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-04 09:54:26,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 09:54:26,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 09:54:26,616 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:26,616 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-10-04 09:54:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:29,639 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 09:54:29,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 09:54:29,640 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-10-04 09:54:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:29,640 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:54:29,641 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 09:54:29,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s Time 5.0s impTime 28 [2018-10-04 09:54:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 09:54:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 09:54:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 09:54:29,645 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 09:54:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:29,646 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 09:54:29,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 09:54:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 09:54:29,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 09:54:29,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:29,646 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-04 09:54:29,646 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:29,647 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:29,647 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-04 09:54:29,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:29,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:29,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:29,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:29,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:30,867 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 18 [2018-10-04 09:54:32,307 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 09:54:32,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:32,309 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 09:54:32,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:32,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:34,764 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 34 new depth: 29 [2018-10-04 09:54:36,036 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 09:54:36,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:36,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-04 09:54:36,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 09:54:36,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 09:54:36,058 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:36,059 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-10-04 09:54:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:38,727 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 09:54:38,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 09:54:38,728 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-10-04 09:54:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:38,728 INFO L225 Difference]: With dead ends: 36 [2018-10-04 09:54:38,729 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:54:38,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s Time 5.3s impTime 29 [2018-10-04 09:54:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:54:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 09:54:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 09:54:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 09:54:38,734 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 09:54:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:38,735 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 09:54:38,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 09:54:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 09:54:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:54:38,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:38,735 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-04 09:54:38,736 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:38,736 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:38,736 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-04 09:54:38,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:38,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:38,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:40,041 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:54:41,696 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 09:54:41,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:41,697 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 09:54:41,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:54:41,750 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:54:41,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:41,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:45,231 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 09:54:45,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:45,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-04 09:54:45,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 09:54:45,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 09:54:45,253 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:45,253 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-10-04 09:54:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:47,956 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 09:54:47,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 09:54:47,957 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-10-04 09:54:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:47,957 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:54:47,957 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 09:54:47,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s Time 5.6s impTime 34 [2018-10-04 09:54:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 09:54:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 09:54:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 09:54:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 09:54:47,964 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 09:54:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:47,964 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 09:54:47,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 09:54:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 09:54:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 09:54:47,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:47,965 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-04 09:54:47,965 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:47,965 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-04 09:54:47,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:47,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:47,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:47,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:47,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:49,126 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 17 [2018-10-04 09:54:50,991 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 09:54:50,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:50,992 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 09:54:50,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:54:51,075 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 09:54:51,076 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:51,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:52,524 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 33 new depth: 26 [2018-10-04 09:54:55,172 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 09:54:55,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:55,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-04 09:54:55,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 09:54:55,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 09:54:55,193 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:55,193 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-10-04 09:54:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:58,739 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 09:54:58,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 09:54:58,740 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-10-04 09:54:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:58,740 INFO L225 Difference]: With dead ends: 38 [2018-10-04 09:54:58,740 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:54:58,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s Time 6.2s impTime 26 [2018-10-04 09:54:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:54:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 09:54:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 09:54:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 09:54:58,745 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 09:54:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:58,746 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 09:54:58,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 09:54:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 09:54:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:54:58,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:58,746 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-04 09:54:58,746 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:58,747 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:58,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-04 09:54:58,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:58,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:58,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:58,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:58,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:59,911 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 15 [2018-10-04 09:55:02,127 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 31 new depth: 31 [2018-10-04 09:55:02,131 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 09:55:02,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:02,131 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 09:55:02,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:55:02,188 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:55:02,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:02,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:07,004 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 49 new depth: 35 [2018-10-04 09:55:07,217 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 09:55:07,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:07,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-04 09:55:07,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 09:55:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 09:55:07,238 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:07,238 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-10-04 09:55:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:10,683 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 09:55:10,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 09:55:10,683 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-10-04 09:55:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:10,684 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:55:10,684 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 09:55:10,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s Time 6.8s impTime 35 [2018-10-04 09:55:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 09:55:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 09:55:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 09:55:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 09:55:10,689 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 09:55:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:10,689 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 09:55:10,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 09:55:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 09:55:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 09:55:10,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:10,690 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-04 09:55:10,690 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:10,690 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-04 09:55:10,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:10,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:10,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:11,918 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 14 [2018-10-04 09:55:14,237 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 30 new depth: 30 [2018-10-04 09:55:14,377 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 09:55:14,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:14,378 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 09:55:14,387 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:55:14,460 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 09:55:14,460 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:14,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:18,536 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 48 new depth: 29 [2018-10-04 09:55:18,945 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 09:55:18,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:18,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-04 09:55:18,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 09:55:18,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 09:55:18,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:18,966 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-10-04 09:55:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:22,588 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 09:55:22,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 09:55:22,589 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-10-04 09:55:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:22,589 INFO L225 Difference]: With dead ends: 40 [2018-10-04 09:55:22,590 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:55:22,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s Time 6.9s impTime 29 [2018-10-04 09:55:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:55:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 09:55:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 09:55:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 09:55:22,596 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 09:55:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:22,596 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 09:55:22,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 09:55:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 09:55:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 09:55:22,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:22,597 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-04 09:55:22,597 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:22,597 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-04 09:55:22,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:22,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:22,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:23,885 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 12 [2018-10-04 09:55:26,372 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 09:55:26,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:26,372 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 09:55:26,380 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:55:26,446 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 09:55:26,446 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:26,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:28,312 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 28 new depth: 28 [2018-10-04 09:55:31,343 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 46 new depth: 29 [2018-10-04 09:55:31,354 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 09:55:31,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:31,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-04 09:55:31,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 09:55:31,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 09:55:31,376 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:31,376 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-10-04 09:55:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:34,772 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 09:55:34,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 09:55:34,773 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-10-04 09:55:34,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:34,773 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:55:34,773 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 09:55:34,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s Time 7.3s impTime 29 [2018-10-04 09:55:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 09:55:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 09:55:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 09:55:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 09:55:34,778 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 09:55:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:34,779 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 09:55:34,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 09:55:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 09:55:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 09:55:34,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:34,779 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-04 09:55:34,780 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:34,780 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-04 09:55:34,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:34,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:34,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:34,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:34,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:36,091 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 09:55:38,770 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 09:55:38,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:38,770 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 09:55:38,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:55:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:38,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:42,297 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 35 new depth: 23 [2018-10-04 09:55:43,812 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 09:55:43,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:43,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-04 09:55:43,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 09:55:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 09:55:43,833 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:43,833 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. [2018-10-04 09:55:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:47,477 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 09:55:47,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 09:55:47,478 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 39 [2018-10-04 09:55:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:47,479 INFO L225 Difference]: With dead ends: 42 [2018-10-04 09:55:47,479 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:55:47,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s Time 7.9s impTime 23 [2018-10-04 09:55:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:55:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 09:55:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 09:55:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 09:55:47,483 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 09:55:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:47,483 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 09:55:47,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 09:55:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 09:55:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 09:55:47,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:47,484 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-04 09:55:47,484 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:47,484 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:47,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-04 09:55:47,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:47,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:47,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:47,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:55:47,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:48,787 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 11 [2018-10-04 09:55:51,160 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 27 new depth: 26 [2018-10-04 09:55:51,901 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 09:55:51,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:51,902 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 09:55:51,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:55:51,972 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:55:51,972 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:51,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:53,532 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 41 new depth: 28 [2018-10-04 09:55:57,349 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 09:55:57,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:57,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-04 09:55:57,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 09:55:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 09:55:57,370 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:57,370 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 79 states. [2018-10-04 09:56:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:56:01,334 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 09:56:01,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 09:56:01,335 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 40 [2018-10-04 09:56:01,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:56:01,336 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:56:01,336 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 09:56:01,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s Time 8.5s impTime 30 [2018-10-04 09:56:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 09:56:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 09:56:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 09:56:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 09:56:01,341 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 09:56:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:56:01,342 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 09:56:01,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 09:56:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 09:56:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:56:01,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:56:01,342 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-04 09:56:01,343 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:56:01,343 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:56:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-04 09:56:01,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:56:01,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:56:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:56:01,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:56:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:56:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:56:02,709 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 18 [2018-10-04 09:56:05,188 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 34 new depth: 26 [2018-10-04 09:56:06,127 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 09:56:06,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:56:06,128 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 09:56:06,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:56:06,235 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 09:56:06,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:56:06,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:56:08,322 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 41 new depth: 23 [2018-10-04 09:56:12,155 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 09:56:12,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:56:12,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-04 09:56:12,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 09:56:12,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 09:56:12,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:56:12,176 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 81 states. [2018-10-04 09:56:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:56:17,228 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 09:56:17,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 09:56:17,229 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 41 [2018-10-04 09:56:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:56:17,230 INFO L225 Difference]: With dead ends: 44 [2018-10-04 09:56:17,230 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:56:17,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s Time 9.3s impTime 29 [2018-10-04 09:56:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:56:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:56:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:56:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 09:56:17,234 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 09:56:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:56:17,235 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 09:56:17,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 09:56:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 09:56:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 09:56:17,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:56:17,235 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-04 09:56:17,235 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:56:17,235 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:56:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-04 09:56:17,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:56:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:56:17,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:56:17,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:56:17,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:56:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:56:18,686 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 09:56:21,974 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 32 new depth: 32 [2018-10-04 09:56:22,346 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 09:56:22,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:56:22,346 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 09:56:22,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:56:22,426 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:56:22,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:56:22,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:56:28,262 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 50 new depth: 30 [2018-10-04 09:56:29,010 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 09:56:29,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:56:29,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-04 09:56:29,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 09:56:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 09:56:29,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:56:29,032 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 83 states. [2018-10-04 09:56:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:56:34,819 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 09:56:34,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 09:56:34,820 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 42 [2018-10-04 09:56:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:56:34,821 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:56:34,821 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 09:56:34,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s Time 10.0s impTime 30 [2018-10-04 09:56:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 09:56:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 09:56:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 09:56:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 09:56:34,827 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 09:56:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:56:34,827 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 09:56:34,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 09:56:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 09:56:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 09:56:34,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:56:34,828 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-04 09:56:34,828 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:56:34,828 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:56:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-04 09:56:34,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:56:34,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:56:34,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:56:34,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:56:34,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:56:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:56:36,300 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 16 [2018-10-04 09:56:38,819 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 32 new depth: 28 [2018-10-04 09:56:40,214 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 09:56:40,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:56:40,215 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 09:56:40,223 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:56:40,383 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 09:56:40,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:56:40,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:56:44,072 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 46 new depth: 28 [2018-10-04 09:56:47,997 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 09:56:48,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:56:48,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-04 09:56:48,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 09:56:48,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 09:56:48,018 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:56:48,018 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 85 states. [2018-10-04 09:56:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:56:54,707 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 09:56:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 09:56:54,708 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 43 [2018-10-04 09:56:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:56:54,709 INFO L225 Difference]: With dead ends: 46 [2018-10-04 09:56:54,709 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:56:54,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s Time 11.3s impTime 28 [2018-10-04 09:56:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:56:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 09:56:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 09:56:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 09:56:54,713 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 09:56:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:56:54,714 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 09:56:54,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 09:56:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 09:56:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:56:54,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:56:54,714 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-04 09:56:54,714 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:56:54,714 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:56:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-04 09:56:54,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:56:54,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:56:54,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:56:54,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:56:54,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:56:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:56:56,918 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 14 [2018-10-04 09:57:00,956 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 30 new depth: 30 [2018-10-04 09:57:01,139 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 09:57:01,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:57:01,139 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 09:57:01,148 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:57:01,283 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 09:57:01,284 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:57:01,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:57:07,859 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 48 new depth: 33 [2018-10-04 09:57:08,398 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 09:57:08,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:57:08,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-04 09:57:08,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 09:57:08,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 09:57:08,419 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:57:08,419 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 87 states. [2018-10-04 09:57:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:57:13,745 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 09:57:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 09:57:13,746 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 44 [2018-10-04 09:57:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:57:13,746 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:57:13,746 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 09:57:13,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s Time 11.4s impTime 33 [2018-10-04 09:57:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 09:57:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 09:57:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 09:57:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 09:57:13,752 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 09:57:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:57:13,752 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 09:57:13,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 09:57:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 09:57:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 09:57:13,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:57:13,753 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-04 09:57:13,753 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:57:13,753 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:57:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-04 09:57:13,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:57:13,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:57:13,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:57:13,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:57:13,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:57:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:57:15,241 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 09:57:17,836 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 35 new depth: 22 [2018-10-04 09:57:19,742 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 09:57:19,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:57:19,743 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 09:57:19,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:57:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:57:19,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:57:23,331 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 40 new depth: 23 Received shutdown request... [2018-10-04 09:57:27,233 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-04 09:57:27,434 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:57:27,435 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 09:57:27,440 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 09:57:27,440 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:57:27 BoogieIcfgContainer [2018-10-04 09:57:27,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:57:27,441 INFO L168 Benchmark]: Toolchain (without parser) took 267193.30 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.8 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 82.3 MB). Peak memory consumption was 219.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:57:27,443 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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 09:57:27,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.65 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 09:57:27,444 INFO L168 Benchmark]: Boogie Preprocessor took 25.04 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 09:57:27,445 INFO L168 Benchmark]: RCFGBuilder took 277.06 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 09:57:27,446 INFO L168 Benchmark]: TraceAbstraction took 266841.22 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 61.1 MB). Peak memory consumption was 198.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:57:27,449 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.23 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 45.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.04 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 277.06 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 266841.22 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 61.1 MB). Peak memory consumption was 198.0 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 analyzing trace of length 46 with TraceHistMax 43, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 4 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 266.7s OverallTime, 44 OverallIterations, 43 TraceHistogramMax, 75.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 87 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 32606 SolverSat, 903 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1891 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1849 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 161.2s 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, 173.0s InterpolantComputationTime, 1976 NumberOfCodeBlocks, 1976 NumberOfCodeBlocksAsserted, 337 NumberOfCheckSat, 1891 ConstructedInterpolants, 0 QuantifiedInterpolants, 531653 SizeOfPredicates, 42 NumberOfNonLiveVariables, 3906 ConjunctsInSsa, 1932 ConjunctsInUnsatCore, 85 InterpolantComputations, 1 PerfectInterpolantSequences, 0/26488 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_09-57-27-462.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_09-57-27-462.csv Completed graceful shutdown