java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested1.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:53:56,204 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:53:56,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:53:56,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:53:56,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:53:56,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:53:56,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:53:56,222 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:53:56,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:53:56,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:53:56,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:53:56,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:53:56,226 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:53:56,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:53:56,228 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:53:56,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:53:56,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:53:56,233 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:53:56,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:53:56,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:53:56,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:53:56,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:53:56,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:53:56,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:53:56,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:53:56,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:53:56,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:53:56,258 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:53:56,259 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:53:56,260 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:53:56,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:53:56,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:53:56,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:53:56,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:53:56,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:53:56,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:53:56,268 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:53:56,294 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:53:56,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:53:56,296 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:53:56,296 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:53:56,296 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:53:56,298 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:53:56,299 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:53:56,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:53:56,299 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:53:56,299 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:53:56,299 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:53:56,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:53:56,300 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:53:56,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:53:56,300 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:53:56,300 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:53:56,301 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:53:56,301 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:53:56,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:53:56,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:53:56,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:53:56,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:53:56,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:53:56,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:53:56,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:53:56,303 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:53:56,303 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:53:56,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:53:56,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:53:56,304 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:53:56,305 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:53:56,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:53:56,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:53:56,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:53:56,385 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:53:56,385 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:53:56,386 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested1.i_4.bpl [2018-10-01 00:53:56,386 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested1.i_4.bpl' [2018-10-01 00:53:56,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:53:56,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:53:56,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:53:56,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:53:56,440 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:53:56,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/1) ... [2018-10-01 00:53:56,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/1) ... [2018-10-01 00:53:56,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:53:56,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:53:56,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:53:56,480 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:53:56,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/1) ... [2018-10-01 00:53:56,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/1) ... [2018-10-01 00:53:56,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/1) ... [2018-10-01 00:53:56,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/1) ... [2018-10-01 00:53:56,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/1) ... [2018-10-01 00:53:56,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/1) ... [2018-10-01 00:53:56,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/1) ... [2018-10-01 00:53:56,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:53:56,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:53:56,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:53:56,502 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:53:56,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:53:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:53:56,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:53:56,829 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:53:56,829 INFO L202 PluginConnector]: Adding new model nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:53:56 BoogieIcfgContainer [2018-10-01 00:53:56,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:53:56,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:53:56,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:53:56,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:53:56,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:56" (1/2) ... [2018-10-01 00:53:56,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7cc4f4 and model type nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:53:56, skipping insertion in model container [2018-10-01 00:53:56,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:53:56" (2/2) ... [2018-10-01 00:53:56,837 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bpl [2018-10-01 00:53:56,847 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:53:56,854 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:53:56,899 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:53:56,900 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:53:56,900 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:53:56,900 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:53:56,900 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:53:56,900 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:53:56,901 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:53:56,901 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:53:56,901 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:53:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-01 00:53:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:53:56,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:56,923 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:53:56,924 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:56,937 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:56,937 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-01 00:53:56,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:56,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:56,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:56,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:56,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:57,103 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:53:57,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:53:57,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:53:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:53:57,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:57,123 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-01 00:53:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:57,317 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-10-01 00:53:57,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:53:57,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-01 00:53:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:57,330 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:53:57,330 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:53:57,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:53:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:53:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-10-01 00:53:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:53:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-10-01 00:53:57,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-10-01 00:53:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:57,364 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-10-01 00:53:57,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:53:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-01 00:53:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:53:57,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:57,365 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-01 00:53:57,366 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:57,366 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash 209100445, now seen corresponding path program 1 times [2018-10-01 00:53:57,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:57,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:57,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:57,417 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:53:57,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:53:57,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:53:57,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:53:57,419 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:57,419 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2018-10-01 00:53:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:57,489 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-10-01 00:53:57,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:53:57,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-01 00:53:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:57,490 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:53:57,490 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:53:57,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:53:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:53:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:53:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:53:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-10-01 00:53:57,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-10-01 00:53:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:57,495 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-01 00:53:57,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:53:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-01 00:53:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:53:57,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:57,496 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-01 00:53:57,497 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:57,497 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash -850198025, now seen corresponding path program 1 times [2018-10-01 00:53:57,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:57,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:57,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:57,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:57,603 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:57,603 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:57,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:57,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:57,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:57,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-01 00:53:57,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:53:57,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:53:57,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:57,790 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2018-10-01 00:53:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:58,503 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-10-01 00:53:58,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:53:58,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-01 00:53:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:58,505 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:53:58,505 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:53:58,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:53:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:53:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-10-01 00:53:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:53:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-01 00:53:58,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 10 [2018-10-01 00:53:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:58,514 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-01 00:53:58,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:53:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-01 00:53:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:53:58,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:58,516 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 2, 1, 1, 1] [2018-10-01 00:53:58,516 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:58,516 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:58,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1881088987, now seen corresponding path program 2 times [2018-10-01 00:53:58,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:58,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:58,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:58,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-01 00:53:58,644 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:58,644 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:58,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:53:58,700 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:53:58,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:58,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-01 00:53:59,261 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:59,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-01 00:53:59,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:53:59,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:53:59,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:59,263 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 8 states. [2018-10-01 00:54:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:00,029 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-10-01 00:54:00,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:54:00,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-10-01 00:54:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:00,032 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:54:00,032 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:54:00,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:54:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:54:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-10-01 00:54:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:54:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-10-01 00:54:00,043 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2018-10-01 00:54:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:00,043 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-10-01 00:54:00,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:54:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-10-01 00:54:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:54:00,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:00,045 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 4, 3, 3, 1, 1, 1] [2018-10-01 00:54:00,045 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:00,045 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:00,046 INFO L82 PathProgramCache]: Analyzing trace with hash 501354739, now seen corresponding path program 3 times [2018-10-01 00:54:00,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:00,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:00,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:00,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:00,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-01 00:54:00,148 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:00,148 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:00,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:54:00,174 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-01 00:54:00,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:00,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-01 00:54:00,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:00,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:54:00,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:54:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:54:00,259 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:00,259 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2018-10-01 00:54:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:00,435 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-10-01 00:54:00,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:54:00,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-10-01 00:54:00,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:00,438 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:54:00,438 INFO L226 Difference]: Without dead ends: 41 [2018-10-01 00:54:00,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:54:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-01 00:54:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-01 00:54:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:54:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-01 00:54:00,450 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 34 [2018-10-01 00:54:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:00,451 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-01 00:54:00,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:54:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-01 00:54:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 00:54:00,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:00,452 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 4, 3, 3, 1, 1, 1] [2018-10-01 00:54:00,452 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:00,453 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:00,453 INFO L82 PathProgramCache]: Analyzing trace with hash 209827969, now seen corresponding path program 4 times [2018-10-01 00:54:00,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:00,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:00,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-01 00:54:00,681 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:00,681 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:00,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:54:00,713 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:54:00,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:00,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-01 00:54:00,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:00,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 9 [2018-10-01 00:54:00,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:54:00,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:54:00,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:00,917 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 10 states. [2018-10-01 00:54:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:01,643 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-10-01 00:54:01,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:54:01,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-10-01 00:54:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:01,645 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:54:01,645 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 00:54:01,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:54:01,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 00:54:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-10-01 00:54:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 00:54:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-10-01 00:54:01,659 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 40 [2018-10-01 00:54:01,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:01,660 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-10-01 00:54:01,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:54:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-10-01 00:54:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:54:01,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:01,662 INFO L375 BasicCegarLoop]: trace histogram [20, 16, 5, 4, 4, 1, 1, 1] [2018-10-01 00:54:01,662 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:01,662 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:01,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1874565441, now seen corresponding path program 5 times [2018-10-01 00:54:01,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:01,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:01,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-01 00:54:01,892 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:01,892 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:01,903 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:54:01,919 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:54:01,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:01,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 262 proven. 20 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-01 00:54:02,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:02,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-01 00:54:02,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:54:02,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:54:02,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:02,041 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 12 states. [2018-10-01 00:54:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:06,007 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2018-10-01 00:54:06,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:54:06,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-10-01 00:54:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:06,008 INFO L225 Difference]: With dead ends: 127 [2018-10-01 00:54:06,008 INFO L226 Difference]: Without dead ends: 87 [2018-10-01 00:54:06,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:54:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-01 00:54:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2018-10-01 00:54:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 00:54:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-10-01 00:54:06,025 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 52 [2018-10-01 00:54:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:06,025 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-10-01 00:54:06,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:54:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-10-01 00:54:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-01 00:54:06,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:06,028 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 6, 5, 5, 1, 1, 1] [2018-10-01 00:54:06,028 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:06,028 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1734028097, now seen corresponding path program 6 times [2018-10-01 00:54:06,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:06,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:06,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 750 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-10-01 00:54:06,439 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:06,439 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-01 00:54:06,449 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:54:06,569 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-10-01 00:54:06,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:06,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 520 proven. 30 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-01 00:54:06,703 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:06,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-01 00:54:06,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:54:06,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:54:06,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:06,704 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 14 states. [2018-10-01 00:54:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:10,582 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2018-10-01 00:54:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 00:54:10,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-10-01 00:54:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:10,584 INFO L225 Difference]: With dead ends: 175 [2018-10-01 00:54:10,584 INFO L226 Difference]: Without dead ends: 115 [2018-10-01 00:54:10,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:54:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-01 00:54:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-10-01 00:54:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-01 00:54:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-10-01 00:54:10,603 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 74 [2018-10-01 00:54:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:10,604 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-10-01 00:54:10,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:54:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-10-01 00:54:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-01 00:54:10,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:10,606 INFO L375 BasicCegarLoop]: trace histogram [42, 36, 7, 6, 6, 1, 1, 1] [2018-10-01 00:54:10,606 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:10,606 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:10,607 INFO L82 PathProgramCache]: Analyzing trace with hash 883432563, now seen corresponding path program 7 times [2018-10-01 00:54:10,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:10,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:10,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:10,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:10,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-10-01 00:54:10,878 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:10,878 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-01 00:54:10,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:10,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-01 00:54:11,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:11,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 14 [2018-10-01 00:54:11,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:54:11,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:54:11,933 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:11,933 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 15 states. [2018-10-01 00:54:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:13,149 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-10-01 00:54:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:54:13,149 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2018-10-01 00:54:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:13,151 INFO L225 Difference]: With dead ends: 133 [2018-10-01 00:54:13,151 INFO L226 Difference]: Without dead ends: 131 [2018-10-01 00:54:13,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:54:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-01 00:54:13,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 117. [2018-10-01 00:54:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-01 00:54:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-10-01 00:54:13,174 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 100 [2018-10-01 00:54:13,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:13,175 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-10-01 00:54:13,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:54:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-10-01 00:54:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-01 00:54:13,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:13,177 INFO L375 BasicCegarLoop]: trace histogram [49, 42, 8, 7, 7, 1, 1, 1] [2018-10-01 00:54:13,177 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:13,177 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:13,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1346298395, now seen corresponding path program 8 times [2018-10-01 00:54:13,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:13,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:13,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:13,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:13,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 0 proven. 2114 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-10-01 00:54:13,449 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:13,449 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-01 00:54:13,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:54:13,524 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:54:13,525 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:13,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 0 proven. 2114 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-10-01 00:54:13,780 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:13,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:54:13,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:54:13,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:54:13,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:13,781 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 10 states. [2018-10-01 00:54:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:14,475 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-10-01 00:54:14,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:54:14,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-10-01 00:54:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:14,477 INFO L225 Difference]: With dead ends: 149 [2018-10-01 00:54:14,477 INFO L226 Difference]: Without dead ends: 147 [2018-10-01 00:54:14,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:54:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-01 00:54:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2018-10-01 00:54:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-01 00:54:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-10-01 00:54:14,503 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 116 [2018-10-01 00:54:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:14,503 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-10-01 00:54:14,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:54:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-10-01 00:54:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-01 00:54:14,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:14,506 INFO L375 BasicCegarLoop]: trace histogram [56, 48, 9, 8, 8, 1, 1, 1] [2018-10-01 00:54:14,506 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:14,506 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1851587415, now seen corresponding path program 9 times [2018-10-01 00:54:14,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:14,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:14,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:14,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:14,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 0 proven. 2816 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-10-01 00:54:14,724 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:14,725 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-01 00:54:14,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:54:14,821 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-01 00:54:14,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:14,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 702 proven. 42 refuted. 0 times theorem prover too weak. 2408 trivial. 0 not checked. [2018-10-01 00:54:15,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:15,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-10-01 00:54:15,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:54:15,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:54:15,056 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:15,056 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 18 states. [2018-10-01 00:54:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:23,249 INFO L93 Difference]: Finished difference Result 299 states and 327 transitions. [2018-10-01 00:54:23,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 00:54:23,249 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 132 [2018-10-01 00:54:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:23,250 INFO L225 Difference]: With dead ends: 299 [2018-10-01 00:54:23,250 INFO L226 Difference]: Without dead ends: 183 [2018-10-01 00:54:23,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time [2018-10-01 00:54:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-01 00:54:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2018-10-01 00:54:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-01 00:54:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2018-10-01 00:54:23,275 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 132 [2018-10-01 00:54:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:23,275 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2018-10-01 00:54:23,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:54:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2018-10-01 00:54:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-01 00:54:23,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:23,278 INFO L375 BasicCegarLoop]: trace histogram [72, 63, 10, 9, 9, 1, 1, 1] [2018-10-01 00:54:23,279 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:23,279 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:23,279 INFO L82 PathProgramCache]: Analyzing trace with hash -132347917, now seen corresponding path program 10 times [2018-10-01 00:54:23,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:23,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:23,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:23,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:23,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 0 proven. 4698 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2018-10-01 00:54:23,612 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:23,612 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-01 00:54:23,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:54:23,675 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:54:23,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:23,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 1952 proven. 56 refuted. 0 times theorem prover too weak. 3194 trivial. 0 not checked. [2018-10-01 00:54:23,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:23,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-01 00:54:23,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:54:23,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:54:23,952 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:23,952 INFO L87 Difference]: Start difference. First operand 167 states and 176 transitions. Second operand 20 states. [2018-10-01 00:54:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:35,200 INFO L93 Difference]: Finished difference Result 371 states and 402 transitions. [2018-10-01 00:54:35,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-01 00:54:35,203 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 166 [2018-10-01 00:54:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:35,204 INFO L225 Difference]: With dead ends: 371 [2018-10-01 00:54:35,204 INFO L226 Difference]: Without dead ends: 223 [2018-10-01 00:54:35,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s Time [2018-10-01 00:54:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-01 00:54:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 205. [2018-10-01 00:54:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-01 00:54:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 215 transitions. [2018-10-01 00:54:35,232 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 215 transitions. Word has length 166 [2018-10-01 00:54:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:35,233 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 215 transitions. [2018-10-01 00:54:35,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:54:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 215 transitions. [2018-10-01 00:54:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-01 00:54:35,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:35,236 INFO L375 BasicCegarLoop]: trace histogram [90, 80, 11, 10, 10, 1, 1, 1] [2018-10-01 00:54:35,236 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:35,236 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1568317117, now seen corresponding path program 11 times [2018-10-01 00:54:35,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:35,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:35,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:35,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:35,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8120 backedges. 0 proven. 7400 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2018-10-01 00:54:35,648 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:35,648 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-01 00:54:35,656 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:54:35,877 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-01 00:54:35,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:35,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8120 backedges. 3774 proven. 72 refuted. 0 times theorem prover too weak. 4274 trivial. 0 not checked. [2018-10-01 00:54:36,186 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:36,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-10-01 00:54:36,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:54:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:54:36,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:36,187 INFO L87 Difference]: Start difference. First operand 205 states and 215 transitions. Second operand 22 states. [2018-10-01 00:54:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:50,572 INFO L93 Difference]: Finished difference Result 451 states and 485 transitions. [2018-10-01 00:54:50,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-01 00:54:50,572 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 204 [2018-10-01 00:54:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:50,574 INFO L225 Difference]: With dead ends: 451 [2018-10-01 00:54:50,574 INFO L226 Difference]: Without dead ends: 267 [2018-10-01 00:54:50,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s Time [2018-10-01 00:54:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-01 00:54:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 247. [2018-10-01 00:54:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-01 00:54:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 258 transitions. [2018-10-01 00:54:50,602 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 258 transitions. Word has length 204 [2018-10-01 00:54:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:50,602 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 258 transitions. [2018-10-01 00:54:50,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:54:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 258 transitions. [2018-10-01 00:54:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-01 00:54:50,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:50,606 INFO L375 BasicCegarLoop]: trace histogram [110, 99, 12, 11, 11, 1, 1, 1] [2018-10-01 00:54:50,606 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:50,606 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash 915329223, now seen corresponding path program 12 times [2018-10-01 00:54:50,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:50,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:50,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:50,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12122 backedges. 0 proven. 11132 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-01 00:54:51,551 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:51,552 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-01 00:54:51,559 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:54:56,473 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-10-01 00:54:56,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:56,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12122 backedges. 2022 proven. 90 refuted. 0 times theorem prover too weak. 10010 trivial. 0 not checked. [2018-10-01 00:54:56,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:56,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-10-01 00:54:56,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:54:56,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:54:56,784 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:56,784 INFO L87 Difference]: Start difference. First operand 247 states and 258 transitions. Second operand 24 states. [2018-10-01 00:55:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:16,697 INFO L93 Difference]: Finished difference Result 539 states and 576 transitions. [2018-10-01 00:55:16,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-01 00:55:16,697 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 246 [2018-10-01 00:55:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:16,699 INFO L225 Difference]: With dead ends: 539 [2018-10-01 00:55:16,699 INFO L226 Difference]: Without dead ends: 315 [2018-10-01 00:55:16,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s Time [2018-10-01 00:55:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-01 00:55:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 293. [2018-10-01 00:55:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-01 00:55:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 305 transitions. [2018-10-01 00:55:16,742 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 305 transitions. Word has length 246 [2018-10-01 00:55:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:16,742 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 305 transitions. [2018-10-01 00:55:16,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:55:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 305 transitions. [2018-10-01 00:55:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-01 00:55:16,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:16,745 INFO L375 BasicCegarLoop]: trace histogram [132, 120, 13, 12, 12, 1, 1, 1] [2018-10-01 00:55:16,746 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:16,746 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash 154612223, now seen corresponding path program 13 times [2018-10-01 00:55:16,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:16,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:16,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:55:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17448 backedges. 0 proven. 16128 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-10-01 00:55:17,244 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:55:17,244 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-01 00:55:17,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:17,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:55:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 17448 backedges. 0 proven. 16128 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-10-01 00:55:18,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:55:18,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:55:18,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:55:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:55:18,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:18,061 INFO L87 Difference]: Start difference. First operand 293 states and 305 transitions. Second operand 15 states. [2018-10-01 00:55:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:19,383 INFO L93 Difference]: Finished difference Result 341 states and 355 transitions. [2018-10-01 00:55:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:55:19,383 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 292 [2018-10-01 00:55:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:19,385 INFO L225 Difference]: With dead ends: 341 [2018-10-01 00:55:19,385 INFO L226 Difference]: Without dead ends: 339 [2018-10-01 00:55:19,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:55:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-01 00:55:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 317. [2018-10-01 00:55:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-01 00:55:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 330 transitions. [2018-10-01 00:55:19,428 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 330 transitions. Word has length 292 [2018-10-01 00:55:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:19,428 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 330 transitions. [2018-10-01 00:55:19,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:55:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 330 transitions. [2018-10-01 00:55:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-01 00:55:19,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:19,431 INFO L375 BasicCegarLoop]: trace histogram [143, 130, 14, 13, 13, 1, 1, 1] [2018-10-01 00:55:19,431 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:19,431 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:19,431 INFO L82 PathProgramCache]: Analyzing trace with hash -114885159, now seen corresponding path program 14 times [2018-10-01 00:55:19,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:19,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:19,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:19,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:19,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20488 backedges. 0 proven. 19058 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-10-01 00:55:20,280 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:55:20,280 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-01 00:55:20,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:55:20,399 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:55:20,399 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:55:20,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:55:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 20488 backedges. 0 proven. 19058 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-10-01 00:55:21,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:55:21,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:55:21,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:55:21,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:55:21,278 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:21,278 INFO L87 Difference]: Start difference. First operand 317 states and 330 transitions. Second operand 16 states. [2018-10-01 00:55:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:22,828 INFO L93 Difference]: Finished difference Result 365 states and 380 transitions. [2018-10-01 00:55:22,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:55:22,828 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 316 [2018-10-01 00:55:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:22,830 INFO L225 Difference]: With dead ends: 365 [2018-10-01 00:55:22,831 INFO L226 Difference]: Without dead ends: 363 [2018-10-01 00:55:22,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:55:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-01 00:55:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 341. [2018-10-01 00:55:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-01 00:55:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 355 transitions. [2018-10-01 00:55:22,881 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 355 transitions. Word has length 316 [2018-10-01 00:55:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:22,881 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 355 transitions. [2018-10-01 00:55:22,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:55:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 355 transitions. [2018-10-01 00:55:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-01 00:55:22,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:22,884 INFO L375 BasicCegarLoop]: trace histogram [154, 140, 15, 14, 14, 1, 1, 1] [2018-10-01 00:55:22,884 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:22,884 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:22,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1438164045, now seen corresponding path program 15 times [2018-10-01 00:55:22,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:22,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:22,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:22,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:55:22,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 23772 backedges. 0 proven. 22232 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-10-01 00:55:23,668 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:55:23,669 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-01 00:55:23,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:05:07,170 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-10-01 01:05:07,171 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:05:07,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:05:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 23772 backedges. 0 proven. 22232 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-10-01 01:05:08,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:05:08,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 01:05:08,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 01:05:08,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 01:05:08,054 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:05:08,054 INFO L87 Difference]: Start difference. First operand 341 states and 355 transitions. Second operand 17 states. [2018-10-01 01:05:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:05:11,018 INFO L93 Difference]: Finished difference Result 389 states and 405 transitions. [2018-10-01 01:05:11,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 01:05:11,018 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 340 [2018-10-01 01:05:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:05:11,020 INFO L225 Difference]: With dead ends: 389 [2018-10-01 01:05:11,020 INFO L226 Difference]: Without dead ends: 387 [2018-10-01 01:05:11,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 01:05:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-01 01:05:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 365. [2018-10-01 01:05:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-01 01:05:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 380 transitions. [2018-10-01 01:05:11,095 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 380 transitions. Word has length 340 [2018-10-01 01:05:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:05:11,096 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 380 transitions. [2018-10-01 01:05:11,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 01:05:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 380 transitions. [2018-10-01 01:05:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-10-01 01:05:11,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:05:11,099 INFO L375 BasicCegarLoop]: trace histogram [165, 150, 16, 15, 15, 1, 1, 1] [2018-10-01 01:05:11,099 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:05:11,099 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:05:11,099 INFO L82 PathProgramCache]: Analyzing trace with hash 411192205, now seen corresponding path program 16 times [2018-10-01 01:05:11,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:05:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:05:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:05:11,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:05:11,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:05:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:05:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 27300 backedges. 0 proven. 25650 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-10-01 01:05:11,727 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:05:11,727 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-01 01:05:11,735 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:05:11,848 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:05:11,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:05:11,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:05:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 27300 backedges. 0 proven. 25650 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-10-01 01:05:12,746 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:05:12,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 01:05:12,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 01:05:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 01:05:12,748 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:05:12,748 INFO L87 Difference]: Start difference. First operand 365 states and 380 transitions. Second operand 18 states. [2018-10-01 01:05:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:05:14,662 INFO L93 Difference]: Finished difference Result 413 states and 430 transitions. [2018-10-01 01:05:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 01:05:14,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 364 [2018-10-01 01:05:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:05:14,664 INFO L225 Difference]: With dead ends: 413 [2018-10-01 01:05:14,664 INFO L226 Difference]: Without dead ends: 411 [2018-10-01 01:05:14,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 01:05:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-01 01:05:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 389. [2018-10-01 01:05:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-01 01:05:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 405 transitions. [2018-10-01 01:05:14,747 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 405 transitions. Word has length 364 [2018-10-01 01:05:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:05:14,748 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 405 transitions. [2018-10-01 01:05:14,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 01:05:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 405 transitions. [2018-10-01 01:05:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-01 01:05:14,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:05:14,750 INFO L375 BasicCegarLoop]: trace histogram [176, 160, 17, 16, 16, 1, 1, 1] [2018-10-01 01:05:14,751 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:05:14,751 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:05:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1581134489, now seen corresponding path program 17 times [2018-10-01 01:05:14,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:05:14,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:05:14,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:05:14,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:05:14,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:05:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:05:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 31072 backedges. 0 proven. 29312 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-10-01 01:05:16,294 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:05:16,294 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-01 01:05:16,306 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown