java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:34:21,836 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:34:21,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:34:21,854 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:34:21,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:34:21,855 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:34:21,857 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:34:21,859 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:34:21,862 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:34:21,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:34:21,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:34:21,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:34:21,869 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:34:21,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:34:21,876 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:34:21,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:34:21,880 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:34:21,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:34:21,887 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:34:21,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:34:21,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:34:21,893 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:34:21,896 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:34:21,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:34:21,897 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:34:21,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:34:21,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:34:21,904 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:34:21,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:34:21,906 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:34:21,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:34:21,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:34:21,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:34:21,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:34:21,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:34:21,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:34:21,910 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:34:21,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:34:21,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:34:21,926 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:34:21,926 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:34:21,927 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:34:21,927 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:34:21,927 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:34:21,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:34:21,928 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:34:21,928 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:34:21,928 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:34:21,928 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:34:21,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:34:21,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:34:21,929 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:34:21,929 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:34:21,929 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:34:21,929 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:34:21,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:34:21,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:34:21,930 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:34:21,930 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:34:21,930 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:34:21,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:34:21,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:34:21,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:34:21,931 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:34:21,931 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:34:21,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:34:21,932 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:34:21,932 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:34:21,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:34:22,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:34:22,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:34:22,021 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:34:22,022 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:34:22,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl [2018-10-04 14:34:22,025 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl' [2018-10-04 14:34:22,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:34:22,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:34:22,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:34:22,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:34:22,085 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:34:22,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/1) ... [2018-10-04 14:34:22,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/1) ... [2018-10-04 14:34:22,126 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:34:22,127 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:34:22,127 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:34:22,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:34:22,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:34:22,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:34:22,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:34:22,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/1) ... [2018-10-04 14:34:22,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/1) ... [2018-10-04 14:34:22,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/1) ... [2018-10-04 14:34:22,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/1) ... [2018-10-04 14:34:22,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/1) ... [2018-10-04 14:34:22,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/1) ... [2018-10-04 14:34:22,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/1) ... [2018-10-04 14:34:22,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:34:22,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:34:22,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:34:22,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:34:22,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:34:22,236 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 14:34:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 14:34:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 14:34:22,446 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:34:22,447 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:34:22 BoogieIcfgContainer [2018-10-04 14:34:22,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:34:22,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:34:22,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:34:22,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:34:22,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:34:22" (1/2) ... [2018-10-04 14:34:22,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5243dbf9 and model type HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:34:22, skipping insertion in model container [2018-10-04 14:34:22,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:34:22" (2/2) ... [2018-10-04 14:34:22,457 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenEquality-Safe.bpl [2018-10-04 14:34:22,471 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:34:22,481 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:34:22,532 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:34:22,533 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:34:22,533 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:34:22,533 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:34:22,533 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:34:22,533 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:34:22,534 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:34:22,534 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:34:22,534 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:34:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 14:34:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 14:34:22,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:22,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 14:34:22,558 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:22,565 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:22,565 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-04 14:34:22,568 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:22,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:22,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:22,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:22,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:22,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:34:22,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 14:34:22,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:34:22,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:34:22,726 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:22,729 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 14:34:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:22,783 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 14:34:22,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:34:22,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 14:34:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:22,797 INFO L225 Difference]: With dead ends: 9 [2018-10-04 14:34:22,798 INFO L226 Difference]: Without dead ends: 4 [2018-10-04 14:34:22,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:34:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-04 14:34:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-04 14:34:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-04 14:34:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-04 14:34:22,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-04 14:34:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:22,836 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-04 14:34:22,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:34:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-04 14:34:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 14:34:22,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:22,837 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 14:34:22,837 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:22,838 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-04 14:34:22,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:22,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:22,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:22,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:22,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:23,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:23,018 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:23,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:23,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:23,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:23,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-10-04 14:34:23,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:34:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:34:23,171 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:23,171 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-10-04 14:34:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:23,248 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-04 14:34:23,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:34:23,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-10-04 14:34:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:23,251 INFO L225 Difference]: With dead ends: 6 [2018-10-04 14:34:23,251 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 14:34:23,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 2 [2018-10-04 14:34:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 14:34:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 14:34:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 14:34:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 14:34:23,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 14:34:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:23,261 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 14:34:23,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:34:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 14:34:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 14:34:23,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:23,263 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-04 14:34:23,263 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:23,263 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:23,263 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-04 14:34:23,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:23,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:23,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:23,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:23,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:23,470 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) [2018-10-04 14:34:23,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:23,501 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:23,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:23,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:23,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:23,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 14:34:23,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:34:23,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:34:23,547 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:23,547 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-10-04 14:34:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:23,571 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-04 14:34:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:34:23,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 14:34:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:23,572 INFO L225 Difference]: With dead ends: 7 [2018-10-04 14:34:23,572 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 14:34:23,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:34:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 14:34:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 14:34:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 14:34:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 14:34:23,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 14:34:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:23,575 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 14:34:23,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:34:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 14:34:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:34:23,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:23,576 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-04 14:34:23,577 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:23,577 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:23,577 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-04 14:34:23,577 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:23,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:23,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:23,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:23,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:23,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:23,723 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:23,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:23,740 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 14:34:23,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:23,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:23,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:23,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:34:23,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:34:23,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:34:23,848 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:23,848 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-10-04 14:34:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:23,875 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 14:34:23,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:34:23,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 14:34:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:23,877 INFO L225 Difference]: With dead ends: 8 [2018-10-04 14:34:23,877 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:34:23,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 4 [2018-10-04 14:34:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:34:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 14:34:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 14:34:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 14:34:23,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 14:34:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:23,880 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 14:34:23,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:34:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 14:34:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:34:23,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:23,881 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-04 14:34:23,881 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:23,882 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:23,882 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-04 14:34:23,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:23,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:23,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:23,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:23,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:24,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:24,172 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:24,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:24,221 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:24,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:24,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:24,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:24,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:34:24,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:34:24,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:34:24,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:24,277 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-10-04 14:34:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:24,303 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 14:34:24,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:34:24,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-04 14:34:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:24,305 INFO L225 Difference]: With dead ends: 9 [2018-10-04 14:34:24,305 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 14:34:24,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 5 [2018-10-04 14:34:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 14:34:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 14:34:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 14:34:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 14:34:24,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 14:34:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:24,310 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 14:34:24,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:34:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 14:34:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:34:24,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:24,311 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-04 14:34:24,311 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:24,311 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-04 14:34:24,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:24,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:24,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:24,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:24,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:24,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:24,441 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:24,453 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:24,512 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 14:34:24,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:24,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:24,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:24,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:34:24,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:34:24,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:34:24,615 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:24,616 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-10-04 14:34:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:24,669 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 14:34:24,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:34:24,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-04 14:34:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:24,670 INFO L225 Difference]: With dead ends: 10 [2018-10-04 14:34:24,670 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 14:34:24,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:34:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 14:34:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 14:34:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 14:34:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 14:34:24,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 14:34:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:24,674 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 14:34:24,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:34:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 14:34:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:34:24,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:24,675 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-04 14:34:24,676 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:24,676 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-04 14:34:24,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:24,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:24,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:24,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:24,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:24,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:24,785 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:24,794 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:24,804 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 14:34:24,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:24,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:24,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:24,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:34:24,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:34:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:34:24,867 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:24,867 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-10-04 14:34:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:24,915 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 14:34:24,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:34:24,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-10-04 14:34:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:24,916 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:34:24,917 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 14:34:24,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:34:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 14:34:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 14:34:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 14:34:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 14:34:24,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 14:34:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:24,921 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 14:34:24,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:34:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 14:34:24,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:34:24,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:24,922 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-04 14:34:24,922 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:24,922 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-04 14:34:24,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:24,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:24,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:24,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:24,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:25,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:25,541 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:25,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:25,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:25,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:25,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:34:25,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:34:25,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:34:25,653 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:25,653 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-10-04 14:34:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:25,680 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 14:34:25,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:34:25,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-10-04 14:34:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:25,681 INFO L225 Difference]: With dead ends: 12 [2018-10-04 14:34:25,682 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 14:34:25,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 8 [2018-10-04 14:34:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 14:34:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 14:34:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 14:34:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 14:34:25,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 14:34:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:25,685 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 14:34:25,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:34:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 14:34:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:34:25,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:25,686 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-04 14:34:25,687 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:25,687 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:25,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-04 14:34:25,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:25,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:25,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:25,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:25,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:25,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:25,836 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:25,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:25,857 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:25,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:25,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:25,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:25,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:34:25,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:34:25,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:34:25,945 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:25,945 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-10-04 14:34:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:26,001 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 14:34:26,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:34:26,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-10-04 14:34:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:26,002 INFO L225 Difference]: With dead ends: 13 [2018-10-04 14:34:26,002 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 14:34:26,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:34:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 14:34:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 14:34:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 14:34:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 14:34:26,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 14:34:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:26,006 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 14:34:26,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:34:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 14:34:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:34:26,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:26,006 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-04 14:34:26,007 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:26,007 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:26,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-04 14:34:26,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:26,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:26,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:26,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:26,201 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:26,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:26,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:34:26,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:26,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:26,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:26,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:34:26,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:34:26,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:34:26,291 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:26,292 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-10-04 14:34:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:26,321 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 14:34:26,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:34:26,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-04 14:34:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:26,322 INFO L225 Difference]: With dead ends: 14 [2018-10-04 14:34:26,322 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 14:34:26,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 10 [2018-10-04 14:34:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 14:34:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 14:34:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 14:34:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 14:34:26,326 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 14:34:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:26,326 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 14:34:26,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:34:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 14:34:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:34:26,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:26,327 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-04 14:34:26,327 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:26,328 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-04 14:34:26,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:26,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:26,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:26,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:26,508 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:26,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:26,536 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:26,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:26,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:26,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:26,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:34:26,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:34:26,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:34:26,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:26,647 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-10-04 14:34:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:26,697 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 14:34:26,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:34:26,700 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-04 14:34:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:26,701 INFO L225 Difference]: With dead ends: 15 [2018-10-04 14:34:26,701 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 14:34:26,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-04 14:34:26,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 14:34:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 14:34:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:34:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 14:34:26,705 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 14:34:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:26,705 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 14:34:26,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:34:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 14:34:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:34:26,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:26,706 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-04 14:34:26,707 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:26,707 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:26,707 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-04 14:34:26,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:26,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:26,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:26,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:26,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:27,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:27,017 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:27,026 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:27,037 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:34:27,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:27,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:27,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:27,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 14:34:27,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:34:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:34:27,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:27,114 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-10-04 14:34:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:27,142 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 14:34:27,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:34:27,143 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 14:34:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:27,144 INFO L225 Difference]: With dead ends: 16 [2018-10-04 14:34:27,144 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:34:27,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 12 [2018-10-04 14:34:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:34:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 14:34:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 14:34:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 14:34:27,148 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 14:34:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:27,149 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 14:34:27,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:34:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 14:34:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:34:27,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:27,150 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-04 14:34:27,150 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:27,150 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:27,150 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-04 14:34:27,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:27,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:27,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:27,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:27,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:27,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:27,341 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:27,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:27,381 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:34:27,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:27,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:27,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:27,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:34:27,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:34:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:34:27,447 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:27,447 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-10-04 14:34:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:27,482 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 14:34:27,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:34:27,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-04 14:34:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:27,483 INFO L225 Difference]: With dead ends: 17 [2018-10-04 14:34:27,483 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 14:34:27,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 13 [2018-10-04 14:34:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 14:34:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 14:34:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:34:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 14:34:27,488 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 14:34:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:27,489 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 14:34:27,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:34:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 14:34:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:34:27,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:27,490 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-04 14:34:27,490 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:27,490 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:27,490 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-04 14:34:27,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:27,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:27,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:27,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:27,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:27,650 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:27,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:27,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:27,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:27,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:34:27,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:34:27,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:34:27,754 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:27,754 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-10-04 14:34:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:27,783 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 14:34:27,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:34:27,783 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-04 14:34:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:27,784 INFO L225 Difference]: With dead ends: 18 [2018-10-04 14:34:27,784 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 14:34:27,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 14:34:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 14:34:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 14:34:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 14:34:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 14:34:27,789 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 14:34:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:27,789 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 14:34:27,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:34:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 14:34:27,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:34:27,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:27,790 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-04 14:34:27,790 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:27,791 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:27,791 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-04 14:34:27,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:27,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:27,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:27,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:27,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:28,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:28,000 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:28,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:28,021 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:28,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:28,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:28,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:28,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:34:28,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:34:28,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:34:28,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:28,123 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-10-04 14:34:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:28,310 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 14:34:28,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:34:28,310 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 14:34:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:28,310 INFO L225 Difference]: With dead ends: 19 [2018-10-04 14:34:28,311 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 14:34:28,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 14:34:28,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 14:34:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 14:34:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:34:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 14:34:28,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 14:34:28,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:28,315 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 14:34:28,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:34:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 14:34:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:34:28,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:28,316 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-04 14:34:28,317 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:28,317 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-04 14:34:28,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:28,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:28,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:28,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:28,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:28,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:28,525 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:28,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:28,584 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:34:28,584 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:28,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:28,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:28,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:34:28,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:34:28,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:34:28,805 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:28,805 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-10-04 14:34:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:28,867 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 14:34:28,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:34:28,867 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-10-04 14:34:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:28,868 INFO L225 Difference]: With dead ends: 20 [2018-10-04 14:34:28,868 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:34:28,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-04 14:34:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:34:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 14:34:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 14:34:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 14:34:28,871 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 14:34:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:28,871 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 14:34:28,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:34:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 14:34:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:34:28,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:28,872 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-04 14:34:28,873 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:28,873 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:28,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-04 14:34:28,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:28,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:28,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:28,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:28,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:29,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:29,302 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:29,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:29,338 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:29,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:29,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:29,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:29,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:34:29,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:34:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:34:29,418 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:29,419 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-10-04 14:34:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:29,447 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 14:34:29,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:34:29,447 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-04 14:34:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:29,448 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:34:29,448 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 14:34:29,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 17 [2018-10-04 14:34:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 14:34:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 14:34:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:34:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 14:34:29,453 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 14:34:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:29,454 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 14:34:29,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:34:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 14:34:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:34:29,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:29,454 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-04 14:34:29,455 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:29,455 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:29,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-04 14:34:29,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:29,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:29,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:29,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:29,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:29,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:29,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:29,865 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:29,905 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 14:34:29,905 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:29,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:30,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:30,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 14:34:30,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:34:30,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:34:30,085 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:30,085 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-10-04 14:34:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:30,169 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 14:34:30,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:34:30,170 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-10-04 14:34:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:30,171 INFO L225 Difference]: With dead ends: 22 [2018-10-04 14:34:30,171 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:34:30,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 18 [2018-10-04 14:34:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:34:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 14:34:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 14:34:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 14:34:30,176 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 14:34:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:30,176 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 14:34:30,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:34:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 14:34:30,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:34:30,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:30,177 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-04 14:34:30,177 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:30,177 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:30,178 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-04 14:34:30,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:30,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:30,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:30,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:30,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:30,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:30,438 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:30,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:30,597 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 14:34:30,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:30,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:30,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:30,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:34:30,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:34:30,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:34:30,891 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:30,892 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-10-04 14:34:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:30,942 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 14:34:30,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:34:30,942 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-10-04 14:34:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:30,943 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:34:30,943 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 14:34:30,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 19 [2018-10-04 14:34:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 14:34:30,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 14:34:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:34:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 14:34:30,947 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 14:34:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:30,947 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 14:34:30,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:34:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 14:34:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:34:30,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:30,948 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-04 14:34:30,949 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:30,949 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-04 14:34:30,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:30,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:30,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:30,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:30,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:31,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:31,323 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:31,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:31,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:31,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:31,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 14:34:31,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:34:31,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:34:31,460 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:31,461 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-10-04 14:34:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:31,495 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 14:34:31,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:34:31,496 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-10-04 14:34:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:31,497 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:34:31,497 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:34:31,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 20 [2018-10-04 14:34:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:34:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 14:34:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 14:34:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 14:34:31,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 14:34:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:31,502 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 14:34:31,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:34:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 14:34:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:34:31,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:31,503 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-04 14:34:31,503 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:31,504 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-04 14:34:31,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:31,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:31,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:31,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:31,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:31,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:31,834 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:31,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:31,871 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:31,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:31,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:32,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:32,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 14:34:32,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:34:32,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:34:32,236 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:32,236 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-10-04 14:34:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:32,273 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 14:34:32,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:34:32,273 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-10-04 14:34:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:32,274 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:34:32,274 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 14:34:32,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 21 [2018-10-04 14:34:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 14:34:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 14:34:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:34:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 14:34:32,279 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 14:34:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:32,279 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 14:34:32,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:34:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 14:34:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 14:34:32,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:32,280 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-04 14:34:32,281 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:32,281 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-04 14:34:32,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:32,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:32,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:32,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:32,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:32,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:32,693 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 14:34:32,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:32,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:32,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:32,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:34:32,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:34:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:34:32,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:32,917 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-10-04 14:34:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:33,175 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 14:34:33,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:34:33,177 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-10-04 14:34:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:33,178 INFO L225 Difference]: With dead ends: 26 [2018-10-04 14:34:33,178 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 14:34:33,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 22 [2018-10-04 14:34:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 14:34:33,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 14:34:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 14:34:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 14:34:33,181 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 14:34:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:33,181 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 14:34:33,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:34:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 14:34:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 14:34:33,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:33,182 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-04 14:34:33,182 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:33,183 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:33,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-04 14:34:33,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:33,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:33,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:33,528 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:33,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:33,528 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:33,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:33,555 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:33,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:33,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:33,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:33,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:34:33,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 14:34:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 14:34:33,646 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:33,646 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-10-04 14:34:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:33,686 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 14:34:33,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:34:33,687 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-10-04 14:34:33,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:33,687 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:34:33,688 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 14:34:33,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 23 [2018-10-04 14:34:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 14:34:33,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 14:34:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:34:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 14:34:33,693 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 14:34:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:33,693 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 14:34:33,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 14:34:33,693 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 14:34:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 14:34:33,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:33,694 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-04 14:34:33,694 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:33,694 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:33,695 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-04 14:34:33,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:33,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:33,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:33,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:33,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:34,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:34,237 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:34,247 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:34,268 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 14:34:34,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:34,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:34,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:34,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 14:34:34,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:34:34,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:34:34,380 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:34,380 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-10-04 14:34:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:34,425 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 14:34:34,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:34:34,425 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-10-04 14:34:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:34,426 INFO L225 Difference]: With dead ends: 28 [2018-10-04 14:34:34,426 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:34:34,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 24 [2018-10-04 14:34:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:34:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 14:34:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 14:34:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 14:34:34,430 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 14:34:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:34,431 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 14:34:34,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:34:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 14:34:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 14:34:34,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:34,432 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-04 14:34:34,432 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:34,432 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-04 14:34:34,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:34,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:34,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:34,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:34,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:35,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:35,216 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:35,224 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:35,247 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 14:34:35,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:35,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:35,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:35,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:34:35,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:34:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:34:35,399 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:35,399 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-10-04 14:34:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:35,476 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 14:34:35,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:34:35,476 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-10-04 14:34:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:35,477 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:34:35,477 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 14:34:35,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 25 [2018-10-04 14:34:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 14:34:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 14:34:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:34:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 14:34:35,481 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 14:34:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:35,482 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 14:34:35,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:34:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 14:34:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 14:34:35,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:35,483 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-04 14:34:35,483 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:35,483 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-04 14:34:35,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:35,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:35,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:35,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:35,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:35,817 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:35,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:35,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:35,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:35,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 14:34:35,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:34:35,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:34:35,963 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:35,963 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-10-04 14:34:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:36,081 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 14:34:36,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:34:36,081 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-10-04 14:34:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:36,082 INFO L225 Difference]: With dead ends: 30 [2018-10-04 14:34:36,082 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:34:36,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 26 [2018-10-04 14:34:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:34:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 14:34:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 14:34:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 14:34:36,086 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 14:34:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:36,086 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 14:34:36,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:34:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 14:34:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 14:34:36,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:36,087 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-04 14:34:36,088 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:36,088 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-04 14:34:36,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:36,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:36,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:36,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:36,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:36,523 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:36,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:36,548 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:36,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:36,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:36,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:36,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 14:34:36,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:34:36,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:34:36,622 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:36,623 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-10-04 14:34:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:36,702 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 14:34:36,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:34:36,702 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-10-04 14:34:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:36,703 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:34:36,703 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 14:34:36,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 27 [2018-10-04 14:34:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 14:34:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 14:34:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:34:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 14:34:36,708 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 14:34:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:36,709 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 14:34:36,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:34:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 14:34:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 14:34:36,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:36,710 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-04 14:34:36,710 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:36,710 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:36,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-04 14:34:36,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:36,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:36,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:36,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:36,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:37,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:37,213 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:37,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:37,244 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 14:34:37,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:37,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:37,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:37,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 14:34:37,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:34:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:34:37,317 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:37,317 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-10-04 14:34:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:37,439 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 14:34:37,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:34:37,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-10-04 14:34:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:37,440 INFO L225 Difference]: With dead ends: 32 [2018-10-04 14:34:37,440 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:34:37,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 28 [2018-10-04 14:34:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:34:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 14:34:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:34:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 14:34:37,444 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 14:34:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:37,445 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 14:34:37,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:34:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 14:34:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:34:37,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:37,445 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-04 14:34:37,446 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:37,446 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-04 14:34:37,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:37,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:37,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:37,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:37,848 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:37,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:37,873 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:37,873 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:37,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:37,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:37,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:34:37,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 14:34:37,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 14:34:37,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:37,978 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-10-04 14:34:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:38,029 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 14:34:38,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:34:38,030 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-10-04 14:34:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:38,030 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:34:38,030 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 14:34:38,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 29 [2018-10-04 14:34:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 14:34:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 14:34:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:34:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 14:34:38,035 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 14:34:38,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:38,036 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 14:34:38,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 14:34:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 14:34:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 14:34:38,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:38,036 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-04 14:34:38,037 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:38,037 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:38,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-04 14:34:38,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:38,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:38,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:38,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:38,400 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:38,410 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:38,435 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 14:34:38,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:38,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:38,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:38,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 14:34:38,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:34:38,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:34:38,616 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:38,616 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-10-04 14:34:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:38,654 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 14:34:38,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:34:38,654 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-10-04 14:34:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:38,655 INFO L225 Difference]: With dead ends: 34 [2018-10-04 14:34:38,655 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:34:38,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 30 [2018-10-04 14:34:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:34:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 14:34:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 14:34:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 14:34:38,660 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 14:34:38,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:38,660 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 14:34:38,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:34:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 14:34:38,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 14:34:38,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:38,661 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-04 14:34:38,661 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:38,661 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-04 14:34:38,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:38,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:38,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:38,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:38,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:39,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:39,524 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:39,534 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:39,556 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 14:34:39,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:39,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:39,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:39,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 14:34:39,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:34:39,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:34:39,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:39,652 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-10-04 14:34:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:39,706 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 14:34:39,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:34:39,706 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-10-04 14:34:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:39,707 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:34:39,707 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 14:34:39,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.7s impTime 31 [2018-10-04 14:34:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 14:34:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 14:34:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:34:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 14:34:39,711 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 14:34:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:39,711 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 14:34:39,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:34:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 14:34:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:34:39,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:39,711 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-04 14:34:39,712 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:39,712 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:39,712 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-04 14:34:39,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:39,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:39,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:39,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:39,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:40,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:40,243 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:40,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:40,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:40,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:40,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 14:34:40,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 14:34:40,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 14:34:40,433 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:40,433 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-10-04 14:34:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:40,498 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 14:34:40,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:34:40,499 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-10-04 14:34:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:40,499 INFO L225 Difference]: With dead ends: 36 [2018-10-04 14:34:40,500 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:34:40,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 32 [2018-10-04 14:34:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:34:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 14:34:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:34:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 14:34:40,504 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 14:34:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:40,505 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 14:34:40,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 14:34:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 14:34:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:34:40,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:40,505 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-04 14:34:40,506 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:40,506 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:40,506 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-04 14:34:40,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:40,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:40,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:41,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:41,105 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:41,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:41,133 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:41,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:41,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:41,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:41,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 14:34:41,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 14:34:41,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 14:34:41,231 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:41,231 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-10-04 14:34:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:41,271 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 14:34:41,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:34:41,271 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-10-04 14:34:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:41,272 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:34:41,272 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 14:34:41,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 33 [2018-10-04 14:34:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 14:34:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 14:34:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 14:34:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 14:34:41,277 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 14:34:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:41,277 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 14:34:41,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 14:34:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 14:34:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 14:34:41,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:41,278 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-04 14:34:41,278 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:41,278 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:41,278 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-04 14:34:41,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:41,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:41,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:41,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:41,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:41,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:41,858 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:41,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:41,894 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 14:34:41,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:41,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:42,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:42,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 14:34:42,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:34:42,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:34:42,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:42,015 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-10-04 14:34:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:42,065 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 14:34:42,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:34:42,065 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-10-04 14:34:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:42,066 INFO L225 Difference]: With dead ends: 38 [2018-10-04 14:34:42,066 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:34:42,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 34 [2018-10-04 14:34:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:34:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 14:34:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 14:34:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 14:34:42,070 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 14:34:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:42,070 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 14:34:42,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:34:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 14:34:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 14:34:42,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:42,071 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-04 14:34:42,071 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:42,071 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:42,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-04 14:34:42,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:42,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:42,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:42,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:42,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:42,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:42,832 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:42,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:42,864 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:42,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:42,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:43,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:43,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 14:34:43,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 14:34:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 14:34:43,076 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:43,076 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-10-04 14:34:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:43,131 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 14:34:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:34:43,132 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-10-04 14:34:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:43,132 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:34:43,132 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 14:34:43,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 35 [2018-10-04 14:34:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 14:34:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 14:34:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 14:34:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 14:34:43,135 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 14:34:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:43,135 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 14:34:43,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 14:34:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 14:34:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 14:34:43,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:43,136 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-04 14:34:43,136 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:43,136 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:43,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-04 14:34:43,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:43,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:43,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:43,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:43,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:43,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:43,955 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:43,963 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:44,040 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 14:34:44,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:44,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:44,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:44,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 14:34:44,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 14:34:44,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 14:34:44,145 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:44,145 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-10-04 14:34:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:44,258 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 14:34:44,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:34:44,259 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-10-04 14:34:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:44,259 INFO L225 Difference]: With dead ends: 40 [2018-10-04 14:34:44,259 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:34:44,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 36 [2018-10-04 14:34:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:34:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 14:34:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 14:34:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 14:34:44,262 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 14:34:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:44,262 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 14:34:44,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 14:34:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 14:34:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 14:34:44,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:44,263 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-04 14:34:44,263 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:44,263 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:44,263 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-04 14:34:44,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:44,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:44,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:44,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:44,842 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:44,852 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:44,878 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 14:34:44,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:44,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:45,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:45,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 14:34:45,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 14:34:45,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 14:34:45,548 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:45,548 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-10-04 14:34:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:45,601 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 14:34:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:34:45,601 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-10-04 14:34:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:45,602 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:34:45,602 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 14:34:45,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime 37 [2018-10-04 14:34:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 14:34:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 14:34:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 14:34:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 14:34:45,606 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 14:34:45,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:45,606 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 14:34:45,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 14:34:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 14:34:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 14:34:45,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:45,607 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-04 14:34:45,607 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:45,607 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:45,608 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-04 14:34:45,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:45,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:45,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:45,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:46,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:46,042 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:46,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:46,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:46,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:46,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 14:34:46,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 14:34:46,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 14:34:46,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:46,220 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-10-04 14:34:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:46,307 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 14:34:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:34:46,308 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-10-04 14:34:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:46,309 INFO L225 Difference]: With dead ends: 42 [2018-10-04 14:34:46,309 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:34:46,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 38 [2018-10-04 14:34:46,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:34:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 14:34:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 14:34:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 14:34:46,312 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 14:34:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:46,313 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 14:34:46,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 14:34:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 14:34:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 14:34:46,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:46,314 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-04 14:34:46,314 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:46,314 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:46,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-04 14:34:46,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:46,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:46,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:46,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:46,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:46,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:46,885 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:46,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:46,914 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:46,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:46,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:47,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:47,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 14:34:47,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:34:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:34:47,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:47,012 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-10-04 14:34:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:47,077 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 14:34:47,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:34:47,077 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-10-04 14:34:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:47,078 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:34:47,078 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 14:34:47,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 39 [2018-10-04 14:34:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 14:34:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 14:34:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 14:34:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 14:34:47,081 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 14:34:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:47,081 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 14:34:47,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:34:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 14:34:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 14:34:47,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:47,082 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-04 14:34:47,082 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:47,083 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-04 14:34:47,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:47,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:47,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:47,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:47,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:47,886 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:47,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:47,927 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 14:34:47,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:47,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:48,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:48,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 14:34:48,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 14:34:48,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 14:34:48,071 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:48,071 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-10-04 14:34:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:48,138 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 14:34:48,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:34:48,138 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-10-04 14:34:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:48,139 INFO L225 Difference]: With dead ends: 44 [2018-10-04 14:34:48,139 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:34:48,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 40 [2018-10-04 14:34:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:34:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 14:34:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 14:34:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 14:34:48,143 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 14:34:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:48,143 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 14:34:48,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 14:34:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 14:34:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 14:34:48,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:48,143 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-04 14:34:48,144 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:48,144 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-04 14:34:48,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:48,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:48,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:48,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:48,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:49,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:49,679 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:49,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:49,711 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:49,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:49,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:49,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:49,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 14:34:49,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 14:34:49,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 14:34:49,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:49,813 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-10-04 14:34:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:49,926 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 14:34:49,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:34:49,927 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-10-04 14:34:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:49,928 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:34:49,928 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 14:34:49,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.3s impTime 41 [2018-10-04 14:34:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 14:34:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 14:34:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 14:34:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 14:34:49,931 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 14:34:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:49,932 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 14:34:49,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 14:34:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 14:34:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 14:34:49,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:49,932 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-04 14:34:49,933 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:49,933 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:49,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-04 14:34:49,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:49,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:49,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:49,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:49,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:50,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:50,996 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:51,003 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:51,039 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 14:34:51,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:51,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:51,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:51,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 14:34:51,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:34:51,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:34:51,161 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:51,161 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-10-04 14:34:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:51,405 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 14:34:51,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:34:51,405 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-10-04 14:34:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:51,406 INFO L225 Difference]: With dead ends: 46 [2018-10-04 14:34:51,406 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:34:51,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 42 [2018-10-04 14:34:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:34:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 14:34:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 14:34:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 14:34:51,408 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 14:34:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:51,409 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 14:34:51,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:34:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 14:34:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 14:34:51,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:51,410 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-04 14:34:51,410 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:51,410 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:51,410 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-04 14:34:51,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:51,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:51,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:51,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:51,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:52,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:52,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:52,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:52,142 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 14:34:52,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:52,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:52,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:52,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 14:34:52,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:34:52,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:34:52,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:52,263 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-10-04 14:34:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:52,329 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 14:34:52,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:34:52,330 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-10-04 14:34:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:52,331 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:34:52,331 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 14:34:52,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 43 [2018-10-04 14:34:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 14:34:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 14:34:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 14:34:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 14:34:52,335 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 14:34:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:52,335 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 14:34:52,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:34:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 14:34:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 14:34:52,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:52,336 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-04 14:34:52,336 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:52,336 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:52,336 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-04 14:34:52,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:52,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:52,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:53,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:53,001 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:53,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:53,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:53,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:53,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 14:34:53,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 14:34:53,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 14:34:53,147 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:53,147 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-10-04 14:34:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:53,203 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-04 14:34:53,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 14:34:53,204 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-10-04 14:34:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:53,205 INFO L225 Difference]: With dead ends: 48 [2018-10-04 14:34:53,205 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:34:53,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 44 [2018-10-04 14:34:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:34:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 14:34:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 14:34:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 14:34:53,207 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-04 14:34:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:53,208 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 14:34:53,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 14:34:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 14:34:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 14:34:53,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:53,209 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-04 14:34:53,209 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:53,209 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:53,209 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-04 14:34:53,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:53,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:53,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:53,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:34:53,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:53,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:53,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:53,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:34:53,887 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:34:53,888 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:53,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:53,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:53,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 14:34:53,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 14:34:53,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 14:34:53,987 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:53,988 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-10-04 14:34:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:54,053 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-04 14:34:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:34:54,053 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-10-04 14:34:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:54,054 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:34:54,054 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 14:34:54,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 45 [2018-10-04 14:34:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 14:34:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-04 14:34:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 14:34:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-04 14:34:54,057 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-10-04 14:34:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:54,057 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-04 14:34:54,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 14:34:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-04 14:34:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 14:34:54,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:54,058 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-10-04 14:34:54,058 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:54,058 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-10-04 14:34:54,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:54,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:54,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:54,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:54,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:55,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:55,119 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:55,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:34:55,165 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-04 14:34:55,165 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:55,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:55,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:55,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 14:34:55,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 14:34:55,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 14:34:55,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:55,297 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-10-04 14:34:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:55,794 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-04 14:34:55,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:34:55,795 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-10-04 14:34:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:55,796 INFO L225 Difference]: With dead ends: 50 [2018-10-04 14:34:55,796 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:34:55,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 46 [2018-10-04 14:34:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:34:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-04 14:34:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 14:34:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 14:34:55,799 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-10-04 14:34:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:55,799 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 14:34:55,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 14:34:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 14:34:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 14:34:55,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:55,800 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-10-04 14:34:55,800 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:55,801 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-10-04 14:34:55,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:55,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:55,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:56,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:56,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:56,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:34:56,927 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:34:56,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:56,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:57,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:57,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 14:34:57,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 14:34:57,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 14:34:57,053 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:57,053 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-10-04 14:34:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:57,126 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 14:34:57,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 14:34:57,127 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-10-04 14:34:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:57,128 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:34:57,128 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 14:34:57,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 47 [2018-10-04 14:34:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 14:34:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 14:34:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 14:34:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-04 14:34:57,131 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-10-04 14:34:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:57,131 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-04 14:34:57,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 14:34:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-04 14:34:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 14:34:57,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:57,132 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-10-04 14:34:57,132 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:57,132 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-10-04 14:34:57,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:57,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:57,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:57,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:57,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:57,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:57,801 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:57,808 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:34:57,846 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 14:34:57,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:57,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:57,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:57,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 14:34:57,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 14:34:57,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 14:34:57,983 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:57,983 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-10-04 14:34:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:58,051 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-04 14:34:58,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 14:34:58,052 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-10-04 14:34:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:58,053 INFO L225 Difference]: With dead ends: 52 [2018-10-04 14:34:58,053 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:34:58,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 48 [2018-10-04 14:34:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:34:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 14:34:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 14:34:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 14:34:58,055 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-10-04 14:34:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:58,056 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 14:34:58,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 14:34:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 14:34:58,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 14:34:58,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:58,056 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-10-04 14:34:58,057 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:58,057 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-10-04 14:34:58,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:58,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:58,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:58,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:34:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:58,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:34:58,963 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:34:58,971 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:34:59,008 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 14:34:59,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:34:59,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:34:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:34:59,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:34:59,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 14:34:59,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 14:34:59,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 14:34:59,124 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:34:59,124 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-10-04 14:34:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:34:59,185 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-04 14:34:59,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 14:34:59,185 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-10-04 14:34:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:34:59,186 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:34:59,186 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 14:34:59,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 49 [2018-10-04 14:34:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 14:34:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-04 14:34:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 14:34:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-04 14:34:59,190 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-10-04 14:34:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:34:59,190 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-04 14:34:59,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 14:34:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-04 14:34:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 14:34:59,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:34:59,191 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-10-04 14:34:59,191 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:34:59,191 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:34:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-10-04 14:34:59,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:34:59,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:34:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:59,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:34:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:34:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:01,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:01,272 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:01,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:01,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:01,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:01,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 14:35:01,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:35:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:35:01,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:01,415 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-10-04 14:35:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:01,497 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-04 14:35:01,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:35:01,498 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-10-04 14:35:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:01,499 INFO L225 Difference]: With dead ends: 54 [2018-10-04 14:35:01,499 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:35:01,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.6s impTime 50 [2018-10-04 14:35:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:35:01,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 14:35:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 14:35:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 14:35:01,502 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-10-04 14:35:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:01,502 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 14:35:01,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:35:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 14:35:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 14:35:01,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:01,502 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-10-04 14:35:01,502 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:01,503 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-10-04 14:35:01,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:01,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:01,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:01,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:02,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:02,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:02,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:02,815 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:02,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:02,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:02,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:02,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 14:35:02,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:35:02,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:35:02,944 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:02,944 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-10-04 14:35:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:03,043 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 14:35:03,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 14:35:03,044 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-10-04 14:35:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:03,045 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:35:03,045 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 14:35:03,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.1s impTime 51 [2018-10-04 14:35:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 14:35:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-04 14:35:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 14:35:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-04 14:35:03,048 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-10-04 14:35:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:03,048 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-04 14:35:03,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:35:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-04 14:35:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 14:35:03,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:03,049 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-10-04 14:35:03,049 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:03,049 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-10-04 14:35:03,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:03,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:03,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:03,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:03,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:03,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:03,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:03,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:04,315 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-04 14:35:04,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:04,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:04,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:04,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 14:35:04,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 14:35:04,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 14:35:04,572 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:04,572 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-10-04 14:35:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:04,660 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-04 14:35:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 14:35:04,661 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-10-04 14:35:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:04,661 INFO L225 Difference]: With dead ends: 56 [2018-10-04 14:35:04,661 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:35:04,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime 52 [2018-10-04 14:35:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:35:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 14:35:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 14:35:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-04 14:35:04,663 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-10-04 14:35:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:04,664 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-04 14:35:04,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 14:35:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-04 14:35:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 14:35:04,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:04,664 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-10-04 14:35:04,665 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:04,665 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-10-04 14:35:04,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:04,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:04,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:04,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:04,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:05,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:05,587 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:05,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:05,638 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:05,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:05,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:05,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:05,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 14:35:05,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 14:35:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 14:35:05,900 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:05,900 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-10-04 14:35:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:06,032 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-04 14:35:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:35:06,032 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-10-04 14:35:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:06,033 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:35:06,033 INFO L226 Difference]: Without dead ends: 56 [2018-10-04 14:35:06,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 53 [2018-10-04 14:35:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-04 14:35:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-04 14:35:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 14:35:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-04 14:35:06,036 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-10-04 14:35:06,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:06,036 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-04 14:35:06,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 14:35:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-04 14:35:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-04 14:35:06,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:06,036 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-10-04 14:35:06,037 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:06,037 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:06,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-10-04 14:35:06,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:06,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:06,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:06,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:07,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:07,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:07,380 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:07,428 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-10-04 14:35:07,428 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:07,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:07,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:07,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 14:35:07,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 14:35:07,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 14:35:07,551 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:07,551 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-10-04 14:35:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:07,638 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-04 14:35:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:35:07,639 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-10-04 14:35:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:07,639 INFO L225 Difference]: With dead ends: 58 [2018-10-04 14:35:07,640 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:35:07,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.1s impTime 54 [2018-10-04 14:35:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:35:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 14:35:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 14:35:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 14:35:07,643 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-10-04 14:35:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:07,643 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 14:35:07,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 14:35:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 14:35:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 14:35:07,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:07,644 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-10-04 14:35:07,644 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:07,644 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:07,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-10-04 14:35:07,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:07,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:07,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:07,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:07,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:08,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:08,597 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:08,604 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:08,645 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-04 14:35:08,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:08,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:08,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:08,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 14:35:08,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 14:35:08,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 14:35:08,799 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:08,799 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-10-04 14:35:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:08,885 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 14:35:08,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 14:35:08,885 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-10-04 14:35:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:08,886 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:35:08,886 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 14:35:08,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.8s impTime 55 [2018-10-04 14:35:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 14:35:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-04 14:35:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-04 14:35:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-04 14:35:08,889 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-10-04 14:35:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:08,889 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-04 14:35:08,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 14:35:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-04 14:35:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 14:35:08,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:08,889 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-10-04 14:35:08,889 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:08,890 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:08,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-10-04 14:35:08,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:08,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:08,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:08,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:08,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:09,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:09,738 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:09,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:09,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:09,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:09,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 14:35:09,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 14:35:09,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 14:35:09,990 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:09,990 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-10-04 14:35:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:10,106 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-04 14:35:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 14:35:10,106 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-10-04 14:35:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:10,107 INFO L225 Difference]: With dead ends: 60 [2018-10-04 14:35:10,107 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:35:10,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 56 [2018-10-04 14:35:10,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:35:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 14:35:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 14:35:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-04 14:35:10,110 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-10-04 14:35:10,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:10,110 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-04 14:35:10,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 14:35:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-04 14:35:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:35:10,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:10,110 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-10-04 14:35:10,111 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:10,111 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:10,111 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-10-04 14:35:10,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:10,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:10,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:10,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:10,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:11,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:11,531 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:11,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:11,567 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:11,567 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:11,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:11,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:11,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 14:35:11,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 14:35:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 14:35:11,692 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:11,692 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-10-04 14:35:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:11,783 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 14:35:11,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 14:35:11,784 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-10-04 14:35:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:11,784 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:35:11,784 INFO L226 Difference]: Without dead ends: 60 [2018-10-04 14:35:11,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.2s impTime 57 [2018-10-04 14:35:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-04 14:35:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-10-04 14:35:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-04 14:35:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-04 14:35:11,787 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-10-04 14:35:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:11,788 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-04 14:35:11,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 14:35:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-04 14:35:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-04 14:35:11,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:11,788 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-10-04 14:35:11,789 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:11,789 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:11,789 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-10-04 14:35:11,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:11,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:11,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:12,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:12,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:12,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:13,039 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-10-04 14:35:13,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:13,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:13,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:13,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 14:35:13,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 14:35:13,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 14:35:13,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:13,189 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-10-04 14:35:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:13,262 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-04 14:35:13,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 14:35:13,263 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-10-04 14:35:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:13,264 INFO L225 Difference]: With dead ends: 62 [2018-10-04 14:35:13,264 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 14:35:13,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 58 [2018-10-04 14:35:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 14:35:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 14:35:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 14:35:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 14:35:13,267 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-10-04 14:35:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:13,268 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 14:35:13,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 14:35:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 14:35:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 14:35:13,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:13,268 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-10-04 14:35:13,269 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:13,269 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:13,269 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-10-04 14:35:13,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:13,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:13,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:15,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:15,131 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:15,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:15,172 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:15,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:15,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:15,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:15,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 14:35:15,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 14:35:15,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 14:35:15,389 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:15,389 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-10-04 14:35:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:15,485 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 14:35:15,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 14:35:15,486 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-10-04 14:35:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:15,486 INFO L225 Difference]: With dead ends: 63 [2018-10-04 14:35:15,486 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 14:35:15,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.5s impTime 59 [2018-10-04 14:35:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 14:35:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-10-04 14:35:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 14:35:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-04 14:35:15,490 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-10-04 14:35:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:15,491 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-04 14:35:15,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 14:35:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-04 14:35:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 14:35:15,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:15,491 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-10-04 14:35:15,491 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:15,492 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-10-04 14:35:15,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:15,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:15,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:15,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:16,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:16,991 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:16,999 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:17,047 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-04 14:35:17,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:17,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:17,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:17,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-04 14:35:17,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 14:35:17,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 14:35:17,194 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:17,195 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-10-04 14:35:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:17,289 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-04 14:35:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 14:35:17,290 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-10-04 14:35:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:17,290 INFO L225 Difference]: With dead ends: 64 [2018-10-04 14:35:17,291 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:35:17,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.3s impTime 60 [2018-10-04 14:35:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:35:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 14:35:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 14:35:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-04 14:35:17,293 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-10-04 14:35:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:17,294 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-04 14:35:17,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 14:35:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-04 14:35:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 14:35:17,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:17,294 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-10-04 14:35:17,294 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:17,294 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-10-04 14:35:17,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:17,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:21,369 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:21,378 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:21,426 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 14:35:21,426 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:21,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:21,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 14:35:21,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 14:35:21,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 14:35:21,661 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:21,661 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-10-04 14:35:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:21,741 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 14:35:21,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 14:35:21,742 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-10-04 14:35:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:21,742 INFO L225 Difference]: With dead ends: 65 [2018-10-04 14:35:21,742 INFO L226 Difference]: Without dead ends: 64 [2018-10-04 14:35:21,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s Time 3.4s impTime 61 [2018-10-04 14:35:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-04 14:35:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-10-04 14:35:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 14:35:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-04 14:35:21,745 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-10-04 14:35:21,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:21,746 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-04 14:35:21,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 14:35:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-04 14:35:21,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 14:35:21,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:21,746 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-10-04 14:35:21,746 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:21,746 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:21,747 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-10-04 14:35:21,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:21,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:21,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:21,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:25,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:25,061 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:25,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:25,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:25,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:25,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-04 14:35:25,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 14:35:25,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 14:35:25,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:25,417 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-10-04 14:35:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:25,523 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-04 14:35:25,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 14:35:25,524 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-10-04 14:35:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:25,524 INFO L225 Difference]: With dead ends: 66 [2018-10-04 14:35:25,525 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 14:35:25,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 2.7s impTime 62 [2018-10-04 14:35:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 14:35:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-04 14:35:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 14:35:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-04 14:35:25,528 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-10-04 14:35:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:25,528 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-04 14:35:25,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 14:35:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-04 14:35:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 14:35:25,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:25,529 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-10-04 14:35:25,529 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:25,529 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-10-04 14:35:25,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:25,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:25,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:25,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:25,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:27,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:27,286 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:27,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:27,332 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:27,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:27,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:27,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:27,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 14:35:27,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 14:35:27,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 14:35:27,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:27,484 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-10-04 14:35:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:27,633 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-04 14:35:27,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 14:35:27,633 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-10-04 14:35:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:27,634 INFO L225 Difference]: With dead ends: 67 [2018-10-04 14:35:27,634 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 14:35:27,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.6s impTime 63 [2018-10-04 14:35:27,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 14:35:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-04 14:35:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 14:35:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-04 14:35:27,637 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-10-04 14:35:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:27,637 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-04 14:35:27,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 14:35:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-04 14:35:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 14:35:27,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:27,638 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-10-04 14:35:27,638 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:27,638 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:27,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-10-04 14:35:27,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:27,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:27,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:27,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:30,623 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:30,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:30,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-10-04 14:35:30,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:30,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:30,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-04 14:35:30,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 14:35:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 14:35:30,826 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:30,826 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-10-04 14:35:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:30,938 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-04 14:35:30,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 14:35:30,938 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-10-04 14:35:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:30,939 INFO L225 Difference]: With dead ends: 68 [2018-10-04 14:35:30,939 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 14:35:30,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.5s impTime 64 [2018-10-04 14:35:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 14:35:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-04 14:35:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 14:35:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-04 14:35:30,943 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-10-04 14:35:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:30,943 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-04 14:35:30,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 14:35:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-04 14:35:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 14:35:30,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:30,944 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-10-04 14:35:30,944 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:30,944 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-10-04 14:35:30,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:30,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:30,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:30,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:30,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:32,387 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 14:35:32,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:32,462 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:32,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:32,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:32,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 14:35:32,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 14:35:32,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 14:35:32,679 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:32,679 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-10-04 14:35:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:32,762 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-04 14:35:32,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 14:35:32,762 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-10-04 14:35:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:32,763 INFO L225 Difference]: With dead ends: 69 [2018-10-04 14:35:32,763 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 14:35:32,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.2s impTime 65 [2018-10-04 14:35:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 14:35:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 14:35:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 14:35:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-04 14:35:32,766 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-10-04 14:35:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:32,766 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-04 14:35:32,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 14:35:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-04 14:35:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 14:35:32,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:32,767 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-10-04 14:35:32,767 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:32,767 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:32,767 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-10-04 14:35:32,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:32,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:32,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:32,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:33,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:33,779 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:33,785 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:33,837 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-10-04 14:35:33,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:33,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:33,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:33,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-04 14:35:33,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 14:35:33,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 14:35:33,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:33,977 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-10-04 14:35:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:34,094 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-04 14:35:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 14:35:34,094 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-10-04 14:35:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:34,095 INFO L225 Difference]: With dead ends: 70 [2018-10-04 14:35:34,095 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 14:35:34,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.8s impTime 66 [2018-10-04 14:35:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 14:35:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-04 14:35:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 14:35:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-04 14:35:34,099 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-10-04 14:35:34,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:34,099 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-04 14:35:34,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 14:35:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-04 14:35:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 14:35:34,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:34,099 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-10-04 14:35:34,100 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:34,100 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-10-04 14:35:34,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:34,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:34,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:34,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:34,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:36,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:36,075 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:36,083 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:36,138 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-10-04 14:35:36,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:36,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:36,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:36,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 14:35:36,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 14:35:36,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 14:35:36,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:36,298 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-10-04 14:35:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:36,416 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-04 14:35:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 14:35:36,416 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-10-04 14:35:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:36,417 INFO L225 Difference]: With dead ends: 71 [2018-10-04 14:35:36,417 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 14:35:36,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.8s impTime 67 [2018-10-04 14:35:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 14:35:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-04 14:35:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-04 14:35:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-04 14:35:36,421 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-10-04 14:35:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:36,421 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-04 14:35:36,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 14:35:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-04 14:35:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-04 14:35:36,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:36,422 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-10-04 14:35:36,422 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:36,422 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-10-04 14:35:36,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:36,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:36,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:36,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:36,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:38,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:38,076 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:38,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:38,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:38,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:38,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-04 14:35:38,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 14:35:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 14:35:38,317 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:38,317 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-10-04 14:35:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:38,436 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-04 14:35:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 14:35:38,436 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-10-04 14:35:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:38,437 INFO L225 Difference]: With dead ends: 72 [2018-10-04 14:35:38,437 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 14:35:38,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime 68 [2018-10-04 14:35:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 14:35:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 14:35:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 14:35:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-04 14:35:38,440 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-10-04 14:35:38,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:38,440 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-04 14:35:38,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 14:35:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-04 14:35:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 14:35:38,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:38,441 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-10-04 14:35:38,441 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:38,441 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-10-04 14:35:38,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:38,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:38,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:38,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:38,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:39,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:39,554 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:39,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:39,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:39,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:39,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:39,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:39,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 14:35:39,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 14:35:39,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 14:35:39,752 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:39,752 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-10-04 14:35:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:39,848 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-04 14:35:39,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 14:35:39,849 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-10-04 14:35:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:39,850 INFO L225 Difference]: With dead ends: 73 [2018-10-04 14:35:39,850 INFO L226 Difference]: Without dead ends: 72 [2018-10-04 14:35:39,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 69 [2018-10-04 14:35:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-04 14:35:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-10-04 14:35:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-04 14:35:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-04 14:35:39,853 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-10-04 14:35:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:39,853 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-04 14:35:39,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 14:35:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-04 14:35:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 14:35:39,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:39,854 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-10-04 14:35:39,854 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:39,854 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-10-04 14:35:39,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:39,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:39,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:42,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:42,320 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:42,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:42,388 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-04 14:35:42,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:42,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:42,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:42,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-04 14:35:42,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 14:35:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 14:35:42,546 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:42,546 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-10-04 14:35:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:42,722 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-04 14:35:42,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 14:35:42,722 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-10-04 14:35:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:42,723 INFO L225 Difference]: With dead ends: 74 [2018-10-04 14:35:42,723 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 14:35:42,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 2.2s impTime 70 [2018-10-04 14:35:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 14:35:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-04 14:35:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 14:35:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-04 14:35:42,727 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-10-04 14:35:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:42,727 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-04 14:35:42,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 14:35:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-04 14:35:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 14:35:42,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:42,728 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-10-04 14:35:42,728 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:42,728 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-10-04 14:35:42,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:42,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:42,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:43,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:43,887 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:43,895 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:43,941 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:43,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:43,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:45,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:45,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 14:35:45,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 14:35:45,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 14:35:45,387 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:45,387 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-10-04 14:35:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:46,165 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-04 14:35:46,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 14:35:46,165 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-10-04 14:35:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:46,166 INFO L225 Difference]: With dead ends: 75 [2018-10-04 14:35:46,166 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 14:35:46,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 0.9s impTime 71 [2018-10-04 14:35:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 14:35:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 14:35:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 14:35:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-04 14:35:46,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-10-04 14:35:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:46,169 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-04 14:35:46,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 14:35:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-04 14:35:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 14:35:46,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:46,170 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-10-04 14:35:46,170 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:46,170 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:46,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-10-04 14:35:46,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:46,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:46,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:46,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:46,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:48,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:48,415 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:48,422 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:48,578 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-04 14:35:48,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:48,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:48,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:48,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-04 14:35:48,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 14:35:48,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 14:35:48,731 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:48,731 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-10-04 14:35:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:48,988 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-04 14:35:48,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 14:35:48,989 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-10-04 14:35:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:48,990 INFO L225 Difference]: With dead ends: 76 [2018-10-04 14:35:48,990 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 14:35:48,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.9s impTime 72 [2018-10-04 14:35:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 14:35:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-04 14:35:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 14:35:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-04 14:35:48,993 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-10-04 14:35:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:48,994 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-04 14:35:48,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 14:35:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-04 14:35:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 14:35:48,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:48,995 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-10-04 14:35:48,995 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:48,995 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-10-04 14:35:48,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:48,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:48,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:48,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:48,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:51,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:51,623 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:51,632 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:51,729 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 14:35:51,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:51,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:52,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:52,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 14:35:52,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 14:35:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 14:35:52,382 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:52,382 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-10-04 14:35:52,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:52,517 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-04 14:35:52,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 14:35:52,517 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-10-04 14:35:52,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:52,518 INFO L225 Difference]: With dead ends: 77 [2018-10-04 14:35:52,518 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 14:35:52,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.4s impTime 73 [2018-10-04 14:35:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 14:35:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 14:35:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 14:35:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-04 14:35:52,523 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-10-04 14:35:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:52,523 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-04 14:35:52,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 14:35:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-04 14:35:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 14:35:52,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:52,524 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-10-04 14:35:52,524 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:52,524 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-10-04 14:35:52,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:52,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:52,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:52,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:52,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:53,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:53,959 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:53,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:54,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:54,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:54,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-04 14:35:54,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 14:35:54,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 14:35:54,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:54,189 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-10-04 14:35:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:54,304 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-04 14:35:54,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 14:35:54,304 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-10-04 14:35:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:54,305 INFO L225 Difference]: With dead ends: 78 [2018-10-04 14:35:54,305 INFO L226 Difference]: Without dead ends: 77 [2018-10-04 14:35:54,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.2s impTime 74 [2018-10-04 14:35:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-04 14:35:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-04 14:35:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 14:35:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-04 14:35:54,309 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-10-04 14:35:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:54,309 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-04 14:35:54,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 14:35:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-04 14:35:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 14:35:54,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:54,310 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-10-04 14:35:54,310 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:54,310 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-10-04 14:35:54,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:54,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:54,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:54,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:54,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:56,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:56,276 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:56,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:56,326 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:56,326 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:56,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:56,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:56,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-04 14:35:56,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 14:35:56,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 14:35:56,485 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:56,485 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-10-04 14:35:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:56,589 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-04 14:35:56,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 14:35:56,589 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-10-04 14:35:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:56,590 INFO L225 Difference]: With dead ends: 79 [2018-10-04 14:35:56,590 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 14:35:56,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.6s impTime 75 [2018-10-04 14:35:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 14:35:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-04 14:35:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 14:35:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-04 14:35:56,593 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-10-04 14:35:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:56,594 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-04 14:35:56,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 14:35:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-04 14:35:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 14:35:56,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:56,594 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-10-04 14:35:56,594 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:56,595 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:56,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-10-04 14:35:56,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:56,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:56,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:56,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:56,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:58,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:58,125 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:58,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:58,199 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-10-04 14:35:58,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:58,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:58,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:58,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-04 14:35:58,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 14:35:58,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 14:35:58,360 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:58,360 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-10-04 14:35:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:58,497 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-04 14:35:58,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 14:35:58,497 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-10-04 14:35:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:58,498 INFO L225 Difference]: With dead ends: 80 [2018-10-04 14:35:58,498 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 14:35:58,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.3s impTime 76 [2018-10-04 14:35:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 14:35:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-04 14:35:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 14:35:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-04 14:35:58,501 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-10-04 14:35:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:58,501 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-04 14:35:58,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 14:35:58,501 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-04 14:35:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 14:35:58,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:58,502 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-10-04 14:35:58,502 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:58,502 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:58,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-10-04 14:35:58,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:58,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:58,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:58,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:58,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:59,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:59,993 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:00,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:00,052 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:00,052 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:00,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:00,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:00,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-04 14:36:00,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 14:36:00,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 14:36:00,212 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:00,212 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-10-04 14:36:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:00,329 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-04 14:36:00,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 14:36:00,329 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-10-04 14:36:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:00,330 INFO L225 Difference]: With dead ends: 81 [2018-10-04 14:36:00,330 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 14:36:00,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.3s impTime 77 [2018-10-04 14:36:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 14:36:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 14:36:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 14:36:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-04 14:36:00,334 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-10-04 14:36:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:00,334 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-04 14:36:00,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 14:36:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-04 14:36:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 14:36:00,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:00,335 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-10-04 14:36:00,335 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:00,335 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:00,335 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-10-04 14:36:00,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:00,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:00,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:00,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:00,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:02,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:02,010 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:02,018 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:02,085 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-10-04 14:36:02,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:02,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:02,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:02,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-04 14:36:02,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 14:36:02,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 14:36:02,258 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:02,258 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-10-04 14:36:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:03,221 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-04 14:36:03,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-04 14:36:03,222 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-10-04 14:36:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:03,222 INFO L225 Difference]: With dead ends: 82 [2018-10-04 14:36:03,222 INFO L226 Difference]: Without dead ends: 81 [2018-10-04 14:36:03,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime 78 [2018-10-04 14:36:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-04 14:36:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-04 14:36:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-04 14:36:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-04 14:36:03,225 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-10-04 14:36:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:03,225 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-04 14:36:03,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 14:36:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-04 14:36:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 14:36:03,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:03,226 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-10-04 14:36:03,226 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:03,226 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:03,227 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-10-04 14:36:03,227 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:03,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:03,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:03,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:03,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:05,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:05,282 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:05,290 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:05,355 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2018-10-04 14:36:05,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:05,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:05,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:05,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-04 14:36:05,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 14:36:05,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 14:36:05,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:05,523 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-10-04 14:36:05,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:05,718 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-04 14:36:05,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-04 14:36:05,719 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-10-04 14:36:05,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:05,720 INFO L225 Difference]: With dead ends: 83 [2018-10-04 14:36:05,720 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 14:36:05,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.8s impTime 79 [2018-10-04 14:36:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 14:36:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-04 14:36:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 14:36:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-04 14:36:05,723 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-10-04 14:36:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:05,723 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-04 14:36:05,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 14:36:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-04 14:36:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 14:36:05,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:05,724 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-10-04 14:36:05,725 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:05,725 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:05,725 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-10-04 14:36:05,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:05,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:05,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:05,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:05,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:08,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:08,815 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:08,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:08,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:09,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:09,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-04 14:36:09,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 14:36:09,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 14:36:09,029 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:09,030 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-10-04 14:36:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:09,200 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-04 14:36:09,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 14:36:09,200 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-10-04 14:36:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:09,201 INFO L225 Difference]: With dead ends: 84 [2018-10-04 14:36:09,201 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 14:36:09,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.8s impTime 80 [2018-10-04 14:36:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 14:36:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 14:36:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 14:36:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-04 14:36:09,204 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-10-04 14:36:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:09,205 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-04 14:36:09,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 14:36:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-04 14:36:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-04 14:36:09,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:09,205 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-10-04 14:36:09,205 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:09,206 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:09,206 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-10-04 14:36:09,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:09,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:09,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:09,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:09,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:11,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:11,706 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:11,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:11,757 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:11,758 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:11,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:11,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:11,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-04 14:36:11,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 14:36:11,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 14:36:11,924 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:11,924 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-10-04 14:36:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:12,067 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-04 14:36:12,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-04 14:36:12,067 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-10-04 14:36:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:12,067 INFO L225 Difference]: With dead ends: 85 [2018-10-04 14:36:12,067 INFO L226 Difference]: Without dead ends: 84 [2018-10-04 14:36:12,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 2.2s impTime 81 [2018-10-04 14:36:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-04 14:36:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-10-04 14:36:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-04 14:36:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-04 14:36:12,071 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-10-04 14:36:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:12,071 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-04 14:36:12,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 14:36:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-04 14:36:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-04 14:36:12,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:12,072 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-10-04 14:36:12,072 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:12,073 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2018-10-04 14:36:12,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:12,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:12,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:12,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:12,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:14,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:14,337 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:14,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:14,416 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-10-04 14:36:14,416 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:14,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:15,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:15,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-04 14:36:15,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 14:36:15,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 14:36:15,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:15,189 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-10-04 14:36:15,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:15,336 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-04 14:36:15,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 14:36:15,337 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-10-04 14:36:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:15,337 INFO L225 Difference]: With dead ends: 86 [2018-10-04 14:36:15,338 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 14:36:15,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 1.9s impTime 82 [2018-10-04 14:36:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 14:36:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 14:36:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 14:36:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-04 14:36:15,341 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-10-04 14:36:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:15,341 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-04 14:36:15,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 14:36:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-04 14:36:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 14:36:15,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:15,342 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-10-04 14:36:15,342 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:15,342 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:15,342 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2018-10-04 14:36:15,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:15,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:15,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:15,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:15,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:18,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:18,255 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:18,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:18,313 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:18,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:18,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:18,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:18,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-04 14:36:18,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 14:36:18,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 14:36:18,537 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:18,537 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-10-04 14:36:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:18,723 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-04 14:36:18,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 14:36:18,724 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-10-04 14:36:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:18,725 INFO L225 Difference]: With dead ends: 87 [2018-10-04 14:36:18,725 INFO L226 Difference]: Without dead ends: 86 [2018-10-04 14:36:18,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.6s impTime 83 [2018-10-04 14:36:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-04 14:36:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-10-04 14:36:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-04 14:36:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-04 14:36:18,729 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-10-04 14:36:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:18,729 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-04 14:36:18,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 14:36:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-04 14:36:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 14:36:18,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:18,730 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-10-04 14:36:18,730 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:18,730 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2018-10-04 14:36:18,730 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:18,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:18,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:18,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:18,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:21,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:21,254 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:21,263 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:21,336 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-10-04 14:36:21,336 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:21,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:21,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:21,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-04 14:36:21,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 14:36:21,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 14:36:21,619 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:21,620 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-10-04 14:36:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:21,836 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-04 14:36:21,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-04 14:36:21,836 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-10-04 14:36:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:21,837 INFO L225 Difference]: With dead ends: 88 [2018-10-04 14:36:21,837 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 14:36:21,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 2.2s impTime 84 [2018-10-04 14:36:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 14:36:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 14:36:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 14:36:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-04 14:36:21,840 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-10-04 14:36:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:21,840 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-04 14:36:21,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 14:36:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-04 14:36:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 14:36:21,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:21,841 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-10-04 14:36:21,841 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:21,841 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2018-10-04 14:36:21,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:21,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:21,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:23,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:23,823 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:23,834 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:23,905 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 14:36:23,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:23,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:24,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:24,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-04 14:36:24,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 14:36:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 14:36:24,092 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:24,092 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-10-04 14:36:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:24,388 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-04 14:36:24,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-04 14:36:24,389 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-10-04 14:36:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:24,389 INFO L225 Difference]: With dead ends: 89 [2018-10-04 14:36:24,389 INFO L226 Difference]: Without dead ends: 88 [2018-10-04 14:36:24,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.7s impTime 85 [2018-10-04 14:36:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-04 14:36:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-10-04 14:36:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 14:36:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-04 14:36:24,393 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-10-04 14:36:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:24,393 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-04 14:36:24,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 14:36:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-04 14:36:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 14:36:24,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:24,394 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-10-04 14:36:24,394 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:24,394 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:24,395 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2018-10-04 14:36:24,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:24,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:24,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:24,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:24,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:27,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:27,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:27,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:27,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:27,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:27,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-04 14:36:27,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 14:36:27,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 14:36:27,913 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:27,913 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-10-04 14:36:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:28,129 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-04 14:36:28,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-04 14:36:28,129 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-10-04 14:36:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:28,130 INFO L225 Difference]: With dead ends: 90 [2018-10-04 14:36:28,131 INFO L226 Difference]: Without dead ends: 89 [2018-10-04 14:36:28,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 2.9s impTime 86 [2018-10-04 14:36:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-04 14:36:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-04 14:36:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 14:36:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-04 14:36:28,134 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-10-04 14:36:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:28,134 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-04 14:36:28,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 14:36:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-04 14:36:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-04 14:36:28,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:28,135 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-10-04 14:36:28,135 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:28,135 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2018-10-04 14:36:28,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:28,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:28,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:28,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:28,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:31,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:31,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:31,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:31,457 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:31,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:31,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:31,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:31,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-04 14:36:31,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 14:36:31,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 14:36:31,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:31,639 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-10-04 14:36:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:31,914 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-04 14:36:31,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-04 14:36:31,915 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-10-04 14:36:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:31,915 INFO L225 Difference]: With dead ends: 91 [2018-10-04 14:36:31,915 INFO L226 Difference]: Without dead ends: 90 [2018-10-04 14:36:31,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 3.0s impTime 87 [2018-10-04 14:36:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-04 14:36:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-10-04 14:36:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-04 14:36:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-04 14:36:31,917 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-10-04 14:36:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:31,917 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-04 14:36:31,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-04 14:36:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-04 14:36:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-04 14:36:31,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:31,918 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-10-04 14:36:31,918 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:31,918 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash 314487073, now seen corresponding path program 87 times [2018-10-04 14:36:31,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:31,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:31,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:31,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:31,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:34,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:34,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:34,904 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-10-04 14:36:34,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:34,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:35,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:35,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-10-04 14:36:35,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 14:36:35,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 14:36:35,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:35,080 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-10-04 14:36:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:35,281 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-04 14:36:35,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-04 14:36:35,282 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-10-04 14:36:35,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:35,282 INFO L225 Difference]: With dead ends: 92 [2018-10-04 14:36:35,283 INFO L226 Difference]: Without dead ends: 91 [2018-10-04 14:36:35,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.6s impTime 88 [2018-10-04 14:36:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-04 14:36:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-04 14:36:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 14:36:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-04 14:36:35,286 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-10-04 14:36:35,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:35,286 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-04 14:36:35,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 14:36:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-04 14:36:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 14:36:35,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:35,286 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-10-04 14:36:35,287 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:35,287 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:35,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164615, now seen corresponding path program 88 times [2018-10-04 14:36:35,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:35,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:35,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:35,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:35,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:38,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:38,116 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:38,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:38,176 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:38,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:38,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:38,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:38,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-04 14:36:38,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-04 14:36:38,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-04 14:36:38,379 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:38,380 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-10-04 14:36:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:38,569 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-04 14:36:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-04 14:36:38,569 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-10-04 14:36:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:38,570 INFO L225 Difference]: With dead ends: 93 [2018-10-04 14:36:38,570 INFO L226 Difference]: Without dead ends: 92 [2018-10-04 14:36:38,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.6s impTime 89 [2018-10-04 14:36:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-04 14:36:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-10-04 14:36:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-04 14:36:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-04 14:36:38,573 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-10-04 14:36:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:38,573 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-04 14:36:38,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-04 14:36:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-04 14:36:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-04 14:36:38,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:38,574 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-10-04 14:36:38,574 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:38,574 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364641, now seen corresponding path program 89 times [2018-10-04 14:36:38,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:38,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:38,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:38,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:38,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:41,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:41,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:41,428 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:41,511 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2018-10-04 14:36:41,512 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:41,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:41,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:41,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-10-04 14:36:41,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 14:36:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 14:36:41,695 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:41,695 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-10-04 14:36:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:42,180 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-04 14:36:42,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-04 14:36:42,180 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-10-04 14:36:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:42,181 INFO L225 Difference]: With dead ends: 94 [2018-10-04 14:36:42,181 INFO L226 Difference]: Without dead ends: 93 [2018-10-04 14:36:42,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.6s impTime 90 [2018-10-04 14:36:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-04 14:36:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-10-04 14:36:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 14:36:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-04 14:36:42,185 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-10-04 14:36:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:42,185 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-04 14:36:42,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 14:36:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-04 14:36:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-04 14:36:42,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:42,186 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-10-04 14:36:42,186 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:42,186 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:42,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663559, now seen corresponding path program 90 times [2018-10-04 14:36:42,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:42,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:42,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:42,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:42,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:45,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:45,836 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:45,844 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:46,021 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2018-10-04 14:36:46,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:46,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:46,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:46,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-10-04 14:36:46,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-04 14:36:46,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-04 14:36:46,198 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:46,198 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-10-04 14:36:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:46,443 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-04 14:36:46,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-04 14:36:46,444 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-10-04 14:36:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:46,445 INFO L225 Difference]: With dead ends: 95 [2018-10-04 14:36:46,445 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 14:36:46,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time 3.4s impTime 91 [2018-10-04 14:36:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 14:36:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-10-04 14:36:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-04 14:36:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-04 14:36:46,448 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-10-04 14:36:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:46,448 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-04 14:36:46,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-04 14:36:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-04 14:36:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-04 14:36:46,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:46,448 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-10-04 14:36:46,449 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:46,449 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930017, now seen corresponding path program 91 times [2018-10-04 14:36:46,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:46,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:46,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:46,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:46,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:49,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:49,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:49,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:50,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:50,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:50,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2018-10-04 14:36:50,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-04 14:36:50,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-04 14:36:50,209 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:50,209 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-10-04 14:36:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:50,463 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-04 14:36:50,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-04 14:36:50,463 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-10-04 14:36:50,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:50,464 INFO L225 Difference]: With dead ends: 96 [2018-10-04 14:36:50,464 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 14:36:50,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 3.2s impTime 92 [2018-10-04 14:36:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 14:36:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-04 14:36:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-04 14:36:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-04 14:36:50,467 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-10-04 14:36:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:50,467 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-04 14:36:50,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-04 14:36:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-04 14:36:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-04 14:36:50,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:50,468 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-10-04 14:36:50,468 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:50,468 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash 854092103, now seen corresponding path program 92 times [2018-10-04 14:36:50,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:50,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:50,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:53,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:53,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:53,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:53,080 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:53,080 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:53,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:53,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:53,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2018-10-04 14:36:53,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-04 14:36:53,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-04 14:36:53,266 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:53,266 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-10-04 14:36:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:53,430 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-04 14:36:53,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-04 14:36:53,431 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-10-04 14:36:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:53,431 INFO L225 Difference]: With dead ends: 97 [2018-10-04 14:36:53,432 INFO L226 Difference]: Without dead ends: 96 [2018-10-04 14:36:53,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.3s impTime 93 [2018-10-04 14:36:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-04 14:36:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-10-04 14:36:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 14:36:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-04 14:36:53,434 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-10-04 14:36:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:53,435 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-04 14:36:53,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-04 14:36:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-04 14:36:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-04 14:36:53,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:53,435 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-10-04 14:36:53,435 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:53,436 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash 707051361, now seen corresponding path program 93 times [2018-10-04 14:36:53,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:53,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:53,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:53,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:55,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:55,942 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:55,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:56,038 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-10-04 14:36:56,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:56,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:56,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:56,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2018-10-04 14:36:56,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-04 14:36:56,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-04 14:36:56,231 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:56,231 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-10-04 14:36:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:56,438 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-04 14:36:56,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-04 14:36:56,439 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-10-04 14:36:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:56,440 INFO L225 Difference]: With dead ends: 98 [2018-10-04 14:36:56,440 INFO L226 Difference]: Without dead ends: 97 [2018-10-04 14:36:56,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 2.3s impTime 94 [2018-10-04 14:36:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-04 14:36:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-10-04 14:36:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-04 14:36:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-04 14:36:56,443 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-10-04 14:36:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:56,444 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-04 14:36:56,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-04 14:36:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-04 14:36:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 14:36:56,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:56,445 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-10-04 14:36:56,445 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:56,445 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash 443755655, now seen corresponding path program 94 times [2018-10-04 14:36:56,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:56,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:56,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:56,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:56,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:00,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:00,304 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:00,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:00,372 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:00,372 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:00,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:00,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:00,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-10-04 14:37:00,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-04 14:37:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-04 14:37:00,572 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:00,572 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-10-04 14:37:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:00,825 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-04 14:37:00,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-04 14:37:00,825 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-10-04 14:37:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:00,826 INFO L225 Difference]: With dead ends: 99 [2018-10-04 14:37:00,826 INFO L226 Difference]: Without dead ends: 98 [2018-10-04 14:37:00,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.6s impTime 95 [2018-10-04 14:37:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-04 14:37:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-10-04 14:37:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 14:37:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-04 14:37:00,830 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-10-04 14:37:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:00,830 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-04 14:37:00,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-04 14:37:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-04 14:37:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 14:37:00,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:00,830 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-10-04 14:37:00,831 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:00,831 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:00,831 INFO L82 PathProgramCache]: Analyzing trace with hash 871523361, now seen corresponding path program 95 times [2018-10-04 14:37:00,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:00,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:00,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:00,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:00,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:03,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:03,467 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:03,475 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:03,564 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-04 14:37:03,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:03,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:03,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:03,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-10-04 14:37:03,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-04 14:37:03,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-04 14:37:03,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:03,841 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-10-04 14:37:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:04,028 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-04 14:37:04,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-04 14:37:04,028 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-10-04 14:37:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:04,029 INFO L225 Difference]: With dead ends: 100 [2018-10-04 14:37:04,029 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 14:37:04,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 2.4s impTime 96 [2018-10-04 14:37:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 14:37:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-04 14:37:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-04 14:37:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-04 14:37:04,032 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-10-04 14:37:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:04,033 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-04 14:37:04,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-04 14:37:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-04 14:37:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 14:37:04,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:04,034 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-10-04 14:37:04,034 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:04,034 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:04,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420359, now seen corresponding path program 96 times [2018-10-04 14:37:04,034 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:04,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:04,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:04,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:04,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:06,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:06,998 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:07,006 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:07,095 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 14:37:07,096 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:07,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:07,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:07,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-10-04 14:37:07,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-04 14:37:07,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-04 14:37:07,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:07,294 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-10-04 14:37:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:07,519 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-04 14:37:07,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-04 14:37:07,520 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-10-04 14:37:07,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:07,520 INFO L225 Difference]: With dead ends: 101 [2018-10-04 14:37:07,520 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 14:37:07,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.7s impTime 97 [2018-10-04 14:37:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 14:37:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-04 14:37:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 14:37:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-04 14:37:07,522 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-10-04 14:37:07,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:07,522 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-04 14:37:07,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-04 14:37:07,523 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-04 14:37:07,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 14:37:07,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:07,523 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-10-04 14:37:07,523 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:07,524 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:07,524 INFO L82 PathProgramCache]: Analyzing trace with hash 15325409, now seen corresponding path program 97 times [2018-10-04 14:37:07,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:07,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:07,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:07,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:07,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:11,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:11,702 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:11,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:11,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:11,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:11,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-10-04 14:37:11,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-04 14:37:11,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-04 14:37:11,963 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:11,963 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-10-04 14:37:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:12,241 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-04 14:37:12,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-04 14:37:12,242 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-10-04 14:37:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:12,243 INFO L225 Difference]: With dead ends: 102 [2018-10-04 14:37:12,243 INFO L226 Difference]: Without dead ends: 101 [2018-10-04 14:37:12,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s Time 3.9s impTime 98 [2018-10-04 14:37:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-04 14:37:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-04 14:37:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-04 14:37:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-04 14:37:12,246 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-10-04 14:37:12,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:12,246 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-04 14:37:12,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-04 14:37:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-04 14:37:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 14:37:12,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:12,247 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-10-04 14:37:12,247 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:12,247 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:12,247 INFO L82 PathProgramCache]: Analyzing trace with hash 475087623, now seen corresponding path program 98 times [2018-10-04 14:37:12,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:12,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:12,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:12,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:12,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:14,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:14,977 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:14,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:15,039 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:15,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:15,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:15,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:15,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-10-04 14:37:15,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-04 14:37:15,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-04 14:37:15,255 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:15,256 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-10-04 14:37:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:15,474 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-04 14:37:15,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-04 14:37:15,475 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-10-04 14:37:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:15,476 INFO L225 Difference]: With dead ends: 103 [2018-10-04 14:37:15,476 INFO L226 Difference]: Without dead ends: 102 [2018-10-04 14:37:15,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.4s impTime 99 [2018-10-04 14:37:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-04 14:37:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-10-04 14:37:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-04 14:37:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-04 14:37:15,479 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-10-04 14:37:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:15,479 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-04 14:37:15,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-04 14:37:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-04 14:37:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-04 14:37:15,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:15,480 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-10-04 14:37:15,480 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:15,480 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:15,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814369, now seen corresponding path program 99 times [2018-10-04 14:37:15,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:15,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:15,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:15,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:15,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:18,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:18,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:18,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:18,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-10-04 14:37:18,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:18,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:18,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:18,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-10-04 14:37:18,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-04 14:37:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-04 14:37:18,732 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:18,733 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-10-04 14:37:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:18,958 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-04 14:37:18,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-04 14:37:18,958 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-10-04 14:37:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:18,959 INFO L225 Difference]: With dead ends: 104 [2018-10-04 14:37:18,959 INFO L226 Difference]: Without dead ends: 103 [2018-10-04 14:37:18,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.7s impTime 100 [2018-10-04 14:37:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-04 14:37:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-04 14:37:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-04 14:37:18,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-04 14:37:18,963 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-10-04 14:37:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:18,963 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-04 14:37:18,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-04 14:37:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-04 14:37:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-04 14:37:18,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:18,964 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-10-04 14:37:18,964 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:18,964 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:18,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670535, now seen corresponding path program 100 times [2018-10-04 14:37:18,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:18,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:18,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:18,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:18,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:25,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:25,659 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:25,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:25,732 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:25,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:25,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:26,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:26,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-10-04 14:37:26,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-04 14:37:26,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-04 14:37:26,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:26,373 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-10-04 14:37:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:32,972 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-04 14:37:32,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-04 14:37:32,972 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-10-04 14:37:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:32,973 INFO L225 Difference]: With dead ends: 105 [2018-10-04 14:37:32,973 INFO L226 Difference]: Without dead ends: 104 [2018-10-04 14:37:32,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s Time 6.0s impTime 101 [2018-10-04 14:37:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-04 14:37:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-04 14:37:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-04 14:37:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-04 14:37:32,980 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-10-04 14:37:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:32,980 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-04 14:37:32,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-04 14:37:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-04 14:37:32,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-04 14:37:32,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:32,981 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-10-04 14:37:32,981 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:32,981 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080865, now seen corresponding path program 101 times [2018-10-04 14:37:32,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:32,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:32,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:32,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:32,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:36,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:37:36,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-10-04 14:37:36,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-04 14:37:36,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-04 14:37:36,399 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:36,399 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-10-04 14:37:36,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:36,662 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-04 14:37:36,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-04 14:37:36,662 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-10-04 14:37:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:36,663 INFO L225 Difference]: With dead ends: 104 [2018-10-04 14:37:36,663 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:37:36,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 2.6s impTime 102 [2018-10-04 14:37:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:37:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:37:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:37:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:37:36,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-10-04 14:37:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:36,666 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:37:36,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-04 14:37:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:37:36,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:37:36,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:37:36,857 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 613 [2018-10-04 14:37:41,589 WARN L178 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 613 DAG size of output: 610 [2018-10-04 14:37:41,598 INFO L425 ceAbstractionStarter]: For program point mainENTRY(lines 17 31) no Hoare annotation was computed. [2018-10-04 14:37:41,598 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 17 31) no Hoare annotation was computed. [2018-10-04 14:37:41,598 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 17 31) no Hoare annotation was computed. [2018-10-04 14:37:41,600 INFO L421 ceAbstractionStarter]: At program point L24-1(lines 24 27) the Hoare annotation is: (or (and (<= 8 main_y) (<= main_y 8) (<= main_x 8) (<= 8 main_x)) (and (<= main_x 49) (<= main_y 49) (<= 49 main_x) (<= 49 main_y)) (and (<= 99 main_x) (<= main_y 99) (<= 99 main_y) (<= main_x 99)) (and (<= 42 main_x) (<= main_y 42) (<= main_x 42) (<= 42 main_y)) (and (<= 9 main_y) (<= 9 main_x) (<= main_x 9) (<= main_y 9)) (and (<= 59 main_x) (<= 59 main_y) (<= main_y 59) (<= main_x 59)) (and (<= 55 main_y) (<= main_y 55) (<= 55 main_x) (<= main_x 55)) (and (<= 74 main_x) (<= main_x 74) (<= 74 main_y) (<= main_y 74)) (and (<= main_x 97) (<= 97 main_y) (<= main_y 97) (<= 97 main_x)) (and (<= 12 main_x) (<= 12 main_y) (<= main_y 12) (<= main_x 12)) (and (<= main_x 65) (<= main_y 65) (<= 65 main_x) (<= 65 main_y)) (and (<= 32 main_x) (<= main_x 32) (<= 32 main_y) (<= main_y 32)) (and (<= main_y 73) (<= main_x 73) (<= 73 main_x) (<= 73 main_y)) (and (<= 6 main_x) (<= main_x 6) (<= 6 main_y) (<= main_y 6)) (and (<= 14 main_x) (<= 14 main_y) (<= main_y 14) (<= main_x 14)) (and (<= main_x 0) (<= 0 main_y) (<= 0 main_x) (<= main_y 0)) (and (<= main_y 44) (<= main_x 44) (<= 44 main_y) (<= 44 main_x)) (and (<= 38 main_x) (<= 38 main_y) (<= main_y 38) (<= main_x 38)) (and (<= 43 main_x) (<= main_x 43) (<= main_y 43) (<= 43 main_y)) (and (<= 21 main_y) (<= 21 main_x) (<= main_x 21) (<= main_y 21)) (and (<= 94 main_x) (<= 94 main_y) (<= main_x 94) (<= main_y 94)) (and (<= 52 main_x) (<= 52 main_y) (<= main_y 52) (<= main_x 52)) (and (<= main_y 46) (<= 46 main_x) (<= main_x 46) (<= 46 main_y)) (and (<= main_x 18) (<= 18 main_y) (<= 18 main_x) (<= main_y 18)) (<= 101 main_x) (and (<= 61 main_y) (<= main_x 61) (<= main_y 61) (<= 61 main_x)) (and (<= 88 main_y) (<= main_y 88) (<= 88 main_x) (<= main_x 88)) (and (<= 80 main_y) (<= main_x 80) (<= main_y 80) (<= 80 main_x)) (and (<= main_x 92) (<= 92 main_y) (<= main_y 92) (<= 92 main_x)) (and (<= 87 main_x) (<= main_x 87) (<= 87 main_y) (<= main_y 87)) (and (<= 35 main_y) (<= main_y 35) (<= main_x 35) (<= 35 main_x)) (and (<= 85 main_x) (<= main_x 85) (<= 85 main_y) (<= main_y 85)) (and (<= 63 main_x) (<= 63 main_y) (<= main_y 63) (<= main_x 63)) (and (<= 15 main_y) (<= main_y 15) (<= 15 main_x) (<= main_x 15)) (and (<= main_y 64) (<= 64 main_x) (<= main_x 64) (<= 64 main_y)) (and (<= 4 main_y) (<= main_y 4) (<= main_x 4) (<= 4 main_x)) (and (<= 47 main_x) (<= 47 main_y) (<= main_y 47) (<= main_x 47)) (and (<= 51 main_y) (<= main_x 51) (<= 51 main_x) (<= main_y 51)) (and (<= 54 main_y) (<= main_y 54) (<= 54 main_x) (<= main_x 54)) (and (<= main_x 33) (<= 33 main_x) (<= main_y 33) (<= 33 main_y)) (and (<= 37 main_x) (<= 37 main_y) (<= main_y 37) (<= main_x 37)) (and (<= 20 main_y) (<= 20 main_x) (<= main_y 20) (<= main_x 20)) (and (<= 26 main_y) (<= main_x 26) (<= 26 main_x) (<= main_y 26)) (and (<= 86 main_x) (<= 86 main_y) (<= main_x 86) (<= main_y 86)) (and (<= main_x 27) (<= main_y 27) (<= 27 main_y) (<= 27 main_x)) (and (<= main_y 95) (<= 95 main_x) (<= 95 main_y) (<= main_x 95)) (and (<= 1 main_x) (<= main_x 1) (<= main_y 1) (<= 1 main_y)) (and (<= main_x 56) (<= 56 main_x) (<= 56 main_y) (<= main_y 56)) (and (<= main_y 75) (<= main_x 75) (<= 75 main_y) (<= 75 main_x)) (and (<= 68 main_y) (<= main_x 68) (<= main_y 68) (<= 68 main_x)) (and (<= main_x 62) (<= 62 main_x) (<= 62 main_y) (<= main_y 62)) (and (<= main_y 78) (<= 78 main_x) (<= 78 main_y) (<= main_x 78)) (and (<= main_y 3) (<= 3 main_y) (<= 3 main_x) (<= main_x 3)) (and (<= main_x 25) (<= main_y 25) (<= 25 main_x) (<= 25 main_y)) (and (<= main_x 36) (<= main_y 36) (<= 36 main_x) (<= 36 main_y)) (and (<= 57 main_y) (<= main_x 57) (<= main_y 57) (<= 57 main_x)) (and (<= 5 main_x) (<= main_x 5) (<= main_y 5) (<= 5 main_y)) (and (<= 82 main_x) (<= 82 main_y) (<= main_x 82) (<= main_y 82)) (and (<= main_y 17) (<= 17 main_y) (<= 17 main_x) (<= main_x 17)) (and (<= main_y 83) (<= 83 main_x) (<= main_x 83) (<= 83 main_y)) (and (<= 77 main_x) (<= 77 main_y) (<= main_x 77) (<= main_y 77)) (and (<= 31 main_x) (<= 31 main_y) (<= main_y 31) (<= main_x 31)) (and (<= main_y 98) (<= main_x 98) (<= 98 main_y) (<= 98 main_x)) (and (<= 71 main_y) (<= 71 main_x) (<= main_y 71) (<= main_x 71)) (and (<= main_y 41) (<= 41 main_x) (<= 41 main_y) (<= main_x 41)) (and (<= 30 main_x) (<= 30 main_y) (<= main_x 30) (<= main_y 30)) (and (<= 24 main_y) (<= main_x 24) (<= main_y 24) (<= 24 main_x)) (and (<= main_y 50) (<= 50 main_y) (<= main_x 50) (<= 50 main_x)) (and (<= 84 main_y) (<= main_y 84) (<= main_x 84) (<= 84 main_x)) (and (<= main_y 93) (<= 93 main_y) (<= 93 main_x) (<= main_x 93)) (and (<= main_y 60) (<= main_x 60) (<= 60 main_y) (<= 60 main_x)) (and (<= 29 main_y) (<= main_x 29) (<= 29 main_x) (<= main_y 29)) (and (<= main_y 40) (<= main_x 40) (<= 40 main_y) (<= 40 main_x)) (and (<= main_y 53) (<= 53 main_y) (<= main_x 53) (<= 53 main_x)) (and (<= main_y 58) (<= 58 main_y) (<= 58 main_x) (<= main_x 58)) (and (<= 67 main_x) (<= 67 main_y) (<= main_y 67) (<= main_x 67)) (and (<= main_y 22) (<= main_x 22) (<= 22 main_x) (<= 22 main_y)) (and (<= 39 main_y) (<= 39 main_x) (<= main_x 39) (<= main_y 39)) (and (<= 13 main_x) (<= main_x 13) (<= main_y 13) (<= 13 main_y)) (and (<= main_y 100) (< 99 main_y) (<= 100 main_x)) (and (<= main_y 79) (<= 79 main_x) (<= main_x 79) (<= 79 main_y)) (and (<= 69 main_x) (<= main_x 69) (<= 69 main_y) (<= main_y 69)) (and (<= 81 main_x) (<= main_y 81) (<= main_x 81) (<= 81 main_y)) (and (<= 28 main_y) (<= main_x 28) (<= 28 main_x) (<= main_y 28)) (and (<= main_x 91) (<= 91 main_y) (<= 91 main_x) (<= main_y 91)) (and (<= main_y 66) (<= main_x 66) (<= 66 main_x) (<= 66 main_y)) (and (<= 34 main_x) (<= main_y 34) (<= main_x 34) (<= 34 main_y)) (and (<= 89 main_x) (<= main_y 89) (<= main_x 89) (<= 89 main_y)) (and (<= 10 main_y) (<= main_x 10) (<= main_y 10) (<= 10 main_x)) (and (<= main_x 16) (<= main_y 16) (<= 16 main_x) (<= 16 main_y)) (and (<= 2 main_y) (<= 2 main_x) (<= main_y 2) (<= main_x 2)) (and (<= main_x 7) (<= 7 main_y) (<= 7 main_x) (<= main_y 7)) (and (<= main_x 72) (<= 72 main_x) (<= 72 main_y) (<= main_y 72)) (and (<= 48 main_x) (<= main_x 48) (<= main_y 48) (<= 48 main_y)) (and (<= main_y 76) (<= main_x 76) (<= 76 main_y) (<= 76 main_x)) (and (<= 96 main_x) (<= main_y 96) (<= 96 main_y) (<= main_x 96)) (and (<= 45 main_x) (<= 45 main_y) (<= main_y 45) (<= main_x 45)) (and (<= 11 main_x) (<= main_x 11) (<= 11 main_y) (<= main_y 11)) (and (<= 90 main_x) (<= main_y 90) (<= 90 main_y) (<= main_x 90)) (and (<= main_x 19) (<= main_y 19) (<= 19 main_x) (<= 19 main_y)) (and (<= main_x 70) (<= main_y 70) (<= 70 main_x) (<= 70 main_y)) (and (<= 23 main_x) (<= 23 main_y) (<= main_y 23) (<= main_x 23))) [2018-10-04 14:37:41,600 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 29) no Hoare annotation was computed. [2018-10-04 14:37:41,642 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:37:41 BoogieIcfgContainer [2018-10-04 14:37:41,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:37:41,648 INFO L168 Benchmark]: Toolchain (without parser) took 199565.08 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 13.1 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 64.9 MB). Peak memory consumption was 594.2 MB. Max. memory is 7.1 GB. [2018-10-04 14:37:41,649 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:37:41,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:37:41,650 INFO L168 Benchmark]: Boogie Preprocessor took 24.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:37:41,650 INFO L168 Benchmark]: RCFGBuilder took 290.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:37:41,651 INFO L168 Benchmark]: TraceAbstraction took 199192.28 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 13.1 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 43.7 MB). Peak memory consumption was 573.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:37:41,654 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 290.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 199192.28 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 13.1 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 43.7 MB). Peak memory consumption was 573.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((8 <= y && y <= 8) && x <= 8) && 8 <= x) || (((x <= 49 && y <= 49) && 49 <= x) && 49 <= y)) || (((99 <= x && y <= 99) && 99 <= y) && x <= 99)) || (((42 <= x && y <= 42) && x <= 42) && 42 <= y)) || (((9 <= y && 9 <= x) && x <= 9) && y <= 9)) || (((59 <= x && 59 <= y) && y <= 59) && x <= 59)) || (((55 <= y && y <= 55) && 55 <= x) && x <= 55)) || (((74 <= x && x <= 74) && 74 <= y) && y <= 74)) || (((x <= 97 && 97 <= y) && y <= 97) && 97 <= x)) || (((12 <= x && 12 <= y) && y <= 12) && x <= 12)) || (((x <= 65 && y <= 65) && 65 <= x) && 65 <= y)) || (((32 <= x && x <= 32) && 32 <= y) && y <= 32)) || (((y <= 73 && x <= 73) && 73 <= x) && 73 <= y)) || (((6 <= x && x <= 6) && 6 <= y) && y <= 6)) || (((14 <= x && 14 <= y) && y <= 14) && x <= 14)) || (((x <= 0 && 0 <= y) && 0 <= x) && y <= 0)) || (((y <= 44 && x <= 44) && 44 <= y) && 44 <= x)) || (((38 <= x && 38 <= y) && y <= 38) && x <= 38)) || (((43 <= x && x <= 43) && y <= 43) && 43 <= y)) || (((21 <= y && 21 <= x) && x <= 21) && y <= 21)) || (((94 <= x && 94 <= y) && x <= 94) && y <= 94)) || (((52 <= x && 52 <= y) && y <= 52) && x <= 52)) || (((y <= 46 && 46 <= x) && x <= 46) && 46 <= y)) || (((x <= 18 && 18 <= y) && 18 <= x) && y <= 18)) || 101 <= x) || (((61 <= y && x <= 61) && y <= 61) && 61 <= x)) || (((88 <= y && y <= 88) && 88 <= x) && x <= 88)) || (((80 <= y && x <= 80) && y <= 80) && 80 <= x)) || (((x <= 92 && 92 <= y) && y <= 92) && 92 <= x)) || (((87 <= x && x <= 87) && 87 <= y) && y <= 87)) || (((35 <= y && y <= 35) && x <= 35) && 35 <= x)) || (((85 <= x && x <= 85) && 85 <= y) && y <= 85)) || (((63 <= x && 63 <= y) && y <= 63) && x <= 63)) || (((15 <= y && y <= 15) && 15 <= x) && x <= 15)) || (((y <= 64 && 64 <= x) && x <= 64) && 64 <= y)) || (((4 <= y && y <= 4) && x <= 4) && 4 <= x)) || (((47 <= x && 47 <= y) && y <= 47) && x <= 47)) || (((51 <= y && x <= 51) && 51 <= x) && y <= 51)) || (((54 <= y && y <= 54) && 54 <= x) && x <= 54)) || (((x <= 33 && 33 <= x) && y <= 33) && 33 <= y)) || (((37 <= x && 37 <= y) && y <= 37) && x <= 37)) || (((20 <= y && 20 <= x) && y <= 20) && x <= 20)) || (((26 <= y && x <= 26) && 26 <= x) && y <= 26)) || (((86 <= x && 86 <= y) && x <= 86) && y <= 86)) || (((x <= 27 && y <= 27) && 27 <= y) && 27 <= x)) || (((y <= 95 && 95 <= x) && 95 <= y) && x <= 95)) || (((1 <= x && x <= 1) && y <= 1) && 1 <= y)) || (((x <= 56 && 56 <= x) && 56 <= y) && y <= 56)) || (((y <= 75 && x <= 75) && 75 <= y) && 75 <= x)) || (((68 <= y && x <= 68) && y <= 68) && 68 <= x)) || (((x <= 62 && 62 <= x) && 62 <= y) && y <= 62)) || (((y <= 78 && 78 <= x) && 78 <= y) && x <= 78)) || (((y <= 3 && 3 <= y) && 3 <= x) && x <= 3)) || (((x <= 25 && y <= 25) && 25 <= x) && 25 <= y)) || (((x <= 36 && y <= 36) && 36 <= x) && 36 <= y)) || (((57 <= y && x <= 57) && y <= 57) && 57 <= x)) || (((5 <= x && x <= 5) && y <= 5) && 5 <= y)) || (((82 <= x && 82 <= y) && x <= 82) && y <= 82)) || (((y <= 17 && 17 <= y) && 17 <= x) && x <= 17)) || (((y <= 83 && 83 <= x) && x <= 83) && 83 <= y)) || (((77 <= x && 77 <= y) && x <= 77) && y <= 77)) || (((31 <= x && 31 <= y) && y <= 31) && x <= 31)) || (((y <= 98 && x <= 98) && 98 <= y) && 98 <= x)) || (((71 <= y && 71 <= x) && y <= 71) && x <= 71)) || (((y <= 41 && 41 <= x) && 41 <= y) && x <= 41)) || (((30 <= x && 30 <= y) && x <= 30) && y <= 30)) || (((24 <= y && x <= 24) && y <= 24) && 24 <= x)) || (((y <= 50 && 50 <= y) && x <= 50) && 50 <= x)) || (((84 <= y && y <= 84) && x <= 84) && 84 <= x)) || (((y <= 93 && 93 <= y) && 93 <= x) && x <= 93)) || (((y <= 60 && x <= 60) && 60 <= y) && 60 <= x)) || (((29 <= y && x <= 29) && 29 <= x) && y <= 29)) || (((y <= 40 && x <= 40) && 40 <= y) && 40 <= x)) || (((y <= 53 && 53 <= y) && x <= 53) && 53 <= x)) || (((y <= 58 && 58 <= y) && 58 <= x) && x <= 58)) || (((67 <= x && 67 <= y) && y <= 67) && x <= 67)) || (((y <= 22 && x <= 22) && 22 <= x) && 22 <= y)) || (((39 <= y && 39 <= x) && x <= 39) && y <= 39)) || (((13 <= x && x <= 13) && y <= 13) && 13 <= y)) || ((y <= 100 && 99 < y) && 100 <= x)) || (((y <= 79 && 79 <= x) && x <= 79) && 79 <= y)) || (((69 <= x && x <= 69) && 69 <= y) && y <= 69)) || (((81 <= x && y <= 81) && x <= 81) && 81 <= y)) || (((28 <= y && x <= 28) && 28 <= x) && y <= 28)) || (((x <= 91 && 91 <= y) && 91 <= x) && y <= 91)) || (((y <= 66 && x <= 66) && 66 <= x) && 66 <= y)) || (((34 <= x && y <= 34) && x <= 34) && 34 <= y)) || (((89 <= x && y <= 89) && x <= 89) && 89 <= y)) || (((10 <= y && x <= 10) && y <= 10) && 10 <= x)) || (((x <= 16 && y <= 16) && 16 <= x) && 16 <= y)) || (((2 <= y && 2 <= x) && y <= 2) && x <= 2)) || (((x <= 7 && 7 <= y) && 7 <= x) && y <= 7)) || (((x <= 72 && 72 <= x) && 72 <= y) && y <= 72)) || (((48 <= x && x <= 48) && y <= 48) && 48 <= y)) || (((y <= 76 && x <= 76) && 76 <= y) && 76 <= x)) || (((96 <= x && y <= 96) && 96 <= y) && x <= 96)) || (((45 <= x && 45 <= y) && y <= 45) && x <= 45)) || (((11 <= x && x <= 11) && 11 <= y) && y <= 11)) || (((90 <= x && y <= 90) && 90 <= y) && x <= 90)) || (((x <= 19 && y <= 19) && 19 <= x) && 19 <= y)) || (((x <= 70 && y <= 70) && 70 <= x) && 70 <= y)) || (((23 <= x && 23 <= y) && y <= 23) && x <= 23) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 199.0s OverallTime, 102 OverallIterations, 101 TraceHistogramMax, 20.6s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 19537 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10403 GetRequests, 5148 SyntacticMatches, 2 SemanticMatches, 5253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 159.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 102 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1314 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 163.1s InterpolantComputationTime, 10605 NumberOfCodeBlocks, 10605 NumberOfCodeBlocksAsserted, 1494 NumberOfCheckSat, 10403 ConstructedInterpolants, 0 QuantifiedInterpolants, 2205739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 21100 ConjunctsInSsa, 5351 ConjunctsInUnsatCore, 202 InterpolantComputations, 2 PerfectInterpolantSequences, 5151/348551 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEquality-Safe.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-37-41-676.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEquality-Safe.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-37-41-676.csv Received shutdown request...