java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:24:56,842 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:24:56,844 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:24:56,855 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:24:56,855 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:24:56,856 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:24:56,858 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:24:56,859 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:24:56,861 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:24:56,862 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:24:56,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:24:56,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:24:56,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:24:56,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:24:56,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:24:56,867 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:24:56,868 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:24:56,869 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:24:56,871 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:24:56,873 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:24:56,874 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:24:56,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:24:56,878 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:24:56,878 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:24:56,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:24:56,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:24:56,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:24:56,881 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:24:56,882 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:24:56,883 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:24:56,883 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:24:56,884 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:24:56,884 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:24:56,884 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:24:56,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:24:56,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:24:56,886 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:24:56,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:24:56,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:24:56,914 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:24:56,914 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:24:56,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:24:56,915 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:24:56,915 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:24:56,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:24:56,915 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:24:56,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:24:56,916 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:24:56,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:24:56,916 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:24:56,916 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:24:56,917 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:24:56,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:24:56,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:24:56,917 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:24:56,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:24:56,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:24:56,918 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:24:56,918 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:24:56,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:24:56,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:24:56,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:24:56,919 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:24:56,919 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:24:56,919 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:24:56,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:24:56,919 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:24:56,920 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:24:56,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:24:56,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:24:56,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:24:56,999 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:24:56,999 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:24:57,000 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-10-04 14:24:57,001 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-10-04 14:24:57,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:24:57,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:24:57,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:24:57,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:24:57,081 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:24:57,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:24:57,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:24:57,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:24:57,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:24:57,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/1) ... [2018-10-04 14:24:57,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:24:57,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:24:57,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:24:57,152 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:24:57,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (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:24:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:24:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:24:57,458 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:24:57,459 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:24:57 BoogieIcfgContainer [2018-10-04 14:24:57,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:24:57,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:24:57,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:24:57,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:24:57,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:57" (1/2) ... [2018-10-04 14:24:57,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5927b831 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:24:57, skipping insertion in model container [2018-10-04 14:24:57,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:24:57" (2/2) ... [2018-10-04 14:24:57,468 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-10-04 14:24:57,478 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:24:57,486 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:24:57,536 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:24:57,537 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:24:57,537 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:24:57,538 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:24:57,538 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:24:57,538 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:24:57,538 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:24:57,538 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:24:57,539 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:24:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-04 14:24:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:24:57,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:57,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 14:24:57,565 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:57,576 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:57,576 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-10-04 14:24:57,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:57,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:57,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:57,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:57,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:57,720 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:24:57,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:24:57,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:24:57,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:24:57,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:24:57,739 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:57,741 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-10-04 14:24:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:57,826 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-10-04 14:24:57,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:24:57,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-10-04 14:24:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:57,845 INFO L225 Difference]: With dead ends: 17 [2018-10-04 14:24:57,845 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 14:24:57,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:24:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 14:24:57,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 14:24:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 14:24:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-10-04 14:24:57,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2018-10-04 14:24:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:57,896 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-04 14:24:57,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:24:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-04 14:24:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:24:57,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:57,897 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:24:57,897 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:57,898 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:57,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-10-04 14:24:57,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:57,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:57,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:57,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:57,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:24:57,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:57,986 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:24:58,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:58,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:24:58,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:58,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 14:24:58,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:24:58,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:24:58,169 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:58,169 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-10-04 14:24:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:58,234 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-10-04 14:24:58,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:24:58,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-04 14:24:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:58,235 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:24:58,235 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:24:58,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 14:24:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:24:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 14:24:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 14:24:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-10-04 14:24:58,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-10-04 14:24:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:58,243 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-10-04 14:24:58,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:24:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-04 14:24:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:24:58,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:58,244 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-10-04 14:24:58,244 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:58,245 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:58,245 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 2 times [2018-10-04 14:24:58,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:58,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:58,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:58,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:58,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 14:24:58,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:58,377 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:58,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:58,431 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:58,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:58,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 14:24:58,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:58,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:24:58,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:24:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:24:58,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:58,498 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-10-04 14:24:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:58,624 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-10-04 14:24:58,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:24:58,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-04 14:24:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:58,626 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:24:58,626 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:24:58,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:24:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:24:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 14:24:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 14:24:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-10-04 14:24:58,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-10-04 14:24:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:58,633 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-04 14:24:58,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:24:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-04 14:24:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:24:58,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:58,634 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-10-04 14:24:58,634 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:58,635 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:58,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 3 times [2018-10-04 14:24:58,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:58,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:58,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:58,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:58,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 14:24:58,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:58,829 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) [2018-10-04 14:24:58,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:58,916 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 14:24:58,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:58,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 14:24:59,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:59,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:24:59,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:24:59,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:24:59,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:59,057 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-10-04 14:24:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:59,117 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-10-04 14:24:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:24:59,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-04 14:24:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:59,119 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:24:59,119 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:24:59,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 4 [2018-10-04 14:24:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:24:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 14:24:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 14:24:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-04 14:24:59,127 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-10-04 14:24:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:59,127 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-04 14:24:59,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:24:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-04 14:24:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:24:59,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:59,130 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-10-04 14:24:59,130 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:59,130 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:59,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 4 times [2018-10-04 14:24:59,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:59,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 14:24:59,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:59,281 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:24:59,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:59,313 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:59,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:59,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 14:24:59,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:59,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:24:59,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:24:59,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:24:59,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:59,411 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-10-04 14:24:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:59,489 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-10-04 14:24:59,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:24:59,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-04 14:24:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:59,490 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:24:59,490 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:24:59,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:24:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:24:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 14:24:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 14:24:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-10-04 14:24:59,497 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-10-04 14:24:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:59,497 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-10-04 14:24:59,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:24:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-04 14:24:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 14:24:59,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:59,498 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-10-04 14:24:59,499 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:59,499 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 5 times [2018-10-04 14:24:59,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:59,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:59,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 14:24:59,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:59,618 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:24:59,627 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:59,727 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:24:59,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:59,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 14:24:59,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:59,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:24:59,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:24:59,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:24:59,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:59,824 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-10-04 14:24:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:59,990 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-04 14:24:59,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:24:59,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-04 14:24:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:59,992 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:24:59,992 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:24:59,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:24:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:24:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 14:24:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:24:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-04 14:24:59,999 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2018-10-04 14:24:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:59,999 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-04 14:24:59,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:24:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-04 14:25:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:25:00,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:00,001 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-10-04 14:25:00,001 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:00,001 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 6 times [2018-10-04 14:25:00,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:00,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:00,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:00,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-04 14:25:00,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:00,253 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:00,268 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:00,388 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:25:00,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:00,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-04 14:25:00,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:00,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:25:00,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:25:00,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:25:00,763 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:00,763 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2018-10-04 14:25:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:00,821 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-10-04 14:25:00,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:25:00,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-04 14:25:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:00,822 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:25:00,822 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:25:00,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.0s impTime 7 [2018-10-04 14:25:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:25:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 14:25:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:25:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-10-04 14:25:00,829 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-10-04 14:25:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:00,829 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-10-04 14:25:00,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:25:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-10-04 14:25:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:25:00,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:00,831 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-10-04 14:25:00,831 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:00,832 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 7 times [2018-10-04 14:25:00,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:00,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-04 14:25:01,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:01,045 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:25:01,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:01,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-04 14:25:01,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:01,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:25:01,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:25:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:25:01,169 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:01,169 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2018-10-04 14:25:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:01,266 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-10-04 14:25:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:25:01,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-10-04 14:25:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:01,267 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:25:01,267 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:25:01,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:25:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:25:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 14:25:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 14:25:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-04 14:25:01,275 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-10-04 14:25:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:01,275 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-04 14:25:01,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:25:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-04 14:25:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 14:25:01,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:01,277 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-10-04 14:25:01,277 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:01,277 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:01,278 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 8 times [2018-10-04 14:25:01,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:01,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:01,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:01,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:01,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 14:25:01,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:01,478 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:25:01,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:01,516 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:01,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:01,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 14:25:01,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:01,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:25:01,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:25:01,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:25:01,644 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:01,644 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-10-04 14:25:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:01,840 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-10-04 14:25:01,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:25:01,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-10-04 14:25:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:01,846 INFO L225 Difference]: With dead ends: 63 [2018-10-04 14:25:01,846 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:25:01,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 14:25:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:25:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 14:25:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 14:25:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-04 14:25:01,853 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2018-10-04 14:25:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:01,854 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-04 14:25:01,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:25:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-04 14:25:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 14:25:01,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:01,856 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-10-04 14:25:01,856 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:01,857 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 9 times [2018-10-04 14:25:01,857 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:01,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:01,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:01,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-04 14:25:02,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:02,089 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:25:02,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:02,240 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 14:25:02,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:02,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-04 14:25:02,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:02,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:25:02,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:25:02,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:25:02,456 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:02,456 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 12 states. [2018-10-04 14:25:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:02,529 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-10-04 14:25:02,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:25:02,530 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-10-04 14:25:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:02,530 INFO L225 Difference]: With dead ends: 69 [2018-10-04 14:25:02,530 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:25:02,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 10 [2018-10-04 14:25:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:25:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 14:25:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 14:25:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-10-04 14:25:02,537 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2018-10-04 14:25:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:02,538 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-10-04 14:25:02,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:25:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-10-04 14:25:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 14:25:02,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:02,539 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-10-04 14:25:02,539 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:02,539 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 10 times [2018-10-04 14:25:02,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:02,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:02,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:02,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-04 14:25:02,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:02,699 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:25:02,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:02,741 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:02,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:02,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-04 14:25:02,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:02,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 14:25:02,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:25:02,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:25:02,858 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:02,858 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2018-10-04 14:25:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:02,938 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-10-04 14:25:02,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:25:02,939 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-10-04 14:25:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:02,940 INFO L225 Difference]: With dead ends: 75 [2018-10-04 14:25:02,940 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:25:02,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-04 14:25:02,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:25:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 14:25:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 14:25:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-10-04 14:25:02,947 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-10-04 14:25:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:02,947 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-10-04 14:25:02,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:25:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-10-04 14:25:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 14:25:02,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:02,949 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-10-04 14:25:02,949 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:02,949 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 11 times [2018-10-04 14:25:02,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:02,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:02,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:02,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:02,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-04 14:25:03,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:03,133 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:25:03,143 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:03,183 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 14:25:03,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:03,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-04 14:25:03,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:03,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:25:03,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:25:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:25:03,300 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:03,301 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 14 states. [2018-10-04 14:25:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:03,368 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-10-04 14:25:03,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:25:03,369 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-10-04 14:25:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:03,372 INFO L225 Difference]: With dead ends: 81 [2018-10-04 14:25:03,373 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:25:03,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 12 [2018-10-04 14:25:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:25:03,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 14:25:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 14:25:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-10-04 14:25:03,380 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-10-04 14:25:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:03,380 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-10-04 14:25:03,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:25:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-10-04 14:25:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 14:25:03,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:03,382 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-10-04 14:25:03,382 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:03,382 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 12 times [2018-10-04 14:25:03,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:03,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:03,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:03,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:03,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-04 14:25:03,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:03,617 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:25:03,625 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:03,674 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 14:25:03,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:03,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-04 14:25:03,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:03,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:25:03,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:25:03,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:25:03,808 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:03,808 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2018-10-04 14:25:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:03,995 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-10-04 14:25:03,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:25:03,995 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-10-04 14:25:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:03,996 INFO L225 Difference]: With dead ends: 87 [2018-10-04 14:25:03,996 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:25:03,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 14:25:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:25:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 14:25:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 14:25:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-10-04 14:25:04,002 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-10-04 14:25:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:04,002 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-10-04 14:25:04,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:25:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-10-04 14:25:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:25:04,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:04,003 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-10-04 14:25:04,004 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:04,004 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 13 times [2018-10-04 14:25:04,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:04,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:04,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-04 14:25:04,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:04,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 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:25:04,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:04,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-04 14:25:04,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:04,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:25:04,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:25:04,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:25:04,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:04,391 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 16 states. [2018-10-04 14:25:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:04,574 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-10-04 14:25:04,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:25:04,575 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-10-04 14:25:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:04,576 INFO L225 Difference]: With dead ends: 93 [2018-10-04 14:25:04,576 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:25:04,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 14:25:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:25:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 14:25:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 14:25:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-10-04 14:25:04,585 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2018-10-04 14:25:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:04,585 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-10-04 14:25:04,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:25:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-10-04 14:25:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 14:25:04,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:04,586 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-10-04 14:25:04,587 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:04,587 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:04,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 14 times [2018-10-04 14:25:04,587 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:04,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:04,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:04,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:04,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-04 14:25:04,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:04,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 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:25:05,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:05,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:05,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:05,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-04 14:25:05,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:05,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:25:05,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:25:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:25:05,130 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:05,130 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 17 states. [2018-10-04 14:25:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:05,203 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-10-04 14:25:05,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:25:05,204 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-10-04 14:25:05,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:05,205 INFO L225 Difference]: With dead ends: 99 [2018-10-04 14:25:05,205 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 14:25:05,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 15 [2018-10-04 14:25:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 14:25:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-04 14:25:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 14:25:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-10-04 14:25:05,212 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-10-04 14:25:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:05,212 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-10-04 14:25:05,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:25:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-10-04 14:25:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 14:25:05,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:05,213 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-10-04 14:25:05,214 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:05,214 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 15 times [2018-10-04 14:25:05,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:05,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:05,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:05,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:05,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-04 14:25:05,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:05,451 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:25:05,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:05,557 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 14:25:05,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:05,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-04 14:25:05,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:05,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:25:05,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:25:05,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:25:05,722 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:05,722 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 18 states. [2018-10-04 14:25:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:06,077 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-10-04 14:25:06,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:25:06,078 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-10-04 14:25:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:06,079 INFO L225 Difference]: With dead ends: 105 [2018-10-04 14:25:06,079 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 14:25:06,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-04 14:25:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 14:25:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 14:25:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 14:25:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-04 14:25:06,086 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-10-04 14:25:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:06,087 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-04 14:25:06,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:25:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-04 14:25:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 14:25:06,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:06,088 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-10-04 14:25:06,088 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:06,089 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:06,089 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 16 times [2018-10-04 14:25:06,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:06,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:06,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:06,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:06,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-04 14:25:06,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:06,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 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:25:06,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:06,425 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:06,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:06,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-04 14:25:06,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:06,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 14:25:06,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:25:06,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:25:06,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:06,560 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 19 states. [2018-10-04 14:25:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:06,629 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-10-04 14:25:06,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:25:06,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-10-04 14:25:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:06,630 INFO L225 Difference]: With dead ends: 111 [2018-10-04 14:25:06,630 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 14:25:06,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 17 [2018-10-04 14:25:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 14:25:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-04 14:25:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 14:25:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-10-04 14:25:06,636 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-10-04 14:25:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:06,636 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-10-04 14:25:06,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:25:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-10-04 14:25:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 14:25:06,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:06,637 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-10-04 14:25:06,638 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:06,638 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:06,638 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 17 times [2018-10-04 14:25:06,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:06,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:06,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:06,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:06,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-04 14:25:07,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:07,008 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:25:07,016 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:07,088 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 14:25:07,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:07,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-04 14:25:07,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:07,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:25:07,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:25:07,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:25:07,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:07,411 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2018-10-04 14:25:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:07,772 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-10-04 14:25:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:25:07,772 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-10-04 14:25:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:07,774 INFO L225 Difference]: With dead ends: 117 [2018-10-04 14:25:07,774 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 14:25:07,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 18 [2018-10-04 14:25:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 14:25:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-04 14:25:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 14:25:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-10-04 14:25:07,780 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-10-04 14:25:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:07,780 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-10-04 14:25:07,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:25:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-10-04 14:25:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 14:25:07,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:07,781 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-10-04 14:25:07,782 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:07,782 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:07,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 18 times [2018-10-04 14:25:07,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:07,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:07,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:07,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:07,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:08,572 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-04 14:25:08,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:08,573 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:25:08,580 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:08,644 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 14:25:08,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:08,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-04 14:25:08,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:08,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 14:25:08,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:25:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:25:08,757 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:08,758 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 21 states. [2018-10-04 14:25:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:08,831 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-10-04 14:25:08,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:25:08,831 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-10-04 14:25:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:08,832 INFO L225 Difference]: With dead ends: 123 [2018-10-04 14:25:08,832 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 14:25:08,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 19 [2018-10-04 14:25:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 14:25:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 14:25:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 14:25:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-10-04 14:25:08,838 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2018-10-04 14:25:08,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:08,838 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-10-04 14:25:08,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:25:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-10-04 14:25:08,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-04 14:25:08,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:08,840 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-10-04 14:25:08,840 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:08,840 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:08,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 19 times [2018-10-04 14:25:08,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:08,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:08,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:08,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-04 14:25:09,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:09,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 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:25:09,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:09,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-04 14:25:09,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:09,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 14:25:09,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:25:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:25:09,856 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:09,857 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 22 states. [2018-10-04 14:25:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:09,945 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-04 14:25:09,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:25:09,946 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-10-04 14:25:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:09,947 INFO L225 Difference]: With dead ends: 129 [2018-10-04 14:25:09,947 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 14:25:09,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 20 [2018-10-04 14:25:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 14:25:09,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 14:25:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 14:25:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-10-04 14:25:09,953 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-10-04 14:25:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:09,953 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-10-04 14:25:09,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:25:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-10-04 14:25:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 14:25:09,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:09,955 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-10-04 14:25:09,955 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:09,955 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 20 times [2018-10-04 14:25:09,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:09,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:09,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:09,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-04 14:25:10,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:10,409 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:25:10,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:10,469 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:10,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:10,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-04 14:25:10,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:10,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:25:10,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:25:10,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:25:10,598 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:10,599 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 23 states. [2018-10-04 14:25:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:10,670 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-10-04 14:25:10,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:25:10,670 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-10-04 14:25:10,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:10,671 INFO L225 Difference]: With dead ends: 135 [2018-10-04 14:25:10,671 INFO L226 Difference]: Without dead ends: 91 [2018-10-04 14:25:10,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 21 [2018-10-04 14:25:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-04 14:25:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-04 14:25:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 14:25:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-04 14:25:10,676 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-10-04 14:25:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:10,676 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-04 14:25:10,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:25:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-04 14:25:10,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 14:25:10,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:10,677 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-10-04 14:25:10,678 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:10,678 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 21 times [2018-10-04 14:25:10,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:10,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:10,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-04 14:25:11,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:11,180 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:25:11,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:11,407 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 14:25:11,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:11,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-04 14:25:11,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:11,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:25:11,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:25:11,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:25:11,571 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:11,572 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 24 states. [2018-10-04 14:25:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:11,668 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-10-04 14:25:11,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:25:11,669 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-10-04 14:25:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:11,670 INFO L225 Difference]: With dead ends: 141 [2018-10-04 14:25:11,670 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 14:25:11,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 22 [2018-10-04 14:25:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 14:25:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-04 14:25:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-04 14:25:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-10-04 14:25:11,674 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 90 [2018-10-04 14:25:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:11,675 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-10-04 14:25:11,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:25:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-10-04 14:25:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-04 14:25:11,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:11,676 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-10-04 14:25:11,676 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:11,676 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 22 times [2018-10-04 14:25:11,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:11,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:11,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:11,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-10-04 14:25:12,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:12,045 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:25:12,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:12,111 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:12,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:12,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-10-04 14:25:12,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:12,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 14:25:12,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 14:25:12,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 14:25:12,284 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:12,284 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 25 states. [2018-10-04 14:25:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:12,373 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2018-10-04 14:25:12,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:25:12,374 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-10-04 14:25:12,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:12,375 INFO L225 Difference]: With dead ends: 147 [2018-10-04 14:25:12,375 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 14:25:12,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 23 [2018-10-04 14:25:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 14:25:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-04 14:25:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-04 14:25:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-10-04 14:25:12,380 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2018-10-04 14:25:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:12,380 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-10-04 14:25:12,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 14:25:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-10-04 14:25:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 14:25:12,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:12,381 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-10-04 14:25:12,381 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:12,381 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 23 times [2018-10-04 14:25:12,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:12,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:12,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:12,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-10-04 14:25:12,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:12,736 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:25:12,748 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:12,912 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 14:25:12,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:12,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-10-04 14:25:13,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:13,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:25:13,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:25:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:25:13,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:13,042 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 26 states. [2018-10-04 14:25:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:13,125 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2018-10-04 14:25:13,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:25:13,126 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2018-10-04 14:25:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:13,127 INFO L225 Difference]: With dead ends: 153 [2018-10-04 14:25:13,128 INFO L226 Difference]: Without dead ends: 103 [2018-10-04 14:25:13,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 24 [2018-10-04 14:25:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-04 14:25:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-04 14:25:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-04 14:25:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-10-04 14:25:13,132 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-10-04 14:25:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:13,133 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-10-04 14:25:13,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:25:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-10-04 14:25:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-04 14:25:13,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:13,134 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-10-04 14:25:13,134 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:13,134 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 24 times [2018-10-04 14:25:13,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:13,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:13,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-04 14:25:13,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:13,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 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:25:13,657 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:13,800 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 14:25:13,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:13,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-04 14:25:13,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:13,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 14:25:13,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:25:13,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:25:13,926 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:13,926 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 27 states. [2018-10-04 14:25:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:14,066 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-10-04 14:25:14,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:25:14,067 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2018-10-04 14:25:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:14,068 INFO L225 Difference]: With dead ends: 159 [2018-10-04 14:25:14,068 INFO L226 Difference]: Without dead ends: 107 [2018-10-04 14:25:14,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 25 [2018-10-04 14:25:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-04 14:25:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-04 14:25:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 14:25:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-10-04 14:25:14,072 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-10-04 14:25:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:14,072 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-10-04 14:25:14,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:25:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-10-04 14:25:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-04 14:25:14,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:14,073 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-10-04 14:25:14,073 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:14,073 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 25 times [2018-10-04 14:25:14,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:14,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:14,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:14,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:14,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-10-04 14:25:14,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:14,661 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:25:14,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:14,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-10-04 14:25:14,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:14,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 14:25:14,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:25:14,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:25:14,855 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:14,855 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 28 states. [2018-10-04 14:25:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:14,978 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-10-04 14:25:14,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:25:14,979 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2018-10-04 14:25:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:14,980 INFO L225 Difference]: With dead ends: 165 [2018-10-04 14:25:14,980 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 14:25:14,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 26 [2018-10-04 14:25:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 14:25:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-10-04 14:25:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-04 14:25:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-10-04 14:25:14,987 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2018-10-04 14:25:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:14,987 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-10-04 14:25:14,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:25:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-10-04 14:25:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-04 14:25:14,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:14,988 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-10-04 14:25:14,988 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:14,989 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:14,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 26 times [2018-10-04 14:25:14,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:14,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:14,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:14,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:14,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-10-04 14:25:16,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:16,704 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:16,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:16,756 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:16,757 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:16,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-10-04 14:25:17,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:17,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 14:25:17,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:25:17,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:25:17,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:17,035 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 29 states. [2018-10-04 14:25:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:17,203 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-10-04 14:25:17,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:25:17,203 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 110 [2018-10-04 14:25:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:17,205 INFO L225 Difference]: With dead ends: 171 [2018-10-04 14:25:17,205 INFO L226 Difference]: Without dead ends: 115 [2018-10-04 14:25:17,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.2s impTime 27 [2018-10-04 14:25:17,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-04 14:25:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-10-04 14:25:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-04 14:25:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-10-04 14:25:17,210 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2018-10-04 14:25:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:17,210 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-10-04 14:25:17,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:25:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-10-04 14:25:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-04 14:25:17,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:17,211 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-10-04 14:25:17,211 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:17,211 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 27 times [2018-10-04 14:25:17,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:17,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:17,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:17,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:17,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-10-04 14:25:17,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:17,839 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:25:17,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:18,021 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 14:25:18,022 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:18,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-10-04 14:25:18,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:18,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:25:18,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:25:18,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:25:18,193 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:18,193 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 30 states. [2018-10-04 14:25:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:18,293 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-10-04 14:25:18,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:25:18,293 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-10-04 14:25:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:18,294 INFO L225 Difference]: With dead ends: 177 [2018-10-04 14:25:18,295 INFO L226 Difference]: Without dead ends: 119 [2018-10-04 14:25:18,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 28 [2018-10-04 14:25:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-04 14:25:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-10-04 14:25:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-04 14:25:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-10-04 14:25:18,299 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-10-04 14:25:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:18,300 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-10-04 14:25:18,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:25:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-10-04 14:25:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-04 14:25:18,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:18,301 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-10-04 14:25:18,301 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:18,301 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 28 times [2018-10-04 14:25:18,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:18,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:18,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-10-04 14:25:18,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:18,839 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:25:18,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:18,918 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:18,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:18,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-10-04 14:25:19,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:19,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 14:25:19,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 14:25:19,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 14:25:19,872 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:19,872 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 31 states. [2018-10-04 14:25:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:19,985 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2018-10-04 14:25:19,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:25:19,986 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2018-10-04 14:25:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:19,987 INFO L225 Difference]: With dead ends: 183 [2018-10-04 14:25:19,987 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 14:25:19,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.4s impTime 29 [2018-10-04 14:25:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 14:25:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-04 14:25:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-04 14:25:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-10-04 14:25:19,992 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-10-04 14:25:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:19,993 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-10-04 14:25:19,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 14:25:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-10-04 14:25:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-04 14:25:19,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:19,994 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-10-04 14:25:19,994 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:19,994 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 29 times [2018-10-04 14:25:19,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:19,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:19,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-10-04 14:25:20,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:20,495 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:25:20,503 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:20,759 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-04 14:25:20,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:20,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-10-04 14:25:20,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:20,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 14:25:20,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:25:20,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:25:20,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:20,902 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 32 states. [2018-10-04 14:25:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:21,128 INFO L93 Difference]: Finished difference Result 189 states and 192 transitions. [2018-10-04 14:25:21,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:25:21,128 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 122 [2018-10-04 14:25:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:21,129 INFO L225 Difference]: With dead ends: 189 [2018-10-04 14:25:21,129 INFO L226 Difference]: Without dead ends: 127 [2018-10-04 14:25:21,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 30 [2018-10-04 14:25:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-04 14:25:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-04 14:25:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-04 14:25:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-10-04 14:25:21,134 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-10-04 14:25:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:21,135 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-10-04 14:25:21,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:25:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-10-04 14:25:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-04 14:25:21,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:21,136 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-10-04 14:25:21,136 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:21,136 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:21,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 30 times [2018-10-04 14:25:21,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:21,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:21,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:21,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:21,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-04 14:25:21,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:21,822 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:25:21,830 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:22,005 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 14:25:22,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:22,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-04 14:25:22,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:22,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 14:25:22,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:25:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:25:22,198 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:22,198 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 33 states. [2018-10-04 14:25:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:22,347 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2018-10-04 14:25:22,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:25:22,347 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 126 [2018-10-04 14:25:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:22,348 INFO L225 Difference]: With dead ends: 195 [2018-10-04 14:25:22,348 INFO L226 Difference]: Without dead ends: 131 [2018-10-04 14:25:22,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 31 [2018-10-04 14:25:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-04 14:25:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-10-04 14:25:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-04 14:25:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-10-04 14:25:22,353 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2018-10-04 14:25:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:22,353 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-10-04 14:25:22,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:25:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-10-04 14:25:22,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-04 14:25:22,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:22,354 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-10-04 14:25:22,354 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:22,354 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:22,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 31 times [2018-10-04 14:25:22,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:22,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:22,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:22,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:22,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-04 14:25:23,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:23,631 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:23,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:23,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-04 14:25:23,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:23,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 14:25:23,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 14:25:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 14:25:23,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:23,950 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 34 states. [2018-10-04 14:25:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:24,964 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2018-10-04 14:25:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:25:24,964 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 130 [2018-10-04 14:25:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:24,965 INFO L225 Difference]: With dead ends: 201 [2018-10-04 14:25:24,965 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 14:25:24,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.9s impTime 32 [2018-10-04 14:25:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 14:25:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-04 14:25:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-04 14:25:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-10-04 14:25:24,969 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 130 [2018-10-04 14:25:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:24,969 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-10-04 14:25:24,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 14:25:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-10-04 14:25:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-04 14:25:24,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:24,970 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-10-04 14:25:24,970 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:24,971 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 32 times [2018-10-04 14:25:24,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:24,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:24,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:24,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:24,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-10-04 14:25:26,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:26,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 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:25:26,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:26,353 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:26,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:26,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-10-04 14:25:26,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:26,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 14:25:26,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 14:25:26,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 14:25:26,527 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:26,527 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 35 states. [2018-10-04 14:25:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:26,660 INFO L93 Difference]: Finished difference Result 207 states and 210 transitions. [2018-10-04 14:25:26,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:25:26,660 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-10-04 14:25:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:26,661 INFO L225 Difference]: With dead ends: 207 [2018-10-04 14:25:26,661 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 14:25:26,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 33 [2018-10-04 14:25:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 14:25:26,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-04 14:25:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-04 14:25:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-10-04 14:25:26,666 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-10-04 14:25:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:26,666 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-10-04 14:25:26,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 14:25:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-10-04 14:25:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-04 14:25:26,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:26,667 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-10-04 14:25:26,668 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:26,668 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:26,668 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 33 times [2018-10-04 14:25:26,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:26,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:26,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:26,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:26,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-10-04 14:25:27,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:27,724 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:25:27,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:28,037 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-04 14:25:28,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:28,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-10-04 14:25:28,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:28,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 14:25:28,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:25:28,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:25:28,408 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:28,408 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 36 states. [2018-10-04 14:25:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:28,561 INFO L93 Difference]: Finished difference Result 213 states and 216 transitions. [2018-10-04 14:25:28,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:25:28,562 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2018-10-04 14:25:28,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:28,563 INFO L225 Difference]: With dead ends: 213 [2018-10-04 14:25:28,563 INFO L226 Difference]: Without dead ends: 143 [2018-10-04 14:25:28,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.8s impTime 34 [2018-10-04 14:25:28,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-04 14:25:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-10-04 14:25:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-04 14:25:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-10-04 14:25:28,569 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 138 [2018-10-04 14:25:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:28,569 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-10-04 14:25:28,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:25:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-10-04 14:25:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-04 14:25:28,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:28,570 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-10-04 14:25:28,571 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:28,571 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 34 times [2018-10-04 14:25:28,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:28,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:28,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:28,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:28,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-10-04 14:25:29,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:29,155 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:25:29,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:29,229 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:29,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:29,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-10-04 14:25:29,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:29,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 14:25:29,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 14:25:29,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 14:25:29,442 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:29,442 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 37 states. [2018-10-04 14:25:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:29,696 INFO L93 Difference]: Finished difference Result 219 states and 222 transitions. [2018-10-04 14:25:29,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:25:29,697 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 142 [2018-10-04 14:25:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:29,697 INFO L225 Difference]: With dead ends: 219 [2018-10-04 14:25:29,697 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 14:25:29,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 35 [2018-10-04 14:25:29,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 14:25:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-10-04 14:25:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 14:25:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-10-04 14:25:29,701 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 142 [2018-10-04 14:25:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:29,702 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-10-04 14:25:29,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 14:25:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-10-04 14:25:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-04 14:25:29,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:29,703 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-10-04 14:25:29,703 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:29,703 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:29,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1526364071, now seen corresponding path program 35 times [2018-10-04 14:25:29,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:29,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:29,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:29,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:29,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-10-04 14:25:31,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:31,027 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:31,035 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:31,569 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-04 14:25:31,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:31,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-10-04 14:25:31,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:31,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 14:25:31,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 14:25:31,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 14:25:31,771 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:31,771 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 38 states. [2018-10-04 14:25:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:32,938 INFO L93 Difference]: Finished difference Result 225 states and 228 transitions. [2018-10-04 14:25:32,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:25:32,939 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 146 [2018-10-04 14:25:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:32,940 INFO L225 Difference]: With dead ends: 225 [2018-10-04 14:25:32,940 INFO L226 Difference]: Without dead ends: 151 [2018-10-04 14:25:32,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 36 [2018-10-04 14:25:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-04 14:25:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-04 14:25:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-04 14:25:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-10-04 14:25:32,945 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2018-10-04 14:25:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:32,946 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-10-04 14:25:32,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 14:25:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-10-04 14:25:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-04 14:25:32,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:32,947 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2018-10-04 14:25:32,947 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:32,947 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:32,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2109708315, now seen corresponding path program 36 times [2018-10-04 14:25:32,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:32,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:32,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:32,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:32,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-10-04 14:25:34,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:34,227 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:25:34,234 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:34,534 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 14:25:34,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:34,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-10-04 14:25:34,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:34,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 14:25:34,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 14:25:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 14:25:34,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:34,755 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2018-10-04 14:25:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:34,934 INFO L93 Difference]: Finished difference Result 231 states and 234 transitions. [2018-10-04 14:25:34,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:25:34,935 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-10-04 14:25:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:34,936 INFO L225 Difference]: With dead ends: 231 [2018-10-04 14:25:34,936 INFO L226 Difference]: Without dead ends: 155 [2018-10-04 14:25:34,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 37 [2018-10-04 14:25:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-04 14:25:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-10-04 14:25:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-04 14:25:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-10-04 14:25:34,942 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 150 [2018-10-04 14:25:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:34,942 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-10-04 14:25:34,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 14:25:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-10-04 14:25:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-04 14:25:34,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:34,944 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-10-04 14:25:34,944 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:34,944 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:34,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1900215951, now seen corresponding path program 37 times [2018-10-04 14:25:34,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:34,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:34,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:34,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:34,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-10-04 14:25:36,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:36,137 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:25:36,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:36,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-10-04 14:25:36,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:36,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 14:25:36,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 14:25:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 14:25:36,456 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:36,456 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 40 states. [2018-10-04 14:25:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:36,703 INFO L93 Difference]: Finished difference Result 237 states and 240 transitions. [2018-10-04 14:25:36,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:25:36,704 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-10-04 14:25:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:36,705 INFO L225 Difference]: With dead ends: 237 [2018-10-04 14:25:36,705 INFO L226 Difference]: Without dead ends: 159 [2018-10-04 14:25:36,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 38 [2018-10-04 14:25:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-04 14:25:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-10-04 14:25:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-04 14:25:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-10-04 14:25:36,710 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-10-04 14:25:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:36,710 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-10-04 14:25:36,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 14:25:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-10-04 14:25:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-04 14:25:36,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:36,711 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2018-10-04 14:25:36,711 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:36,712 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1266046205, now seen corresponding path program 38 times [2018-10-04 14:25:36,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:36,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:36,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:36,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:36,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-10-04 14:25:37,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:37,736 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:25:37,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:37,822 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:37,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:37,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-10-04 14:25:39,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:39,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 14:25:39,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:25:39,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:25:39,476 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:39,476 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2018-10-04 14:25:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:39,837 INFO L93 Difference]: Finished difference Result 243 states and 246 transitions. [2018-10-04 14:25:39,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:25:39,838 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-10-04 14:25:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:39,839 INFO L225 Difference]: With dead ends: 243 [2018-10-04 14:25:39,839 INFO L226 Difference]: Without dead ends: 163 [2018-10-04 14:25:39,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 0.7s impTime 39 [2018-10-04 14:25:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-04 14:25:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-10-04 14:25:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-04 14:25:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-10-04 14:25:39,844 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 158 [2018-10-04 14:25:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:39,845 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-10-04 14:25:39,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:25:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-10-04 14:25:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-04 14:25:39,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:39,846 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-10-04 14:25:39,846 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:39,846 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:39,847 INFO L82 PathProgramCache]: Analyzing trace with hash 907582839, now seen corresponding path program 39 times [2018-10-04 14:25:39,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:39,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:39,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:39,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-10-04 14:25:40,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:40,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 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:25:40,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:41,293 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-04 14:25:41,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:41,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-10-04 14:25:41,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:41,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 14:25:41,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 14:25:41,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 14:25:41,564 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:41,564 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 42 states. [2018-10-04 14:25:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:41,932 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2018-10-04 14:25:41,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:25:41,932 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-10-04 14:25:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:41,934 INFO L225 Difference]: With dead ends: 249 [2018-10-04 14:25:41,934 INFO L226 Difference]: Without dead ends: 167 [2018-10-04 14:25:41,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 40 [2018-10-04 14:25:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-04 14:25:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-10-04 14:25:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-04 14:25:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-10-04 14:25:41,939 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 162 [2018-10-04 14:25:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:41,939 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-10-04 14:25:41,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 14:25:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-10-04 14:25:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-04 14:25:41,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:41,940 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2018-10-04 14:25:41,941 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:41,941 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:41,941 INFO L82 PathProgramCache]: Analyzing trace with hash 334812651, now seen corresponding path program 40 times [2018-10-04 14:25:41,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:41,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:41,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:41,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:41,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-10-04 14:25:42,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:42,718 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:25:42,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:42,805 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:42,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:42,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-10-04 14:25:43,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:43,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 14:25:43,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 14:25:43,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 14:25:43,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:43,030 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 43 states. [2018-10-04 14:25:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:43,349 INFO L93 Difference]: Finished difference Result 255 states and 258 transitions. [2018-10-04 14:25:43,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:25:43,350 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-10-04 14:25:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:43,351 INFO L225 Difference]: With dead ends: 255 [2018-10-04 14:25:43,351 INFO L226 Difference]: Without dead ends: 171 [2018-10-04 14:25:43,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 41 [2018-10-04 14:25:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-04 14:25:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-10-04 14:25:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-04 14:25:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-10-04 14:25:43,357 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 166 [2018-10-04 14:25:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:43,358 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-10-04 14:25:43,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 14:25:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-10-04 14:25:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-04 14:25:43,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:43,359 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-10-04 14:25:43,359 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:43,359 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:43,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1537430623, now seen corresponding path program 41 times [2018-10-04 14:25:43,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:43,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:43,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:43,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:43,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:44,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-10-04 14:25:44,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:44,914 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:25:44,928 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:45,724 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-04 14:25:45,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:45,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-10-04 14:25:46,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:46,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 14:25:46,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:25:46,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:25:46,226 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:46,226 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 44 states. [2018-10-04 14:25:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:46,433 INFO L93 Difference]: Finished difference Result 261 states and 264 transitions. [2018-10-04 14:25:46,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:25:46,433 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 170 [2018-10-04 14:25:46,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:46,435 INFO L225 Difference]: With dead ends: 261 [2018-10-04 14:25:46,435 INFO L226 Difference]: Without dead ends: 175 [2018-10-04 14:25:46,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.2s impTime 42 [2018-10-04 14:25:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-04 14:25:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-10-04 14:25:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-04 14:25:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-04 14:25:46,441 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 170 [2018-10-04 14:25:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:46,441 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-04 14:25:46,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:25:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-04 14:25:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-04 14:25:46,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:46,442 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2018-10-04 14:25:46,442 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:46,443 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:46,443 INFO L82 PathProgramCache]: Analyzing trace with hash -903276333, now seen corresponding path program 42 times [2018-10-04 14:25:46,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:46,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:46,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:46,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:46,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-04 14:25:47,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:47,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 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:25:47,325 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:47,778 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 14:25:47,778 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:47,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-04 14:25:47,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:47,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 14:25:47,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:25:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:25:47,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:47,980 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 45 states. [2018-10-04 14:25:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:48,163 INFO L93 Difference]: Finished difference Result 267 states and 270 transitions. [2018-10-04 14:25:48,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:25:48,163 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 174 [2018-10-04 14:25:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:48,165 INFO L225 Difference]: With dead ends: 267 [2018-10-04 14:25:48,165 INFO L226 Difference]: Without dead ends: 179 [2018-10-04 14:25:48,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 43 [2018-10-04 14:25:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-04 14:25:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-10-04 14:25:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-04 14:25:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-10-04 14:25:48,170 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 174 [2018-10-04 14:25:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:48,171 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-10-04 14:25:48,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:25:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-10-04 14:25:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-04 14:25:48,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:48,171 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-10-04 14:25:48,172 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:48,172 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1945427129, now seen corresponding path program 43 times [2018-10-04 14:25:48,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:48,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:48,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:48,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:48,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-04 14:25:49,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:49,117 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:25:49,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:49,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-04 14:25:49,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:49,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 14:25:49,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 14:25:49,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 14:25:49,380 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:49,380 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 46 states. [2018-10-04 14:25:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:49,573 INFO L93 Difference]: Finished difference Result 273 states and 276 transitions. [2018-10-04 14:25:49,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 14:25:49,573 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 178 [2018-10-04 14:25:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:49,575 INFO L225 Difference]: With dead ends: 273 [2018-10-04 14:25:49,575 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 14:25:49,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 44 [2018-10-04 14:25:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 14:25:49,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-10-04 14:25:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-04 14:25:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-10-04 14:25:49,580 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 178 [2018-10-04 14:25:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:49,581 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-10-04 14:25:49,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 14:25:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-10-04 14:25:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-04 14:25:49,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:49,582 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2018-10-04 14:25:49,582 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:49,582 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:49,582 INFO L82 PathProgramCache]: Analyzing trace with hash -45190213, now seen corresponding path program 44 times [2018-10-04 14:25:49,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:49,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:49,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:49,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:49,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-04 14:25:50,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:50,510 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:25:50,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:50,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:50,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:50,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-04 14:25:50,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:50,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 14:25:50,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 14:25:50,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 14:25:50,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:50,797 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 47 states. [2018-10-04 14:25:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:50,998 INFO L93 Difference]: Finished difference Result 279 states and 282 transitions. [2018-10-04 14:25:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:25:50,998 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 182 [2018-10-04 14:25:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:51,000 INFO L225 Difference]: With dead ends: 279 [2018-10-04 14:25:51,000 INFO L226 Difference]: Without dead ends: 187 [2018-10-04 14:25:51,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 45 [2018-10-04 14:25:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-04 14:25:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-10-04 14:25:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-04 14:25:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-10-04 14:25:51,005 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 182 [2018-10-04 14:25:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:51,005 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-10-04 14:25:51,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 14:25:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-10-04 14:25:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-04 14:25:51,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:51,006 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-10-04 14:25:51,007 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:51,007 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:51,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1769474607, now seen corresponding path program 45 times [2018-10-04 14:25:51,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:51,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:51,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:51,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:51,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2018-10-04 14:25:51,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:51,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 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:25:51,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:52,880 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-04 14:25:52,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:52,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2018-10-04 14:25:53,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:53,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 14:25:53,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 14:25:53,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 14:25:53,203 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:53,203 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 48 states. [2018-10-04 14:25:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:53,404 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2018-10-04 14:25:53,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:25:53,404 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 186 [2018-10-04 14:25:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:53,406 INFO L225 Difference]: With dead ends: 285 [2018-10-04 14:25:53,406 INFO L226 Difference]: Without dead ends: 191 [2018-10-04 14:25:53,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime 46 [2018-10-04 14:25:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-04 14:25:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-04 14:25:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-04 14:25:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-10-04 14:25:53,411 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 186 [2018-10-04 14:25:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:53,412 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-10-04 14:25:53,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 14:25:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-10-04 14:25:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-04 14:25:53,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:53,413 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2018-10-04 14:25:53,413 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:53,413 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash -879958365, now seen corresponding path program 46 times [2018-10-04 14:25:53,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:53,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:53,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:53,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-10-04 14:25:54,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:54,729 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:25:54,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:54,811 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:54,812 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:54,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-10-04 14:25:55,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:55,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 14:25:55,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 14:25:55,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 14:25:55,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:55,030 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 49 states. [2018-10-04 14:25:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:55,240 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2018-10-04 14:25:55,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 14:25:55,240 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 190 [2018-10-04 14:25:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:55,242 INFO L225 Difference]: With dead ends: 291 [2018-10-04 14:25:55,242 INFO L226 Difference]: Without dead ends: 195 [2018-10-04 14:25:55,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.9s impTime 47 [2018-10-04 14:25:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-04 14:25:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-10-04 14:25:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-04 14:25:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-10-04 14:25:55,247 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 190 [2018-10-04 14:25:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:55,247 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-10-04 14:25:55,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 14:25:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-10-04 14:25:55,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-04 14:25:55,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:55,249 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-10-04 14:25:55,249 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:55,249 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:55,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1911420649, now seen corresponding path program 47 times [2018-10-04 14:25:55,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:55,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:55,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-04 14:25:56,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:56,280 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:56,287 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:57,347 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-04 14:25:57,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:57,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-04 14:25:57,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:57,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 14:25:57,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 14:25:57,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 14:25:57,628 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:57,628 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 50 states. [2018-10-04 14:25:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:57,874 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2018-10-04 14:25:57,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 14:25:57,874 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 194 [2018-10-04 14:25:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:57,876 INFO L225 Difference]: With dead ends: 297 [2018-10-04 14:25:57,876 INFO L226 Difference]: Without dead ends: 199 [2018-10-04 14:25:57,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 48 [2018-10-04 14:25:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-04 14:25:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-10-04 14:25:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-04 14:25:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-10-04 14:25:57,881 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 194 [2018-10-04 14:25:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:57,881 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-10-04 14:25:57,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 14:25:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-10-04 14:25:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-04 14:25:57,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:57,883 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2018-10-04 14:25:57,883 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:57,883 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:57,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1259106699, now seen corresponding path program 48 times [2018-10-04 14:25:57,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:57,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:57,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:57,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:57,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-10-04 14:25:59,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:59,007 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:59,014 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:59,744 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 14:25:59,745 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:59,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-10-04 14:25:59,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:59,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 14:25:59,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 14:25:59,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 14:25:59,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:59,965 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 51 states. [2018-10-04 14:26:00,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:00,234 INFO L93 Difference]: Finished difference Result 303 states and 306 transitions. [2018-10-04 14:26:00,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 14:26:00,234 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-10-04 14:26:00,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:00,236 INFO L225 Difference]: With dead ends: 303 [2018-10-04 14:26:00,236 INFO L226 Difference]: Without dead ends: 203 [2018-10-04 14:26:00,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 49 [2018-10-04 14:26:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-04 14:26:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-10-04 14:26:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-04 14:26:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-10-04 14:26:00,243 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 198 [2018-10-04 14:26:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:00,243 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-10-04 14:26:00,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 14:26:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-10-04 14:26:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-04 14:26:00,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:00,245 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-10-04 14:26:00,245 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:00,245 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:00,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1946083329, now seen corresponding path program 49 times [2018-10-04 14:26:00,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:00,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:00,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:00,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:00,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-04 14:26:01,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:01,173 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:26:01,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:01,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-04 14:26:01,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:01,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 14:26:01,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:26:01,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:26:01,470 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:01,470 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 52 states. [2018-10-04 14:26:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:01,732 INFO L93 Difference]: Finished difference Result 309 states and 312 transitions. [2018-10-04 14:26:01,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:26:01,732 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 202 [2018-10-04 14:26:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:01,733 INFO L225 Difference]: With dead ends: 309 [2018-10-04 14:26:01,734 INFO L226 Difference]: Without dead ends: 207 [2018-10-04 14:26:01,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 50 [2018-10-04 14:26:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-04 14:26:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-10-04 14:26:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 14:26:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-10-04 14:26:01,738 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 202 [2018-10-04 14:26:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:01,738 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-10-04 14:26:01,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:26:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-10-04 14:26:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-04 14:26:01,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:01,740 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2018-10-04 14:26:01,740 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:01,740 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1980427149, now seen corresponding path program 50 times [2018-10-04 14:26:01,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:01,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:01,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 14:26:02,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:02,934 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:26:02,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:26:03,022 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:26:03,022 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:03,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 14:26:03,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:03,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 14:26:03,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:26:03,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:26:03,232 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:03,232 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 53 states. [2018-10-04 14:26:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:04,086 INFO L93 Difference]: Finished difference Result 315 states and 318 transitions. [2018-10-04 14:26:04,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 14:26:04,087 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 206 [2018-10-04 14:26:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:04,088 INFO L225 Difference]: With dead ends: 315 [2018-10-04 14:26:04,089 INFO L226 Difference]: Without dead ends: 211 [2018-10-04 14:26:04,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 51 [2018-10-04 14:26:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-04 14:26:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-04 14:26:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-04 14:26:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-10-04 14:26:04,093 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 206 [2018-10-04 14:26:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:04,094 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-10-04 14:26:04,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:26:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-10-04 14:26:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-04 14:26:04,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:04,095 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-10-04 14:26:04,095 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:04,096 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:04,096 INFO L82 PathProgramCache]: Analyzing trace with hash -311603481, now seen corresponding path program 51 times [2018-10-04 14:26:04,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:04,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:04,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:04,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:04,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2018-10-04 14:26:05,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:05,005 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:05,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:26:06,185 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-04 14:26:06,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:06,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2018-10-04 14:26:07,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:07,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 14:26:07,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 14:26:07,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 14:26:07,807 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:07,807 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 54 states. [2018-10-04 14:26:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:08,110 INFO L93 Difference]: Finished difference Result 321 states and 324 transitions. [2018-10-04 14:26:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 14:26:08,111 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2018-10-04 14:26:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:08,113 INFO L225 Difference]: With dead ends: 321 [2018-10-04 14:26:08,113 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 14:26:08,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 0.6s impTime 52 [2018-10-04 14:26:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 14:26:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-10-04 14:26:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-04 14:26:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-10-04 14:26:08,117 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 210 [2018-10-04 14:26:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:08,117 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-10-04 14:26:08,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 14:26:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-10-04 14:26:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-04 14:26:08,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:08,118 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2018-10-04 14:26:08,119 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:08,119 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:08,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1905340581, now seen corresponding path program 52 times [2018-10-04 14:26:08,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:08,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:08,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:08,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:08,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-10-04 14:26:09,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:09,361 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:26:09,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:26:09,452 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:26:09,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:09,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-10-04 14:26:09,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:09,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 14:26:09,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 14:26:09,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 14:26:09,696 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:09,696 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 55 states. [2018-10-04 14:26:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:10,024 INFO L93 Difference]: Finished difference Result 327 states and 330 transitions. [2018-10-04 14:26:10,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:26:10,024 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 214 [2018-10-04 14:26:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:10,026 INFO L225 Difference]: With dead ends: 327 [2018-10-04 14:26:10,026 INFO L226 Difference]: Without dead ends: 219 [2018-10-04 14:26:10,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 53 [2018-10-04 14:26:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-04 14:26:10,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-10-04 14:26:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-04 14:26:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-10-04 14:26:10,031 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 214 [2018-10-04 14:26:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:10,032 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-10-04 14:26:10,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 14:26:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-10-04 14:26:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-04 14:26:10,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:10,033 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-10-04 14:26:10,033 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:10,033 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:10,033 INFO L82 PathProgramCache]: Analyzing trace with hash 880711119, now seen corresponding path program 53 times [2018-10-04 14:26:10,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:10,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:10,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:10,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:10,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-04 14:26:11,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:11,431 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:26:11,439 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:26:13,200 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-04 14:26:13,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:13,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-04 14:26:13,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:13,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 14:26:13,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 14:26:13,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 14:26:13,506 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:13,506 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 56 states. [2018-10-04 14:26:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:13,824 INFO L93 Difference]: Finished difference Result 333 states and 336 transitions. [2018-10-04 14:26:13,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:26:13,824 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 218 [2018-10-04 14:26:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:13,825 INFO L225 Difference]: With dead ends: 333 [2018-10-04 14:26:13,826 INFO L226 Difference]: Without dead ends: 223 [2018-10-04 14:26:13,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime 54 [2018-10-04 14:26:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-04 14:26:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-10-04 14:26:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-04 14:26:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-10-04 14:26:13,830 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 218 [2018-10-04 14:26:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:13,830 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-10-04 14:26:13,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 14:26:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-10-04 14:26:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-04 14:26:13,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:13,831 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2018-10-04 14:26:13,831 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:13,831 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:13,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1453433411, now seen corresponding path program 54 times [2018-10-04 14:26:13,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:13,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:13,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:13,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:13,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-04 14:26:14,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:14,803 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:26:14,810 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:26:15,714 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-04 14:26:15,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:15,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-04 14:26:15,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:15,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 14:26:15,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 14:26:15,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 14:26:15,947 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:15,947 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 57 states. [2018-10-04 14:26:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:16,322 INFO L93 Difference]: Finished difference Result 339 states and 342 transitions. [2018-10-04 14:26:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 14:26:16,323 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2018-10-04 14:26:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:16,324 INFO L225 Difference]: With dead ends: 339 [2018-10-04 14:26:16,324 INFO L226 Difference]: Without dead ends: 227 [2018-10-04 14:26:16,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 55 [2018-10-04 14:26:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-04 14:26:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-10-04 14:26:16,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-04 14:26:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-10-04 14:26:16,332 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 222 [2018-10-04 14:26:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:16,332 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-10-04 14:26:16,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 14:26:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-10-04 14:26:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-04 14:26:16,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:16,334 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-10-04 14:26:16,334 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:16,334 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:16,334 INFO L82 PathProgramCache]: Analyzing trace with hash -614665033, now seen corresponding path program 55 times [2018-10-04 14:26:16,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:16,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:16,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:16,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:16,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-04 14:26:17,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:17,752 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:26:17,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:17,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-04 14:26:18,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:18,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 14:26:18,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 14:26:18,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 14:26:18,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:18,114 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 58 states. [2018-10-04 14:26:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:18,444 INFO L93 Difference]: Finished difference Result 345 states and 348 transitions. [2018-10-04 14:26:18,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 14:26:18,444 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 226 [2018-10-04 14:26:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:18,445 INFO L225 Difference]: With dead ends: 345 [2018-10-04 14:26:18,445 INFO L226 Difference]: Without dead ends: 231 [2018-10-04 14:26:18,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime 56 [2018-10-04 14:26:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-04 14:26:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-04 14:26:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-04 14:26:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-10-04 14:26:18,451 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 226 [2018-10-04 14:26:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:18,451 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-10-04 14:26:18,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 14:26:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-10-04 14:26:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-04 14:26:18,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:18,452 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1] [2018-10-04 14:26:18,453 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:18,453 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash -659190485, now seen corresponding path program 56 times [2018-10-04 14:26:18,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:18,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:18,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2018-10-04 14:26:19,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:19,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 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:26:19,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:26:19,928 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:26:19,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:19,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2018-10-04 14:26:20,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:20,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 14:26:20,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 14:26:20,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 14:26:20,473 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:20,473 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2018-10-04 14:26:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:20,857 INFO L93 Difference]: Finished difference Result 351 states and 354 transitions. [2018-10-04 14:26:20,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 14:26:20,857 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 230 [2018-10-04 14:26:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:20,858 INFO L225 Difference]: With dead ends: 351 [2018-10-04 14:26:20,858 INFO L226 Difference]: Without dead ends: 235 [2018-10-04 14:26:20,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.1s impTime 57 [2018-10-04 14:26:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-04 14:26:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-04 14:26:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-04 14:26:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-10-04 14:26:20,862 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 230 [2018-10-04 14:26:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:20,862 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-10-04 14:26:20,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 14:26:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-10-04 14:26:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-04 14:26:20,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:20,863 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-10-04 14:26:20,864 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:20,864 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:20,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1412459423, now seen corresponding path program 57 times [2018-10-04 14:26:20,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:20,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:20,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:20,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:20,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-04 14:26:22,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:22,149 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:26:22,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:26:23,850 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-04 14:26:23,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:23,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-04 14:26:24,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:24,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 14:26:24,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 14:26:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 14:26:24,091 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:24,092 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 60 states. [2018-10-04 14:26:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:24,488 INFO L93 Difference]: Finished difference Result 357 states and 360 transitions. [2018-10-04 14:26:24,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 14:26:24,488 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 234 [2018-10-04 14:26:24,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:24,490 INFO L225 Difference]: With dead ends: 357 [2018-10-04 14:26:24,490 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 14:26:24,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 58 [2018-10-04 14:26:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 14:26:24,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-04 14:26:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-04 14:26:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-10-04 14:26:24,494 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 234 [2018-10-04 14:26:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:24,495 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-10-04 14:26:24,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 14:26:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-10-04 14:26:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-04 14:26:24,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:24,496 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1] [2018-10-04 14:26:24,496 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:24,496 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash 47353875, now seen corresponding path program 58 times [2018-10-04 14:26:24,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:24,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:24,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:24,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:24,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2018-10-04 14:26:25,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:25,579 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:26:25,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:26:25,678 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:26:25,678 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:25,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2018-10-04 14:26:25,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:25,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-04 14:26:25,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 14:26:25,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 14:26:25,920 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:25,921 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 61 states. [2018-10-04 14:26:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:26,295 INFO L93 Difference]: Finished difference Result 363 states and 366 transitions. [2018-10-04 14:26:26,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 14:26:26,295 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 238 [2018-10-04 14:26:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:26,296 INFO L225 Difference]: With dead ends: 363 [2018-10-04 14:26:26,296 INFO L226 Difference]: Without dead ends: 243 [2018-10-04 14:26:26,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime 59 [2018-10-04 14:26:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-04 14:26:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-10-04 14:26:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-04 14:26:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-10-04 14:26:26,301 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 238 [2018-10-04 14:26:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:26,301 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-10-04 14:26:26,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 14:26:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-10-04 14:26:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-04 14:26:26,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:26,302 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-10-04 14:26:26,303 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:26,303 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:26,303 INFO L82 PathProgramCache]: Analyzing trace with hash 153156231, now seen corresponding path program 59 times [2018-10-04 14:26:26,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:26,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:26,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:26,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:26,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-04 14:26:26,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:26,960 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:26:26,968 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:26:29,533 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-04 14:26:29,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:29,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-04 14:26:29,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:29,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 14:26:29,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 14:26:29,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 14:26:29,840 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:29,840 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 62 states. [2018-10-04 14:26:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:30,255 INFO L93 Difference]: Finished difference Result 369 states and 372 transitions. [2018-10-04 14:26:30,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 14:26:30,255 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 242 [2018-10-04 14:26:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:30,256 INFO L225 Difference]: With dead ends: 369 [2018-10-04 14:26:30,256 INFO L226 Difference]: Without dead ends: 247 [2018-10-04 14:26:30,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 60 [2018-10-04 14:26:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-04 14:26:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-10-04 14:26:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-04 14:26:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-10-04 14:26:30,262 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 242 [2018-10-04 14:26:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:30,263 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-10-04 14:26:30,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 14:26:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-10-04 14:26:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-04 14:26:30,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:30,264 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1] [2018-10-04 14:26:30,264 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:30,264 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1155486981, now seen corresponding path program 60 times [2018-10-04 14:26:30,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:30,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:30,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:30,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:30,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2018-10-04 14:26:31,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:31,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 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:26:31,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:26:32,766 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-04 14:26:32,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:32,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2018-10-04 14:26:33,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:33,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-04 14:26:33,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 14:26:33,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 14:26:33,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:33,203 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 63 states. [2018-10-04 14:26:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:33,585 INFO L93 Difference]: Finished difference Result 375 states and 378 transitions. [2018-10-04 14:26:33,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 14:26:33,585 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 246 [2018-10-04 14:26:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:33,586 INFO L225 Difference]: With dead ends: 375 [2018-10-04 14:26:33,587 INFO L226 Difference]: Without dead ends: 251 [2018-10-04 14:26:33,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.6s impTime 61 [2018-10-04 14:26:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-04 14:26:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-10-04 14:26:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-04 14:26:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-10-04 14:26:33,591 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 246 [2018-10-04 14:26:33,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:33,591 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-10-04 14:26:33,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 14:26:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-10-04 14:26:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-04 14:26:33,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:33,592 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-10-04 14:26:33,592 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:33,592 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:33,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1549181295, now seen corresponding path program 61 times [2018-10-04 14:26:33,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:33,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:33,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:33,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:33,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2018-10-04 14:26:34,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:34,627 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:26:34,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:34,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2018-10-04 14:26:34,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:34,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 14:26:34,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 14:26:34,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 14:26:34,983 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:34,983 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 64 states. [2018-10-04 14:26:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:35,514 INFO L93 Difference]: Finished difference Result 381 states and 384 transitions. [2018-10-04 14:26:35,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 14:26:35,515 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 250 [2018-10-04 14:26:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:35,516 INFO L225 Difference]: With dead ends: 381 [2018-10-04 14:26:35,516 INFO L226 Difference]: Without dead ends: 255 [2018-10-04 14:26:35,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 62 [2018-10-04 14:26:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-04 14:26:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-10-04 14:26:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-04 14:26:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-10-04 14:26:35,520 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 250 [2018-10-04 14:26:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:35,521 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-10-04 14:26:35,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 14:26:35,521 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-10-04 14:26:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-04 14:26:35,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:35,522 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1] [2018-10-04 14:26:35,522 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:35,522 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash -540549661, now seen corresponding path program 62 times [2018-10-04 14:26:35,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:35,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:35,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2018-10-04 14:26:36,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:36,206 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:26:36,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:26:36,314 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:26:36,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:36,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2018-10-04 14:26:36,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:36,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-04 14:26:36,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 14:26:36,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 14:26:36,615 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:36,615 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 65 states. [2018-10-04 14:26:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:37,017 INFO L93 Difference]: Finished difference Result 387 states and 390 transitions. [2018-10-04 14:26:37,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 14:26:37,017 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 254 [2018-10-04 14:26:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:37,019 INFO L225 Difference]: With dead ends: 387 [2018-10-04 14:26:37,019 INFO L226 Difference]: Without dead ends: 259 [2018-10-04 14:26:37,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 63 [2018-10-04 14:26:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-04 14:26:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-10-04 14:26:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-04 14:26:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-10-04 14:26:37,024 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 254 [2018-10-04 14:26:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:37,024 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-10-04 14:26:37,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 14:26:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-10-04 14:26:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-04 14:26:37,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:37,025 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-10-04 14:26:37,025 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:37,025 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1476829097, now seen corresponding path program 63 times [2018-10-04 14:26:37,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:37,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:37,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:37,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:37,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2018-10-04 14:26:37,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:37,700 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:37,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:26:40,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-04 14:26:40,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:40,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2018-10-04 14:26:40,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:40,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 14:26:40,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 14:26:40,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 14:26:40,414 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:40,414 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 66 states. [2018-10-04 14:26:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:40,867 INFO L93 Difference]: Finished difference Result 393 states and 396 transitions. [2018-10-04 14:26:40,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 14:26:40,867 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 258 [2018-10-04 14:26:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:40,868 INFO L225 Difference]: With dead ends: 393 [2018-10-04 14:26:40,869 INFO L226 Difference]: Without dead ends: 263 [2018-10-04 14:26:40,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 64 [2018-10-04 14:26:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-04 14:26:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-10-04 14:26:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-04 14:26:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-10-04 14:26:40,874 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 258 [2018-10-04 14:26:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:40,874 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-10-04 14:26:40,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 14:26:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-10-04 14:26:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-04 14:26:40,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:40,876 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1] [2018-10-04 14:26:40,876 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:40,876 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1190144203, now seen corresponding path program 64 times [2018-10-04 14:26:40,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:40,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:40,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:40,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2018-10-04 14:26:41,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:41,900 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:41,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:26:42,007 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:26:42,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:42,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2018-10-04 14:26:42,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:42,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-04 14:26:42,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 14:26:42,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 14:26:42,303 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:42,303 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 67 states. [2018-10-04 14:26:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:42,841 INFO L93 Difference]: Finished difference Result 399 states and 402 transitions. [2018-10-04 14:26:42,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 14:26:42,841 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 262 [2018-10-04 14:26:42,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:42,843 INFO L225 Difference]: With dead ends: 399 [2018-10-04 14:26:42,843 INFO L226 Difference]: Without dead ends: 267 [2018-10-04 14:26:42,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime 65 [2018-10-04 14:26:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-04 14:26:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-04 14:26:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-04 14:26:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-10-04 14:26:42,848 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 262 [2018-10-04 14:26:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:42,849 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-10-04 14:26:42,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 14:26:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-10-04 14:26:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-04 14:26:42,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:42,851 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-10-04 14:26:42,852 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:42,852 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:42,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1043412799, now seen corresponding path program 65 times [2018-10-04 14:26:42,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:42,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:42,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:42,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:42,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-04 14:26:44,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:44,060 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:26:44,067 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:26:47,461 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-04 14:26:47,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:47,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-04 14:26:47,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:47,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 14:26:47,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 14:26:47,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 14:26:47,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:47,759 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 68 states. [2018-10-04 14:26:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:48,377 INFO L93 Difference]: Finished difference Result 405 states and 408 transitions. [2018-10-04 14:26:48,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 14:26:48,377 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 266 [2018-10-04 14:26:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:48,378 INFO L225 Difference]: With dead ends: 405 [2018-10-04 14:26:48,378 INFO L226 Difference]: Without dead ends: 271 [2018-10-04 14:26:48,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 66 [2018-10-04 14:26:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-04 14:26:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-10-04 14:26:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-04 14:26:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-10-04 14:26:48,384 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 266 [2018-10-04 14:26:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:48,384 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-10-04 14:26:48,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 14:26:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-10-04 14:26:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-04 14:26:48,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:48,386 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1] [2018-10-04 14:26:48,386 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:48,386 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:48,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1094612045, now seen corresponding path program 66 times [2018-10-04 14:26:48,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:48,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:48,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:48,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:48,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-10-04 14:26:49,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:49,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 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:26:49,516 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:26:51,282 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-04 14:26:51,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:51,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-10-04 14:26:51,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:51,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-04 14:26:51,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 14:26:51,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 14:26:51,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:51,573 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 69 states. [2018-10-04 14:26:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:52,133 INFO L93 Difference]: Finished difference Result 411 states and 414 transitions. [2018-10-04 14:26:52,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 14:26:52,134 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 270 [2018-10-04 14:26:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:52,135 INFO L225 Difference]: With dead ends: 411 [2018-10-04 14:26:52,135 INFO L226 Difference]: Without dead ends: 275 [2018-10-04 14:26:52,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 67 [2018-10-04 14:26:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-04 14:26:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-10-04 14:26:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-04 14:26:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-10-04 14:26:52,140 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 270 [2018-10-04 14:26:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:52,140 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-10-04 14:26:52,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 14:26:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-10-04 14:26:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-04 14:26:52,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:52,141 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-10-04 14:26:52,141 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:52,141 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1764107815, now seen corresponding path program 67 times [2018-10-04 14:26:52,142 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:52,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:52,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:52,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:52,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2018-10-04 14:26:53,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:53,335 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:26:53,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:53,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2018-10-04 14:26:53,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:53,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 14:26:53,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 14:26:53,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 14:26:53,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:53,783 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 70 states. [2018-10-04 14:26:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:54,446 INFO L93 Difference]: Finished difference Result 417 states and 420 transitions. [2018-10-04 14:26:54,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 14:26:54,446 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 274 [2018-10-04 14:26:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:54,448 INFO L225 Difference]: With dead ends: 417 [2018-10-04 14:26:54,448 INFO L226 Difference]: Without dead ends: 279 [2018-10-04 14:26:54,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 68 [2018-10-04 14:26:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-04 14:26:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-04 14:26:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-04 14:26:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-10-04 14:26:54,453 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 274 [2018-10-04 14:26:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:54,453 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-10-04 14:26:54,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 14:26:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-10-04 14:26:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-04 14:26:54,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:54,455 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1] [2018-10-04 14:26:54,455 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:54,455 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash 224659099, now seen corresponding path program 68 times [2018-10-04 14:26:54,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:54,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:54,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:54,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:54,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-10-04 14:26:55,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:55,589 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:26:55,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:26:55,698 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:26:55,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:55,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-10-04 14:26:55,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:55,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-04 14:26:55,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 14:26:55,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 14:26:55,986 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:55,986 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 71 states. [2018-10-04 14:26:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:56,665 INFO L93 Difference]: Finished difference Result 423 states and 426 transitions. [2018-10-04 14:26:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 14:26:56,666 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 278 [2018-10-04 14:26:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:56,668 INFO L225 Difference]: With dead ends: 423 [2018-10-04 14:26:56,668 INFO L226 Difference]: Without dead ends: 283 [2018-10-04 14:26:56,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 69 [2018-10-04 14:26:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-04 14:26:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-10-04 14:26:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-04 14:26:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-10-04 14:26:56,673 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 278 [2018-10-04 14:26:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:56,673 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-10-04 14:26:56,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 14:26:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-10-04 14:26:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-04 14:26:56,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:56,674 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-10-04 14:26:56,674 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:56,675 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1795173647, now seen corresponding path program 69 times [2018-10-04 14:26:56,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:56,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:56,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2018-10-04 14:26:57,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:57,416 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:26:57,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:27:00,806 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-04 14:27:00,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:00,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2018-10-04 14:27:01,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:01,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 14:27:01,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 14:27:01,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 14:27:01,119 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:01,119 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 72 states. [2018-10-04 14:27:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:01,613 INFO L93 Difference]: Finished difference Result 429 states and 432 transitions. [2018-10-04 14:27:01,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 14:27:01,613 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 282 [2018-10-04 14:27:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:01,615 INFO L225 Difference]: With dead ends: 429 [2018-10-04 14:27:01,615 INFO L226 Difference]: Without dead ends: 287 [2018-10-04 14:27:01,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 70 [2018-10-04 14:27:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-04 14:27:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-10-04 14:27:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-04 14:27:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-10-04 14:27:01,620 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 282 [2018-10-04 14:27:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:01,620 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-10-04 14:27:01,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 14:27:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-10-04 14:27:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-04 14:27:01,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:01,622 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1, 1, 1] [2018-10-04 14:27:01,622 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:01,622 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:01,622 INFO L82 PathProgramCache]: Analyzing trace with hash -251684477, now seen corresponding path program 70 times [2018-10-04 14:27:01,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:01,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:01,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:01,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:01,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2018-10-04 14:27:02,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:02,412 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:27:02,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:27:02,530 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:27:02,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:02,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2018-10-04 14:27:02,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:02,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-04 14:27:02,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 14:27:02,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 14:27:02,825 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:02,825 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 73 states. [2018-10-04 14:27:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:03,396 INFO L93 Difference]: Finished difference Result 435 states and 438 transitions. [2018-10-04 14:27:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 14:27:03,396 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 286 [2018-10-04 14:27:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:03,397 INFO L225 Difference]: With dead ends: 435 [2018-10-04 14:27:03,397 INFO L226 Difference]: Without dead ends: 291 [2018-10-04 14:27:03,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 71 [2018-10-04 14:27:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-04 14:27:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-10-04 14:27:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-04 14:27:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-10-04 14:27:03,402 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 286 [2018-10-04 14:27:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:03,402 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-10-04 14:27:03,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 14:27:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-10-04 14:27:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-04 14:27:03,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:03,404 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1] [2018-10-04 14:27:03,404 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:03,404 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:03,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2112310263, now seen corresponding path program 71 times [2018-10-04 14:27:03,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:03,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:03,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:03,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:03,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2018-10-04 14:27:04,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:04,877 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:27:04,884 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:27:10,120 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-04 14:27:10,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:10,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2018-10-04 14:27:10,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:10,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 14:27:10,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 14:27:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 14:27:10,708 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:10,708 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 74 states. [2018-10-04 14:27:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:11,536 INFO L93 Difference]: Finished difference Result 441 states and 444 transitions. [2018-10-04 14:27:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 14:27:11,537 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 290 [2018-10-04 14:27:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:11,539 INFO L225 Difference]: With dead ends: 441 [2018-10-04 14:27:11,539 INFO L226 Difference]: Without dead ends: 295 [2018-10-04 14:27:11,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.2s impTime 72 [2018-10-04 14:27:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-04 14:27:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-10-04 14:27:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-04 14:27:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-10-04 14:27:11,544 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 290 [2018-10-04 14:27:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:11,545 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-10-04 14:27:11,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 14:27:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-10-04 14:27:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-04 14:27:11,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:11,547 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1, 1, 1] [2018-10-04 14:27:11,547 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:11,547 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:11,547 INFO L82 PathProgramCache]: Analyzing trace with hash 532431979, now seen corresponding path program 72 times [2018-10-04 14:27:11,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:11,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:11,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-10-04 14:27:12,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:12,357 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:27:12,363 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:27:15,154 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-04 14:27:15,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:15,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-10-04 14:27:15,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:15,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-04 14:27:15,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 14:27:15,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 14:27:15,532 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:15,532 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 75 states. [2018-10-04 14:27:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:16,094 INFO L93 Difference]: Finished difference Result 447 states and 450 transitions. [2018-10-04 14:27:16,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 14:27:16,094 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 294 [2018-10-04 14:27:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:16,096 INFO L225 Difference]: With dead ends: 447 [2018-10-04 14:27:16,096 INFO L226 Difference]: Without dead ends: 299 [2018-10-04 14:27:16,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 73 [2018-10-04 14:27:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-04 14:27:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-10-04 14:27:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-04 14:27:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-10-04 14:27:16,103 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 294 [2018-10-04 14:27:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:16,103 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-10-04 14:27:16,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 14:27:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-10-04 14:27:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-04 14:27:16,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:16,105 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1, 1, 1] [2018-10-04 14:27:16,105 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:16,105 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -737967393, now seen corresponding path program 73 times [2018-10-04 14:27:16,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:16,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:16,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:16,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-04 14:27:16,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:16,952 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:27:16,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:27:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:17,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-04 14:27:17,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:17,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-04 14:27:17,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 14:27:17,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 14:27:17,386 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:17,386 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 76 states. [2018-10-04 14:27:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:18,027 INFO L93 Difference]: Finished difference Result 453 states and 456 transitions. [2018-10-04 14:27:18,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 14:27:18,027 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 298 [2018-10-04 14:27:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:18,029 INFO L225 Difference]: With dead ends: 453 [2018-10-04 14:27:18,029 INFO L226 Difference]: Without dead ends: 303 [2018-10-04 14:27:18,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 74 [2018-10-04 14:27:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-04 14:27:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-10-04 14:27:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-04 14:27:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-10-04 14:27:18,035 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 298 [2018-10-04 14:27:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:18,036 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-10-04 14:27:18,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 14:27:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-10-04 14:27:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-04 14:27:18,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:18,038 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1, 1, 1] [2018-10-04 14:27:18,038 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:18,038 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1203898195, now seen corresponding path program 74 times [2018-10-04 14:27:18,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:18,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:18,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:27:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2018-10-04 14:27:19,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:19,365 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:27:19,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:27:19,491 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:27:19,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:19,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2018-10-04 14:27:19,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:19,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-04 14:27:19,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 14:27:19,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 14:27:19,828 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:19,828 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 77 states. [2018-10-04 14:27:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:20,573 INFO L93 Difference]: Finished difference Result 459 states and 462 transitions. [2018-10-04 14:27:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 14:27:20,574 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 302 [2018-10-04 14:27:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:20,575 INFO L225 Difference]: With dead ends: 459 [2018-10-04 14:27:20,576 INFO L226 Difference]: Without dead ends: 307 [2018-10-04 14:27:20,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 75 [2018-10-04 14:27:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-04 14:27:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-04 14:27:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-04 14:27:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-10-04 14:27:20,580 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 302 [2018-10-04 14:27:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:20,580 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-10-04 14:27:20,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 14:27:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-10-04 14:27:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-04 14:27:20,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:20,582 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1, 1, 1] [2018-10-04 14:27:20,582 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:20,583 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:20,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1753427513, now seen corresponding path program 75 times [2018-10-04 14:27:20,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:20,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:20,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:20,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:20,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-10-04 14:27:21,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:21,945 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:21,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:27:26,613 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-04 14:27:26,613 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:26,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-10-04 14:27:26,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:26,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-04 14:27:26,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 14:27:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 14:27:26,928 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:26,928 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 78 states. [2018-10-04 14:27:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:27,817 INFO L93 Difference]: Finished difference Result 465 states and 468 transitions. [2018-10-04 14:27:27,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 14:27:27,817 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 306 [2018-10-04 14:27:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:27,819 INFO L225 Difference]: With dead ends: 465 [2018-10-04 14:27:27,819 INFO L226 Difference]: Without dead ends: 311 [2018-10-04 14:27:27,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 76 [2018-10-04 14:27:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-04 14:27:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-10-04 14:27:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-04 14:27:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-10-04 14:27:27,824 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 306 [2018-10-04 14:27:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:27,824 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-10-04 14:27:27,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 14:27:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-10-04 14:27:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-04 14:27:27,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:27,826 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1, 1, 1] [2018-10-04 14:27:27,826 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:27,826 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:27,826 INFO L82 PathProgramCache]: Analyzing trace with hash 255386171, now seen corresponding path program 76 times [2018-10-04 14:27:27,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:27,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:27,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:27,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:27,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2018-10-04 14:27:29,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:29,390 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:27:29,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:27:29,520 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:27:29,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:29,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2018-10-04 14:27:29,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:29,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-04 14:27:29,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 14:27:29,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 14:27:29,842 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:29,842 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 79 states. [2018-10-04 14:27:30,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:30,727 INFO L93 Difference]: Finished difference Result 471 states and 474 transitions. [2018-10-04 14:27:30,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 14:27:30,727 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 310 [2018-10-04 14:27:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:30,728 INFO L225 Difference]: With dead ends: 471 [2018-10-04 14:27:30,729 INFO L226 Difference]: Without dead ends: 315 [2018-10-04 14:27:30,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime 77 [2018-10-04 14:27:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-04 14:27:30,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-10-04 14:27:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-04 14:27:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-10-04 14:27:30,734 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 310 [2018-10-04 14:27:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:30,734 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-10-04 14:27:30,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 14:27:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-10-04 14:27:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-04 14:27:30,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:30,735 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1, 1, 1] [2018-10-04 14:27:30,735 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:30,736 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash -361023313, now seen corresponding path program 77 times [2018-10-04 14:27:30,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:30,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:30,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:30,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:30,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-10-04 14:27:32,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:32,084 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:27:32,091 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:27:41,483 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-10-04 14:27:41,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:41,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-10-04 14:27:41,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:41,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-04 14:27:41,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 14:27:41,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 14:27:41,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:41,815 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 80 states. [2018-10-04 14:27:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:42,713 INFO L93 Difference]: Finished difference Result 477 states and 480 transitions. [2018-10-04 14:27:42,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-04 14:27:42,714 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 314 [2018-10-04 14:27:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:42,715 INFO L225 Difference]: With dead ends: 477 [2018-10-04 14:27:42,715 INFO L226 Difference]: Without dead ends: 319 [2018-10-04 14:27:42,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime 78 [2018-10-04 14:27:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-04 14:27:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-10-04 14:27:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-04 14:27:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-10-04 14:27:42,720 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 314 [2018-10-04 14:27:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:42,721 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-10-04 14:27:42,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 14:27:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-10-04 14:27:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-04 14:27:42,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:42,722 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1, 1, 1] [2018-10-04 14:27:42,722 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:42,722 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:42,722 INFO L82 PathProgramCache]: Analyzing trace with hash 340317475, now seen corresponding path program 78 times [2018-10-04 14:27:42,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:42,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:42,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:42,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:42,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2018-10-04 14:27:43,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:43,699 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:27:43,707 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:27:47,244 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-10-04 14:27:47,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:47,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2018-10-04 14:27:47,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:47,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-04 14:27:47,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 14:27:47,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 14:27:47,576 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:47,576 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 81 states. [2018-10-04 14:27:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:48,274 INFO L93 Difference]: Finished difference Result 483 states and 486 transitions. [2018-10-04 14:27:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-04 14:27:48,274 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 318 [2018-10-04 14:27:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:48,276 INFO L225 Difference]: With dead ends: 483 [2018-10-04 14:27:48,276 INFO L226 Difference]: Without dead ends: 323 [2018-10-04 14:27:48,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 79 [2018-10-04 14:27:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-04 14:27:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-10-04 14:27:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-04 14:27:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-10-04 14:27:48,281 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 318 [2018-10-04 14:27:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:48,281 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-10-04 14:27:48,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 14:27:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-10-04 14:27:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-04 14:27:48,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:48,283 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1, 1, 1] [2018-10-04 14:27:48,283 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:48,283 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:48,283 INFO L82 PathProgramCache]: Analyzing trace with hash -416893033, now seen corresponding path program 79 times [2018-10-04 14:27:48,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:48,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:48,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2018-10-04 14:27:49,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:49,599 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:27:49,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:27:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:49,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2018-10-04 14:27:50,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:50,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-04 14:27:50,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 14:27:50,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 14:27:50,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:50,096 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 82 states. [2018-10-04 14:27:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:51,074 INFO L93 Difference]: Finished difference Result 489 states and 492 transitions. [2018-10-04 14:27:51,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 14:27:51,074 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 322 [2018-10-04 14:27:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:51,075 INFO L225 Difference]: With dead ends: 489 [2018-10-04 14:27:51,075 INFO L226 Difference]: Without dead ends: 327 [2018-10-04 14:27:51,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 80 [2018-10-04 14:27:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-04 14:27:51,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-10-04 14:27:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-04 14:27:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-10-04 14:27:51,081 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 322 [2018-10-04 14:27:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:51,081 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-10-04 14:27:51,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 14:27:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-10-04 14:27:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-04 14:27:51,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:51,082 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1, 1, 1] [2018-10-04 14:27:51,082 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:51,082 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash -317071349, now seen corresponding path program 80 times [2018-10-04 14:27:51,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:51,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:51,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:51,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:27:51,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2018-10-04 14:27:52,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:52,351 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:27:52,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:27:52,488 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:27:52,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:52,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2018-10-04 14:27:52,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:52,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-04 14:27:52,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 14:27:52,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 14:27:52,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:52,824 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 83 states. [2018-10-04 14:27:53,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:53,798 INFO L93 Difference]: Finished difference Result 495 states and 498 transitions. [2018-10-04 14:27:53,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-04 14:27:53,799 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 326 [2018-10-04 14:27:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:53,800 INFO L225 Difference]: With dead ends: 495 [2018-10-04 14:27:53,800 INFO L226 Difference]: Without dead ends: 331 [2018-10-04 14:27:53,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 81 [2018-10-04 14:27:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-04 14:27:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-10-04 14:27:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-04 14:27:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-10-04 14:27:53,806 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 326 [2018-10-04 14:27:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:53,806 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-10-04 14:27:53,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 14:27:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-10-04 14:27:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-04 14:27:53,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:53,808 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1, 1, 1] [2018-10-04 14:27:53,808 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:53,808 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1616425345, now seen corresponding path program 81 times [2018-10-04 14:27:53,808 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:53,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:53,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2018-10-04 14:27:55,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:55,240 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:27:55,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:28:01,614 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-10-04 14:28:01,614 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:01,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2018-10-04 14:28:01,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:01,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-04 14:28:01,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 14:28:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 14:28:01,960 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:01,960 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 84 states. [2018-10-04 14:28:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:02,798 INFO L93 Difference]: Finished difference Result 501 states and 504 transitions. [2018-10-04 14:28:02,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 14:28:02,799 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 330 [2018-10-04 14:28:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:02,800 INFO L225 Difference]: With dead ends: 501 [2018-10-04 14:28:02,800 INFO L226 Difference]: Without dead ends: 335 [2018-10-04 14:28:02,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime 82 [2018-10-04 14:28:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-04 14:28:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-10-04 14:28:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-04 14:28:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-10-04 14:28:02,805 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 330 [2018-10-04 14:28:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:02,805 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-10-04 14:28:02,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 14:28:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-10-04 14:28:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-04 14:28:02,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:02,807 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1, 1, 1] [2018-10-04 14:28:02,807 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:02,807 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 668205811, now seen corresponding path program 82 times [2018-10-04 14:28:02,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:02,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:02,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:02,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:02,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2018-10-04 14:28:04,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:04,305 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:28:04,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:28:04,443 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:28:04,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:04,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2018-10-04 14:28:04,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:04,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-04 14:28:04,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 14:28:04,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 14:28:04,795 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:04,795 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 85 states. [2018-10-04 14:28:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:05,926 INFO L93 Difference]: Finished difference Result 507 states and 510 transitions. [2018-10-04 14:28:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 14:28:05,926 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 334 [2018-10-04 14:28:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:05,927 INFO L225 Difference]: With dead ends: 507 [2018-10-04 14:28:05,927 INFO L226 Difference]: Without dead ends: 339 [2018-10-04 14:28:05,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime 83 [2018-10-04 14:28:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-04 14:28:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-10-04 14:28:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-04 14:28:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-10-04 14:28:05,932 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 334 [2018-10-04 14:28:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:05,933 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-10-04 14:28:05,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 14:28:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-10-04 14:28:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-04 14:28:05,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:05,934 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1, 1, 1] [2018-10-04 14:28:05,934 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:05,934 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash 505740647, now seen corresponding path program 83 times [2018-10-04 14:28:05,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:05,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:05,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:05,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2018-10-04 14:28:07,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:07,567 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:28:07,573 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:28:16,701 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-10-04 14:28:16,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:16,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2018-10-04 14:28:17,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:17,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-04 14:28:17,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 14:28:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 14:28:17,093 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:17,093 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 86 states. [2018-10-04 14:28:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:18,208 INFO L93 Difference]: Finished difference Result 513 states and 516 transitions. [2018-10-04 14:28:18,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-04 14:28:18,209 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 338 [2018-10-04 14:28:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:18,211 INFO L225 Difference]: With dead ends: 513 [2018-10-04 14:28:18,211 INFO L226 Difference]: Without dead ends: 343 [2018-10-04 14:28:18,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 84 [2018-10-04 14:28:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-04 14:28:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-10-04 14:28:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-04 14:28:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-10-04 14:28:18,216 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 338 [2018-10-04 14:28:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:18,216 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-10-04 14:28:18,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 14:28:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-10-04 14:28:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-04 14:28:18,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:18,218 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1, 1, 1] [2018-10-04 14:28:18,218 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:18,218 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1251950043, now seen corresponding path program 84 times [2018-10-04 14:28:18,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:18,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:18,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2018-10-04 14:28:19,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:19,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 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:28:19,610 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:28:24,132 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-10-04 14:28:24,132 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:24,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2018-10-04 14:28:24,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:24,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-04 14:28:24,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 14:28:24,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 14:28:24,592 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:24,592 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 87 states. [2018-10-04 14:28:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:25,622 INFO L93 Difference]: Finished difference Result 519 states and 522 transitions. [2018-10-04 14:28:25,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-04 14:28:25,622 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 342 [2018-10-04 14:28:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:25,623 INFO L225 Difference]: With dead ends: 519 [2018-10-04 14:28:25,623 INFO L226 Difference]: Without dead ends: 347 [2018-10-04 14:28:25,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime 85 [2018-10-04 14:28:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-04 14:28:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-10-04 14:28:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-04 14:28:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-10-04 14:28:25,629 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 342 [2018-10-04 14:28:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:25,629 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-10-04 14:28:25,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 14:28:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-10-04 14:28:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-04 14:28:25,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:25,631 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1, 1, 1] [2018-10-04 14:28:25,631 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:25,631 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:25,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1690813519, now seen corresponding path program 85 times [2018-10-04 14:28:25,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:25,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:25,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:25,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:25,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2018-10-04 14:28:27,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:27,319 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:28:27,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:27,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2018-10-04 14:28:27,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:27,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-04 14:28:27,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 14:28:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 14:28:27,816 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:27,817 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 88 states. [2018-10-04 14:28:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:28,969 INFO L93 Difference]: Finished difference Result 525 states and 528 transitions. [2018-10-04 14:28:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-04 14:28:28,969 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 346 [2018-10-04 14:28:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:28,971 INFO L225 Difference]: With dead ends: 525 [2018-10-04 14:28:28,971 INFO L226 Difference]: Without dead ends: 351 [2018-10-04 14:28:28,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 86 [2018-10-04 14:28:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-04 14:28:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-10-04 14:28:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-04 14:28:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-10-04 14:28:28,976 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 346 [2018-10-04 14:28:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:28,976 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-10-04 14:28:28,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 14:28:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-10-04 14:28:28,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-04 14:28:28,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:28,978 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1, 1, 1] [2018-10-04 14:28:28,978 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:28,978 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:28,979 INFO L82 PathProgramCache]: Analyzing trace with hash -744255293, now seen corresponding path program 86 times [2018-10-04 14:28:28,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:28,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:28,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:28,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:28,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2018-10-04 14:28:30,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:30,138 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:30,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:28:30,280 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:28:30,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:30,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2018-10-04 14:28:30,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:30,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-10-04 14:28:30,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 14:28:30,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 14:28:30,879 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:30,880 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 89 states. [2018-10-04 14:28:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:31,812 INFO L93 Difference]: Finished difference Result 531 states and 534 transitions. [2018-10-04 14:28:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-04 14:28:31,812 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 350 [2018-10-04 14:28:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:31,814 INFO L225 Difference]: With dead ends: 531 [2018-10-04 14:28:31,814 INFO L226 Difference]: Without dead ends: 355 [2018-10-04 14:28:31,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.8s impTime 87 [2018-10-04 14:28:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-04 14:28:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-10-04 14:28:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-04 14:28:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-10-04 14:28:31,820 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 350 [2018-10-04 14:28:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:31,820 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-10-04 14:28:31,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-04 14:28:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-10-04 14:28:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-04 14:28:31,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:31,822 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1, 1, 1] [2018-10-04 14:28:31,822 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:31,822 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:31,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1840751415, now seen corresponding path program 87 times [2018-10-04 14:28:31,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:31,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:31,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:31,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:31,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15312 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 7656 trivial. 0 not checked. [2018-10-04 14:28:33,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:33,210 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:28:33,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:28:41,113 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-10-04 14:28:41,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:41,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15312 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 7656 trivial. 0 not checked. [2018-10-04 14:28:41,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:41,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-04 14:28:41,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 14:28:41,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 14:28:41,475 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:41,475 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 90 states. [2018-10-04 14:28:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:42,524 INFO L93 Difference]: Finished difference Result 537 states and 540 transitions. [2018-10-04 14:28:42,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-04 14:28:42,524 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 354 [2018-10-04 14:28:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:42,525 INFO L225 Difference]: With dead ends: 537 [2018-10-04 14:28:42,526 INFO L226 Difference]: Without dead ends: 359 [2018-10-04 14:28:42,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 88 [2018-10-04 14:28:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-04 14:28:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-10-04 14:28:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-04 14:28:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-10-04 14:28:42,531 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 354 [2018-10-04 14:28:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:42,531 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-10-04 14:28:42,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 14:28:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-10-04 14:28:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-04 14:28:42,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:42,533 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1, 1, 1] [2018-10-04 14:28:42,533 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:42,533 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash 956890027, now seen corresponding path program 88 times [2018-10-04 14:28:42,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:42,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:42,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:42,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:42,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2018-10-04 14:28:44,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:44,357 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:28:44,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:28:44,510 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:28:44,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:44,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2018-10-04 14:28:44,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:44,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-10-04 14:28:44,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-04 14:28:44,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-04 14:28:44,924 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:44,924 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 91 states. [2018-10-04 14:28:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:46,214 INFO L93 Difference]: Finished difference Result 543 states and 546 transitions. [2018-10-04 14:28:46,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-04 14:28:46,214 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 358 [2018-10-04 14:28:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:46,215 INFO L225 Difference]: With dead ends: 543 [2018-10-04 14:28:46,215 INFO L226 Difference]: Without dead ends: 363 [2018-10-04 14:28:46,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime 89 [2018-10-04 14:28:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-04 14:28:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-10-04 14:28:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-04 14:28:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-10-04 14:28:46,221 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 358 [2018-10-04 14:28:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:46,221 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-10-04 14:28:46,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-04 14:28:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-10-04 14:28:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-04 14:28:46,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:46,223 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1, 1, 1] [2018-10-04 14:28:46,223 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:46,223 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash 723294751, now seen corresponding path program 89 times [2018-10-04 14:28:46,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:46,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:46,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:46,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:46,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 8010 trivial. 0 not checked. [2018-10-04 14:28:48,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:48,037 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:28:48,044 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:28:59,239 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-10-04 14:28:59,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:59,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 8010 trivial. 0 not checked. [2018-10-04 14:28:59,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:59,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-10-04 14:28:59,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 14:28:59,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 14:28:59,627 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:59,627 INFO L87 Difference]: Start difference. First operand 363 states and 364 transitions. Second operand 92 states. [2018-10-04 14:29:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:00,857 INFO L93 Difference]: Finished difference Result 549 states and 552 transitions. [2018-10-04 14:29:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-04 14:29:00,857 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 362 [2018-10-04 14:29:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:00,859 INFO L225 Difference]: With dead ends: 549 [2018-10-04 14:29:00,859 INFO L226 Difference]: Without dead ends: 367 [2018-10-04 14:29:00,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.4s impTime 90 [2018-10-04 14:29:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-04 14:29:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-10-04 14:29:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-04 14:29:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-10-04 14:29:00,864 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 362 [2018-10-04 14:29:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:00,864 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-10-04 14:29:00,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 14:29:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-10-04 14:29:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-04 14:29:00,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:00,866 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1, 1, 1] [2018-10-04 14:29:00,866 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:00,866 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:00,866 INFO L82 PathProgramCache]: Analyzing trace with hash -386433389, now seen corresponding path program 90 times [2018-10-04 14:29:00,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:00,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:00,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:00,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:00,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 8190 trivial. 0 not checked. [2018-10-04 14:29:02,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:02,669 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:02,693 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Received shutdown request... [2018-10-04 14:29:08,421 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2018-10-04 14:29:08,422 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:08,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:08,446 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-04 14:29:08,647 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:29:08,648 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:29:08,654 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:29:08,654 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:29:08 BoogieIcfgContainer [2018-10-04 14:29:08,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:29:08,655 INFO L168 Benchmark]: Toolchain (without parser) took 251576.79 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 4.2 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 65.4 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2018-10-04 14:29:08,656 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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:29:08,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.77 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:29:08,657 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 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:29:08,658 INFO L168 Benchmark]: RCFGBuilder took 308.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:29:08,658 INFO L168 Benchmark]: TraceAbstraction took 251193.25 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 4.2 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.3 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2018-10-04 14:29:08,661 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.25 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.77 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.28 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 308.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251193.25 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 4.2 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.3 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 56). Cancelled while BasicCegarLoop was analyzing trace of length 367 with TraceHistMax 91, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 251.1s OverallTime, 91 OverallIterations, 91 TraceHistogramMax, 38.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 540 SDtfs, 7444 SDslu, 10249 SDs, 0 SdLazy, 10429 SolverSat, 7718 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20650 GetRequests, 16555 SyntacticMatches, 0 SemanticMatches, 4095 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 93.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=90, 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.4s AutomataMinimizationTime, 90 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.5s SsaConstructionTime, 96.2s SatisfiabilityAnalysisTime, 101.0s InterpolantComputationTime, 33114 NumberOfCodeBlocks, 33114 NumberOfCodeBlocksAsserted, 2219 NumberOfCheckSat, 32935 ConstructedInterpolants, 0 QuantifiedInterpolants, 15910575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 49573 ConjunctsInSsa, 4183 ConjunctsInUnsatCore, 179 InterpolantComputations, 1 PerfectInterpolantSequences, 485940/971880 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/array3.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-29-08-676.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/array3.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-29-08-676.csv Completed graceful shutdown