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/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:08:01,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:08:01,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:08:01,830 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:08:01,831 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:08:01,832 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:08:01,833 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:08:01,835 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:08:01,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:08:01,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:08:01,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:08:01,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:08:01,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:08:01,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:08:01,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:08:01,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:08:01,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:08:01,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:08:01,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:08:01,849 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:08:01,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:08:01,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:08:01,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:08:01,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:08:01,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:08:01,858 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:08:01,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:08:01,860 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:08:01,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:08:01,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:08:01,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:08:01,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:08:01,863 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:08:01,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:08:01,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:08:01,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:08:01,866 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-02 12:08:01,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:08:01,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:08:01,882 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:08:01,882 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:08:01,883 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:08:01,883 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:08:01,883 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:08:01,883 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:08:01,884 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:08:01,884 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:08:01,884 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:08:01,884 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:08:01,884 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:08:01,884 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:08:01,885 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:08:01,885 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:08:01,885 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:08:01,885 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:08:01,885 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:08:01,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:08:01,886 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:08:01,886 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:08:01,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:08:01,886 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:08:01,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:08:01,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:08:01,887 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:08:01,887 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:08:01,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:08:01,888 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:08:01,888 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:08:01,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:08:01,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:08:01,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:08:01,959 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:08:01,960 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:08:01,960 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-10-02 12:08:01,961 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl' [2018-10-02 12:08:02,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:08:02,040 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:08:02,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:08:02,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:08:02,041 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:08:02,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (1/1) ... [2018-10-02 12:08:02,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (1/1) ... [2018-10-02 12:08:02,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:08:02,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:08:02,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:08:02,085 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:08:02,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (1/1) ... [2018-10-02 12:08:02,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (1/1) ... [2018-10-02 12:08:02,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (1/1) ... [2018-10-02 12:08:02,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (1/1) ... [2018-10-02 12:08:02,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (1/1) ... [2018-10-02 12:08:02,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (1/1) ... [2018-10-02 12:08:02,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (1/1) ... [2018-10-02 12:08:02,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:08:02,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:08:02,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:08:02,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:08:02,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (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-02 12:08:02,186 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-02 12:08:02,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:08:02,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:08:02,445 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:08:02,446 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:08:02 BoogieIcfgContainer [2018-10-02 12:08:02,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:08:02,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:08:02,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:08:02,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:08:02,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:02" (1/2) ... [2018-10-02 12:08:02,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e412d40 and model type nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:08:02, skipping insertion in model container [2018-10-02 12:08:02,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:08:02" (2/2) ... [2018-10-02 12:08:02,458 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-10-02 12:08:02,469 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:08:02,480 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:08:02,537 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:08:02,537 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:08:02,538 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:08:02,538 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:08:02,538 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:08:02,538 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:08:02,538 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:08:02,538 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:08:02,538 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:08:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-02 12:08:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-02 12:08:02,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:02,559 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-02 12:08:02,560 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:02,566 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-10-02 12:08:02,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:02,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:02,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:02,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:02,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:02,736 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-02 12:08:02,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:08:02,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:08:02,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:08:02,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:08:02,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:02,762 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-02 12:08:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:02,968 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-10-02 12:08:02,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:08:02,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-02 12:08:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:02,981 INFO L225 Difference]: With dead ends: 11 [2018-10-02 12:08:02,981 INFO L226 Difference]: Without dead ends: 7 [2018-10-02 12:08:02,984 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 [2018-10-02 12:08:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-02 12:08:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-02 12:08:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-02 12:08:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-10-02 12:08:03,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-10-02 12:08:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:03,020 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-10-02 12:08:03,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:08:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-02 12:08:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:08:03,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:03,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 12:08:03,022 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:03,022 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:03,022 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-10-02 12:08:03,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:03,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:03,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:03,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:03,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:08:03,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:08:03,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:08:03,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:08:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:08:03,070 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:03,070 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2018-10-02 12:08:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:03,149 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-10-02 12:08:03,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:08:03,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-10-02 12:08:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:03,150 INFO L225 Difference]: With dead ends: 11 [2018-10-02 12:08:03,150 INFO L226 Difference]: Without dead ends: 7 [2018-10-02 12:08:03,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:08:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-02 12:08:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-02 12:08:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-02 12:08:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-10-02 12:08:03,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-10-02 12:08:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:03,154 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-10-02 12:08:03,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:08:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-10-02 12:08:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 12:08:03,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:03,155 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-02 12:08:03,156 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:03,156 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:03,156 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-10-02 12:08:03,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:03,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:03,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:03,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:03,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:08:03,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:03,222 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-02 12:08:03,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:03,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:08:03,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:03,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 12:08:03,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:08:03,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:08:03,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:03,323 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-10-02 12:08:03,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:03,459 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-10-02 12:08:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:08:03,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-02 12:08:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:03,462 INFO L225 Difference]: With dead ends: 13 [2018-10-02 12:08:03,462 INFO L226 Difference]: Without dead ends: 8 [2018-10-02 12:08:03,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:08:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-02 12:08:03,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-02 12:08:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-02 12:08:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-02 12:08:03,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-10-02 12:08:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:03,466 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-02 12:08:03,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:08:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-02 12:08:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 12:08:03,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:03,469 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-02 12:08:03,469 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:03,469 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:03,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-10-02 12:08:03,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:03,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:03,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:03,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:03,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 12:08:03,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:03,576 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-02 12:08:03,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:08:03,622 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:08:03,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:03,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:08:03,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:03,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 7 [2018-10-02 12:08:03,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:08:03,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:08:03,821 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:03,821 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 7 states. [2018-10-02 12:08:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:04,324 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-10-02 12:08:04,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:08:04,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-02 12:08:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:04,327 INFO L225 Difference]: With dead ends: 24 [2018-10-02 12:08:04,327 INFO L226 Difference]: Without dead ends: 18 [2018-10-02 12:08:04,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.2s impTime [2018-10-02 12:08:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-02 12:08:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-02 12:08:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-02 12:08:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-10-02 12:08:04,333 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2018-10-02 12:08:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:04,334 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-02 12:08:04,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:08:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-10-02 12:08:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:08:04,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:04,335 INFO L375 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-10-02 12:08:04,335 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:04,335 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:04,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 3 times [2018-10-02 12:08:04,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:04,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:04,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:04,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:04,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-02 12:08:04,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:04,428 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:04,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:08:04,453 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-02 12:08:04,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:04,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-02 12:08:04,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:04,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 12:08:04,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 12:08:04,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 12:08:04,507 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:04,508 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2018-10-02 12:08:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:04,989 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-10-02 12:08:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:08:04,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-02 12:08:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:04,990 INFO L225 Difference]: With dead ends: 24 [2018-10-02 12:08:04,991 INFO L226 Difference]: Without dead ends: 16 [2018-10-02 12:08:04,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:08:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-02 12:08:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-02 12:08:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-02 12:08:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-10-02 12:08:04,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-10-02 12:08:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:04,996 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-10-02 12:08:04,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 12:08:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-10-02 12:08:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:08:04,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:04,998 INFO L375 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-10-02 12:08:04,998 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:04,998 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:04,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 4 times [2018-10-02 12:08:04,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:04,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:05,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:05,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:05,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-02 12:08:05,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:05,087 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-02 12:08:05,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:08:05,129 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:08:05,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:05,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-02 12:08:05,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:05,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 10 [2018-10-02 12:08:05,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:08:05,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:08:05,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:05,242 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 10 states. [2018-10-02 12:08:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:05,788 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-10-02 12:08:05,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 12:08:05,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-10-02 12:08:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:05,790 INFO L225 Difference]: With dead ends: 40 [2018-10-02 12:08:05,790 INFO L226 Difference]: Without dead ends: 31 [2018-10-02 12:08:05,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:08:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-02 12:08:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-10-02 12:08:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-02 12:08:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-10-02 12:08:05,798 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-10-02 12:08:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:05,798 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-10-02 12:08:05,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:08:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-10-02 12:08:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 12:08:05,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:05,799 INFO L375 BasicCegarLoop]: trace histogram [15, 3, 3, 1, 1, 1] [2018-10-02 12:08:05,800 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:05,800 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:05,800 INFO L82 PathProgramCache]: Analyzing trace with hash 198739950, now seen corresponding path program 5 times [2018-10-02 12:08:05,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:05,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:05,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:05,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:05,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-02 12:08:06,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:06,006 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-02 12:08:06,016 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:08:06,038 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-02 12:08:06,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:06,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-02 12:08:06,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:06,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2018-10-02 12:08:06,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 12:08:06,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 12:08:06,191 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:06,191 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 12 states. [2018-10-02 12:08:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:06,726 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-10-02 12:08:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-02 12:08:06,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-10-02 12:08:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:06,727 INFO L225 Difference]: With dead ends: 60 [2018-10-02 12:08:06,727 INFO L226 Difference]: Without dead ends: 43 [2018-10-02 12:08:06,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:08:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-02 12:08:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-10-02 12:08:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-02 12:08:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-10-02 12:08:06,740 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-10-02 12:08:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:06,740 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-10-02 12:08:06,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 12:08:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-10-02 12:08:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-02 12:08:06,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:06,742 INFO L375 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1] [2018-10-02 12:08:06,742 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:06,742 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1597467349, now seen corresponding path program 6 times [2018-10-02 12:08:06,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:06,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:06,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-10-02 12:08:06,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:06,905 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-02 12:08:06,921 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:06,972 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-02 12:08:06,973 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:06,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 251 proven. 21 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-02 12:08:07,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:07,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-02 12:08:07,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:08:07,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:08:07,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:07,042 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-10-02 12:08:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:07,118 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-10-02 12:08:07,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:08:07,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-10-02 12:08:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:07,119 INFO L225 Difference]: With dead ends: 67 [2018-10-02 12:08:07,119 INFO L226 Difference]: Without dead ends: 40 [2018-10-02 12:08:07,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:08:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-02 12:08:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-02 12:08:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-02 12:08:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-10-02 12:08:07,128 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2018-10-02 12:08:07,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:07,128 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-10-02 12:08:07,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:08:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-10-02 12:08:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 12:08:07,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:07,130 INFO L375 BasicCegarLoop]: trace histogram [28, 4, 4, 1, 1, 1] [2018-10-02 12:08:07,130 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:07,130 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:07,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1404785213, now seen corresponding path program 7 times [2018-10-02 12:08:07,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:07,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:07,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-02 12:08:07,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:07,270 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-02 12:08:07,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:07,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-10-02 12:08:07,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:07,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2018-10-02 12:08:07,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:08:07,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:08:07,480 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:07,480 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 15 states. [2018-10-02 12:08:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:08,791 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-10-02 12:08:08,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 12:08:08,792 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-10-02 12:08:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:08,793 INFO L225 Difference]: With dead ends: 93 [2018-10-02 12:08:08,793 INFO L226 Difference]: Without dead ends: 63 [2018-10-02 12:08:08,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime [2018-10-02 12:08:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-02 12:08:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-10-02 12:08:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-02 12:08:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-10-02 12:08:08,806 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-10-02 12:08:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:08,807 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-10-02 12:08:08,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:08:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-10-02 12:08:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-02 12:08:08,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:08,809 INFO L375 BasicCegarLoop]: trace histogram [40, 5, 5, 1, 1, 1] [2018-10-02 12:08:08,809 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:08,809 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:08,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1154943019, now seen corresponding path program 8 times [2018-10-02 12:08:08,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:08,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:08,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:08,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:08,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 825 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-10-02 12:08:08,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:08,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 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-02 12:08:08,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:08:09,024 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:08:09,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:09,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-10-02 12:08:09,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:09,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2018-10-02 12:08:09,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:08:09,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:08:09,463 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:09,463 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 17 states. [2018-10-02 12:08:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:11,620 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-10-02 12:08:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-02 12:08:11,620 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-10-02 12:08:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:11,621 INFO L225 Difference]: With dead ends: 123 [2018-10-02 12:08:11,621 INFO L226 Difference]: Without dead ends: 80 [2018-10-02 12:08:11,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.5s impTime [2018-10-02 12:08:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-02 12:08:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-10-02 12:08:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-02 12:08:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-10-02 12:08:11,636 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 53 [2018-10-02 12:08:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:11,637 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-10-02 12:08:11,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:08:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-10-02 12:08:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-02 12:08:11,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:11,639 INFO L375 BasicCegarLoop]: trace histogram [54, 6, 6, 1, 1, 1] [2018-10-02 12:08:11,640 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:11,640 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2076506525, now seen corresponding path program 9 times [2018-10-02 12:08:11,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:11,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:11,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:11,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:11,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-10-02 12:08:11,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:11,857 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-02 12:08:11,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:08:11,898 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-02 12:08:11,898 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:11,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-02 12:08:12,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:12,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 19 [2018-10-02 12:08:12,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 12:08:12,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 12:08:12,050 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:12,050 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 19 states. [2018-10-02 12:08:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:14,279 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-10-02 12:08:14,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-02 12:08:14,279 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-10-02 12:08:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:14,280 INFO L225 Difference]: With dead ends: 157 [2018-10-02 12:08:14,280 INFO L226 Difference]: Without dead ends: 99 [2018-10-02 12:08:14,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime [2018-10-02 12:08:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-02 12:08:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-10-02 12:08:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-02 12:08:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-10-02 12:08:14,296 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 69 [2018-10-02 12:08:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:14,297 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-10-02 12:08:14,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 12:08:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-10-02 12:08:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-02 12:08:14,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:14,298 INFO L375 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-10-02 12:08:14,299 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:14,299 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 10 times [2018-10-02 12:08:14,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:14,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:14,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:14,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:14,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-02 12:08:14,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:14,462 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-02 12:08:14,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:08:14,549 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:08:14,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:14,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-02 12:08:14,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:14,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-02 12:08:14,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:08:14,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:08:14,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:14,942 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2018-10-02 12:08:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:15,077 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-10-02 12:08:15,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:08:15,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-10-02 12:08:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:15,079 INFO L225 Difference]: With dead ends: 113 [2018-10-02 12:08:15,079 INFO L226 Difference]: Without dead ends: 111 [2018-10-02 12:08:15,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime [2018-10-02 12:08:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-02 12:08:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-10-02 12:08:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-02 12:08:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-10-02 12:08:15,102 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-10-02 12:08:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:15,103 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-10-02 12:08:15,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:08:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-10-02 12:08:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-02 12:08:15,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:15,124 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-10-02 12:08:15,124 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:15,126 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 11 times [2018-10-02 12:08:15,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:15,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:15,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-02 12:08:15,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:15,484 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-02 12:08:15,493 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:08:15,571 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-02 12:08:15,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:15,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-02 12:08:15,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:15,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-02 12:08:15,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:08:15,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:08:15,776 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:15,776 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2018-10-02 12:08:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:15,951 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-10-02 12:08:15,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:08:15,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-10-02 12:08:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:15,953 INFO L225 Difference]: With dead ends: 125 [2018-10-02 12:08:15,953 INFO L226 Difference]: Without dead ends: 123 [2018-10-02 12:08:15,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:08:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-02 12:08:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-10-02 12:08:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-02 12:08:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-10-02 12:08:15,976 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-10-02 12:08:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:15,977 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-10-02 12:08:15,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:08:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-10-02 12:08:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-02 12:08:15,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:15,979 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-10-02 12:08:15,979 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:15,979 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 12 times [2018-10-02 12:08:15,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:15,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:15,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:15,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:15,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-02 12:08:16,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:16,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 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-02 12:08:16,247 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:08:16,393 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-10-02 12:08:16,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:16,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-02 12:08:16,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:16,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-02 12:08:16,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 12:08:16,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 12:08:16,701 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:16,701 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2018-10-02 12:08:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:16,920 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-10-02 12:08:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:08:16,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-10-02 12:08:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:16,923 INFO L225 Difference]: With dead ends: 137 [2018-10-02 12:08:16,924 INFO L226 Difference]: Without dead ends: 135 [2018-10-02 12:08:16,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime [2018-10-02 12:08:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-02 12:08:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-10-02 12:08:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-02 12:08:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-10-02 12:08:16,955 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-10-02 12:08:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:16,956 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-10-02 12:08:16,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 12:08:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-10-02 12:08:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-02 12:08:16,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:16,962 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-10-02 12:08:16,963 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:16,963 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:16,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 13 times [2018-10-02 12:08:16,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:16,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:16,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-10-02 12:08:17,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:17,183 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-02 12:08:17,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:17,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-10-02 12:08:17,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:17,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-02 12:08:17,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:08:17,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:08:17,500 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:17,500 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2018-10-02 12:08:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:17,745 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-10-02 12:08:17,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:08:17,746 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-10-02 12:08:17,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:17,747 INFO L225 Difference]: With dead ends: 149 [2018-10-02 12:08:17,747 INFO L226 Difference]: Without dead ends: 147 [2018-10-02 12:08:17,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime [2018-10-02 12:08:17,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-02 12:08:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-10-02 12:08:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-02 12:08:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-10-02 12:08:17,773 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2018-10-02 12:08:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:17,773 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-10-02 12:08:17,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:08:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-10-02 12:08:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-02 12:08:17,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:17,775 INFO L375 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2018-10-02 12:08:17,775 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:17,776 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash 804391985, now seen corresponding path program 14 times [2018-10-02 12:08:17,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:17,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:17,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:17,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:17,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-10-02 12:08:17,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:17,998 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:08:18,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:08:18,084 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:08:18,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:18,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-10-02 12:08:18,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:18,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-02 12:08:18,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:08:18,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:08:18,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:18,356 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2018-10-02 12:08:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:18,565 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-10-02 12:08:18,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:08:18,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2018-10-02 12:08:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:18,567 INFO L225 Difference]: With dead ends: 161 [2018-10-02 12:08:18,567 INFO L226 Difference]: Without dead ends: 159 [2018-10-02 12:08:18,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime [2018-10-02 12:08:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-02 12:08:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-10-02 12:08:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-02 12:08:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-10-02 12:08:18,588 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2018-10-02 12:08:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:18,588 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-10-02 12:08:18,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:08:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-10-02 12:08:18,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-02 12:08:18,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:18,591 INFO L375 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2018-10-02 12:08:18,591 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:18,591 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:18,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1919127163, now seen corresponding path program 15 times [2018-10-02 12:08:18,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:18,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:18,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:18,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:18,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-10-02 12:08:19,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:19,359 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-02 12:08:19,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:08:19,542 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-10-02 12:08:19,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:19,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-10-02 12:08:19,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:19,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-02 12:08:19,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:08:19,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:08:19,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:19,870 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2018-10-02 12:08:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:20,040 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-10-02 12:08:20,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:08:20,041 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-10-02 12:08:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:20,042 INFO L225 Difference]: With dead ends: 173 [2018-10-02 12:08:20,042 INFO L226 Difference]: Without dead ends: 171 [2018-10-02 12:08:20,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.4s impTime [2018-10-02 12:08:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-02 12:08:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-10-02 12:08:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-02 12:08:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2018-10-02 12:08:20,072 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2018-10-02 12:08:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:20,073 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2018-10-02 12:08:20,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:08:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2018-10-02 12:08:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-02 12:08:20,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:20,075 INFO L375 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2018-10-02 12:08:20,075 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:20,075 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash 243397061, now seen corresponding path program 16 times [2018-10-02 12:08:20,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:20,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:20,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:20,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:20,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-10-02 12:08:20,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:20,496 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-02 12:08:20,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:08:20,597 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:08:20,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:20,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-10-02 12:08:20,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:20,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-02 12:08:20,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:08:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:08:20,920 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:20,920 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2018-10-02 12:08:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:21,146 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-10-02 12:08:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:08:21,146 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-10-02 12:08:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:21,147 INFO L225 Difference]: With dead ends: 185 [2018-10-02 12:08:21,147 INFO L226 Difference]: Without dead ends: 183 [2018-10-02 12:08:21,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime [2018-10-02 12:08:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-02 12:08:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-10-02 12:08:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-02 12:08:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-10-02 12:08:21,176 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2018-10-02 12:08:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:21,176 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-10-02 12:08:21,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:08:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-10-02 12:08:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-02 12:08:21,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:21,178 INFO L375 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2018-10-02 12:08:21,178 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:21,179 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash 184792591, now seen corresponding path program 17 times [2018-10-02 12:08:21,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:21,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:21,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:21,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:21,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-10-02 12:08:21,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:21,885 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:08:21,907 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:08:22,102 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2018-10-02 12:08:22,102 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:22,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-10-02 12:08:22,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:22,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-02 12:08:22,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:08:22,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:08:22,460 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:22,460 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2018-10-02 12:08:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:22,690 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-10-02 12:08:22,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:08:22,690 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2018-10-02 12:08:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:22,691 INFO L225 Difference]: With dead ends: 197 [2018-10-02 12:08:22,692 INFO L226 Difference]: Without dead ends: 195 [2018-10-02 12:08:22,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime [2018-10-02 12:08:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-02 12:08:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-10-02 12:08:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-02 12:08:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2018-10-02 12:08:22,725 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2018-10-02 12:08:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:22,725 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2018-10-02 12:08:22,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:08:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2018-10-02 12:08:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-02 12:08:22,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:22,727 INFO L375 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2018-10-02 12:08:22,727 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:22,727 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1864410279, now seen corresponding path program 18 times [2018-10-02 12:08:22,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:22,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:22,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:22,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:22,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-10-02 12:08:23,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:23,056 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-02 12:08:23,064 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:08:23,535 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) [2018-10-02 12:08:23,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:23,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-10-02 12:08:24,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:24,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-02 12:08:24,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:08:24,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:08:24,119 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:24,119 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2018-10-02 12:08:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:24,384 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-10-02 12:08:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:08:24,384 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-10-02 12:08:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:24,385 INFO L225 Difference]: With dead ends: 209 [2018-10-02 12:08:24,385 INFO L226 Difference]: Without dead ends: 207 [2018-10-02 12:08:24,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.1s impTime [2018-10-02 12:08:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-02 12:08:24,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2018-10-02 12:08:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-02 12:08:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2018-10-02 12:08:24,422 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2018-10-02 12:08:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:24,423 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2018-10-02 12:08:24,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:08:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2018-10-02 12:08:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-02 12:08:24,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:24,424 INFO L375 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2018-10-02 12:08:24,424 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:24,425 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1957994077, now seen corresponding path program 19 times [2018-10-02 12:08:24,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:24,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:24,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-10-02 12:08:25,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:25,151 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-02 12:08:25,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:25,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-10-02 12:08:25,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:25,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-02 12:08:25,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 12:08:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 12:08:25,601 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:25,601 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2018-10-02 12:08:25,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:25,839 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-10-02 12:08:25,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 12:08:25,840 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2018-10-02 12:08:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:25,841 INFO L225 Difference]: With dead ends: 221 [2018-10-02 12:08:25,841 INFO L226 Difference]: Without dead ends: 219 [2018-10-02 12:08:25,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime [2018-10-02 12:08:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-02 12:08:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2018-10-02 12:08:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-02 12:08:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-10-02 12:08:25,879 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2018-10-02 12:08:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:25,879 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-10-02 12:08:25,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 12:08:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-10-02 12:08:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-02 12:08:25,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:25,881 INFO L375 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2018-10-02 12:08:25,881 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:25,881 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1203652845, now seen corresponding path program 20 times [2018-10-02 12:08:25,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:25,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:25,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-10-02 12:08:26,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:26,660 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-02 12:08:26,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:08:26,778 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:08:26,778 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:26,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-10-02 12:08:27,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:27,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-02 12:08:27,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 12:08:27,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 12:08:27,174 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:27,174 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2018-10-02 12:08:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:27,423 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-10-02 12:08:27,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 12:08:27,424 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-10-02 12:08:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:27,426 INFO L225 Difference]: With dead ends: 233 [2018-10-02 12:08:27,426 INFO L226 Difference]: Without dead ends: 231 [2018-10-02 12:08:27,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.4s impTime [2018-10-02 12:08:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-02 12:08:27,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-10-02 12:08:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-02 12:08:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-10-02 12:08:27,475 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2018-10-02 12:08:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:27,475 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-10-02 12:08:27,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 12:08:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-10-02 12:08:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-02 12:08:27,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:27,477 INFO L375 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2018-10-02 12:08:27,477 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:27,477 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:27,477 INFO L82 PathProgramCache]: Analyzing trace with hash 367956279, now seen corresponding path program 21 times [2018-10-02 12:08:27,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:27,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:27,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:27,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:27,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-02 12:08:27,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:27,842 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:08:27,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:08:28,121 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 109 check-sat command(s) [2018-10-02 12:08:28,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:28,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-02 12:08:28,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:28,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-02 12:08:28,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 12:08:28,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 12:08:28,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:28,642 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2018-10-02 12:08:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:29,019 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-10-02 12:08:29,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 12:08:29,019 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2018-10-02 12:08:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:29,020 INFO L225 Difference]: With dead ends: 245 [2018-10-02 12:08:29,020 INFO L226 Difference]: Without dead ends: 243 [2018-10-02 12:08:29,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.1s impTime [2018-10-02 12:08:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-02 12:08:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-10-02 12:08:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-02 12:08:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-10-02 12:08:29,067 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2018-10-02 12:08:29,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:29,068 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-10-02 12:08:29,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 12:08:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-10-02 12:08:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-02 12:08:29,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:29,070 INFO L375 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2018-10-02 12:08:29,070 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:29,070 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash -405620095, now seen corresponding path program 22 times [2018-10-02 12:08:29,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:29,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:29,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:29,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:29,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-10-02 12:08:29,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:29,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 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-02 12:08:29,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:08:30,111 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:08:30,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:30,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-10-02 12:08:30,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:30,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-02 12:08:30,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-02 12:08:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-02 12:08:30,528 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:30,529 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2018-10-02 12:08:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:30,770 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-10-02 12:08:30,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 12:08:30,777 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2018-10-02 12:08:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:30,778 INFO L225 Difference]: With dead ends: 257 [2018-10-02 12:08:30,779 INFO L226 Difference]: Without dead ends: 255 [2018-10-02 12:08:30,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.5s impTime [2018-10-02 12:08:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-02 12:08:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2018-10-02 12:08:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-02 12:08:30,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-10-02 12:08:30,844 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2018-10-02 12:08:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:30,844 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-10-02 12:08:30,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-02 12:08:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-10-02 12:08:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-02 12:08:30,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:30,846 INFO L375 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2018-10-02 12:08:30,846 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:30,846 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:30,847 INFO L82 PathProgramCache]: Analyzing trace with hash -241089333, now seen corresponding path program 23 times [2018-10-02 12:08:30,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:30,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:30,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:30,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:30,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-10-02 12:08:31,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:31,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 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-02 12:08:31,214 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:08:31,490 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 121 check-sat command(s) [2018-10-02 12:08:31,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:31,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-10-02 12:08:31,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:31,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-02 12:08:31,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-02 12:08:31,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-02 12:08:31,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:31,964 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2018-10-02 12:08:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:32,287 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-10-02 12:08:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:08:32,288 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2018-10-02 12:08:32,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:32,289 INFO L225 Difference]: With dead ends: 269 [2018-10-02 12:08:32,289 INFO L226 Difference]: Without dead ends: 267 [2018-10-02 12:08:32,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime [2018-10-02 12:08:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-02 12:08:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-10-02 12:08:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-02 12:08:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2018-10-02 12:08:32,346 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2018-10-02 12:08:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:32,346 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2018-10-02 12:08:32,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-02 12:08:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2018-10-02 12:08:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-02 12:08:32,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:32,347 INFO L375 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2018-10-02 12:08:32,347 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:32,348 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1238413333, now seen corresponding path program 24 times [2018-10-02 12:08:32,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:32,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:32,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-10-02 12:08:32,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:32,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:08:32,819 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:08:33,126 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 123 check-sat command(s) [2018-10-02 12:08:33,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:33,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-10-02 12:08:33,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:33,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-02 12:08:33,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-02 12:08:33,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-02 12:08:33,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:33,573 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2018-10-02 12:08:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:34,301 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-10-02 12:08:34,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:08:34,301 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2018-10-02 12:08:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:34,303 INFO L225 Difference]: With dead ends: 281 [2018-10-02 12:08:34,303 INFO L226 Difference]: Without dead ends: 279 [2018-10-02 12:08:34,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime [2018-10-02 12:08:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-02 12:08:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-10-02 12:08:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-02 12:08:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2018-10-02 12:08:34,369 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2018-10-02 12:08:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:34,370 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2018-10-02 12:08:34,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-02 12:08:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2018-10-02 12:08:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-02 12:08:34,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:34,371 INFO L375 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2018-10-02 12:08:34,372 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:34,372 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:34,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1994949537, now seen corresponding path program 25 times [2018-10-02 12:08:34,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:34,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:34,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:34,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:34,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-10-02 12:08:35,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:35,198 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-02 12:08:35,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:35,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-10-02 12:08:37,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:37,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-02 12:08:37,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-02 12:08:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-02 12:08:37,150 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:37,150 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2018-10-02 12:08:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:37,440 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2018-10-02 12:08:37,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 12:08:37,441 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2018-10-02 12:08:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:37,442 INFO L225 Difference]: With dead ends: 293 [2018-10-02 12:08:37,443 INFO L226 Difference]: Without dead ends: 291 [2018-10-02 12:08:37,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 0.5s impTime [2018-10-02 12:08:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-02 12:08:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2018-10-02 12:08:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-02 12:08:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-10-02 12:08:37,535 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2018-10-02 12:08:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:37,536 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-10-02 12:08:37,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-02 12:08:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-10-02 12:08:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-02 12:08:37,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:37,538 INFO L375 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2018-10-02 12:08:37,538 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:37,538 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1785473449, now seen corresponding path program 26 times [2018-10-02 12:08:37,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:37,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:37,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:37,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-10-02 12:08:38,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:38,147 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-02 12:08:38,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:08:38,304 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:08:38,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:38,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-10-02 12:08:39,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:39,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-02 12:08:39,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-02 12:08:39,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-02 12:08:39,614 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:39,614 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2018-10-02 12:08:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:40,170 INFO L93 Difference]: Finished difference Result 305 states and 330 transitions. [2018-10-02 12:08:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 12:08:40,172 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2018-10-02 12:08:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:40,174 INFO L225 Difference]: With dead ends: 305 [2018-10-02 12:08:40,174 INFO L226 Difference]: Without dead ends: 303 [2018-10-02 12:08:40,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.2s impTime [2018-10-02 12:08:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-02 12:08:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-10-02 12:08:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-02 12:08:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2018-10-02 12:08:40,278 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2018-10-02 12:08:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:40,279 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2018-10-02 12:08:40,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-02 12:08:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2018-10-02 12:08:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-02 12:08:40,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:40,281 INFO L375 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2018-10-02 12:08:40,281 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:40,281 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1795504115, now seen corresponding path program 27 times [2018-10-02 12:08:40,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:40,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:40,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:40,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:40,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-10-02 12:08:41,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:41,325 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-02 12:08:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:08:41,892 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 145 check-sat command(s) [2018-10-02 12:08:41,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:41,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-10-02 12:08:42,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:42,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-02 12:08:42,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-02 12:08:42,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-02 12:08:42,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:42,648 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2018-10-02 12:08:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:43,037 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-10-02 12:08:43,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:08:43,037 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2018-10-02 12:08:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:43,039 INFO L225 Difference]: With dead ends: 317 [2018-10-02 12:08:43,039 INFO L226 Difference]: Without dead ends: 315 [2018-10-02 12:08:43,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.6s impTime [2018-10-02 12:08:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-02 12:08:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2018-10-02 12:08:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-02 12:08:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-10-02 12:08:43,134 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2018-10-02 12:08:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:43,135 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-10-02 12:08:43,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-02 12:08:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-10-02 12:08:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-02 12:08:43,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:43,137 INFO L375 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2018-10-02 12:08:43,137 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:43,137 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:43,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1784227645, now seen corresponding path program 28 times [2018-10-02 12:08:43,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:43,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:43,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:43,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:43,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-10-02 12:08:43,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:43,925 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-02 12:08:43,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:08:44,089 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:08:44,089 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:44,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-10-02 12:08:44,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:44,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-02 12:08:44,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-02 12:08:44,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-02 12:08:44,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:44,845 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2018-10-02 12:08:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:45,218 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-10-02 12:08:45,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 12:08:45,218 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2018-10-02 12:08:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:45,220 INFO L225 Difference]: With dead ends: 329 [2018-10-02 12:08:45,220 INFO L226 Difference]: Without dead ends: 327 [2018-10-02 12:08:45,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.4s impTime [2018-10-02 12:08:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-02 12:08:45,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2018-10-02 12:08:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-02 12:08:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-10-02 12:08:45,314 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2018-10-02 12:08:45,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:45,314 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-10-02 12:08:45,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-02 12:08:45,314 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-10-02 12:08:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-02 12:08:45,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:45,316 INFO L375 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2018-10-02 12:08:45,316 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:45,317 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:45,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1243510663, now seen corresponding path program 29 times [2018-10-02 12:08:45,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:45,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:45,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:45,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:45,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-10-02 12:08:46,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:46,135 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-02 12:08:46,142 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:08:46,558 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 157 check-sat command(s) [2018-10-02 12:08:46,559 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:46,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-10-02 12:08:47,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:47,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-02 12:08:47,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-02 12:08:47,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-02 12:08:47,131 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:47,131 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2018-10-02 12:08:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:47,516 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-10-02 12:08:47,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 12:08:47,517 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2018-10-02 12:08:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:47,518 INFO L225 Difference]: With dead ends: 341 [2018-10-02 12:08:47,518 INFO L226 Difference]: Without dead ends: 339 [2018-10-02 12:08:47,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.4s impTime [2018-10-02 12:08:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-02 12:08:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2018-10-02 12:08:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-02 12:08:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2018-10-02 12:08:47,656 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2018-10-02 12:08:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:47,656 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-10-02 12:08:47,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-02 12:08:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2018-10-02 12:08:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-02 12:08:47,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:47,659 INFO L375 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2018-10-02 12:08:47,659 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:47,659 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:47,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1907644207, now seen corresponding path program 30 times [2018-10-02 12:08:47,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:47,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:47,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:47,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:47,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-10-02 12:08:49,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:49,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:08:49,031 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:08:49,482 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 158 check-sat command(s) [2018-10-02 12:08:49,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:49,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-10-02 12:08:50,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:50,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-02 12:08:50,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-02 12:08:50,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-02 12:08:50,081 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:50,081 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2018-10-02 12:08:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:50,562 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-10-02 12:08:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 12:08:50,563 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2018-10-02 12:08:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:50,564 INFO L225 Difference]: With dead ends: 353 [2018-10-02 12:08:50,564 INFO L226 Difference]: Without dead ends: 351 [2018-10-02 12:08:50,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.9s impTime [2018-10-02 12:08:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-02 12:08:50,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2018-10-02 12:08:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-02 12:08:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-10-02 12:08:50,667 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2018-10-02 12:08:50,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:50,668 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-10-02 12:08:50,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-02 12:08:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-10-02 12:08:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-02 12:08:50,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:50,670 INFO L375 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2018-10-02 12:08:50,670 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:50,670 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:50,670 INFO L82 PathProgramCache]: Analyzing trace with hash -48809189, now seen corresponding path program 31 times [2018-10-02 12:08:50,670 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:50,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:50,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-10-02 12:08:51,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:51,443 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-02 12:08:51,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:51,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-10-02 12:08:52,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:52,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-02 12:08:52,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-02 12:08:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-02 12:08:52,255 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:52,255 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2018-10-02 12:08:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:52,691 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-10-02 12:08:52,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 12:08:52,691 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2018-10-02 12:08:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:52,693 INFO L225 Difference]: With dead ends: 365 [2018-10-02 12:08:52,693 INFO L226 Difference]: Without dead ends: 363 [2018-10-02 12:08:52,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.4s impTime [2018-10-02 12:08:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-02 12:08:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2018-10-02 12:08:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-10-02 12:08:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2018-10-02 12:08:52,821 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2018-10-02 12:08:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:52,822 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2018-10-02 12:08:52,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-02 12:08:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2018-10-02 12:08:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-02 12:08:52,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:52,824 INFO L375 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2018-10-02 12:08:52,824 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:52,824 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1056419429, now seen corresponding path program 32 times [2018-10-02 12:08:52,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:52,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:52,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:52,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:52,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-10-02 12:08:53,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:53,445 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:08:53,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:08:53,633 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:08:53,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:53,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-10-02 12:08:54,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:54,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-02 12:08:54,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-02 12:08:54,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-02 12:08:54,522 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:54,523 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2018-10-02 12:08:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:55,003 INFO L93 Difference]: Finished difference Result 377 states and 408 transitions. [2018-10-02 12:08:55,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 12:08:55,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2018-10-02 12:08:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:55,005 INFO L225 Difference]: With dead ends: 377 [2018-10-02 12:08:55,005 INFO L226 Difference]: Without dead ends: 375 [2018-10-02 12:08:55,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.3s impTime [2018-10-02 12:08:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-02 12:08:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2018-10-02 12:08:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-02 12:08:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2018-10-02 12:08:55,129 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2018-10-02 12:08:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:55,129 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2018-10-02 12:08:55,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-02 12:08:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2018-10-02 12:08:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-02 12:08:55,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:55,131 INFO L375 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2018-10-02 12:08:55,132 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:55,132 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2124645039, now seen corresponding path program 33 times [2018-10-02 12:08:55,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:55,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:55,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:55,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:55,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-10-02 12:08:55,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:55,764 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-02 12:08:55,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:08:56,334 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 181 check-sat command(s) [2018-10-02 12:08:56,334 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:56,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-10-02 12:08:57,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:57,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-02 12:08:57,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-02 12:08:57,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-02 12:08:57,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:57,072 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2018-10-02 12:08:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:57,483 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-10-02 12:08:57,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-02 12:08:57,483 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2018-10-02 12:08:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:57,485 INFO L225 Difference]: With dead ends: 389 [2018-10-02 12:08:57,485 INFO L226 Difference]: Without dead ends: 387 [2018-10-02 12:08:57,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.3s impTime [2018-10-02 12:08:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-02 12:08:57,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-10-02 12:08:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-02 12:08:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2018-10-02 12:08:57,604 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2018-10-02 12:08:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:57,604 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2018-10-02 12:08:57,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-02 12:08:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2018-10-02 12:08:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-02 12:08:57,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:57,607 INFO L375 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2018-10-02 12:08:57,607 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:57,607 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:57,607 INFO L82 PathProgramCache]: Analyzing trace with hash 152123385, now seen corresponding path program 34 times [2018-10-02 12:08:57,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:57,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:57,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:57,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:57,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-10-02 12:08:58,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:58,530 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-02 12:08:58,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:08:58,744 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:08:58,744 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:58,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-10-02 12:08:59,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:59,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-02 12:08:59,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-02 12:08:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-02 12:08:59,401 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:59,401 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2018-10-02 12:09:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:00,005 INFO L93 Difference]: Finished difference Result 401 states and 434 transitions. [2018-10-02 12:09:00,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 12:09:00,005 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2018-10-02 12:09:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:00,007 INFO L225 Difference]: With dead ends: 401 [2018-10-02 12:09:00,007 INFO L226 Difference]: Without dead ends: 399 [2018-10-02 12:09:00,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.5s impTime [2018-10-02 12:09:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-02 12:09:00,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2018-10-02 12:09:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-02 12:09:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2018-10-02 12:09:00,147 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2018-10-02 12:09:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:00,147 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2018-10-02 12:09:00,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-02 12:09:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2018-10-02 12:09:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-02 12:09:00,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:00,150 INFO L375 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2018-10-02 12:09:00,150 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:00,150 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:00,150 INFO L82 PathProgramCache]: Analyzing trace with hash -310948285, now seen corresponding path program 35 times [2018-10-02 12:09:00,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:00,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:00,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:00,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:00,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-10-02 12:09:01,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:01,110 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-02 12:09:01,120 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:09:01,724 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 193 check-sat command(s) [2018-10-02 12:09:01,725 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:01,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-10-02 12:09:02,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:02,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-02 12:09:02,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-02 12:09:02,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-02 12:09:02,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:02,396 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2018-10-02 12:09:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:02,921 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-10-02 12:09:02,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-02 12:09:02,922 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2018-10-02 12:09:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:02,923 INFO L225 Difference]: With dead ends: 413 [2018-10-02 12:09:02,924 INFO L226 Difference]: Without dead ends: 411 [2018-10-02 12:09:02,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.5s impTime [2018-10-02 12:09:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-02 12:09:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2018-10-02 12:09:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-02 12:09:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2018-10-02 12:09:03,068 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2018-10-02 12:09:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:03,068 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2018-10-02 12:09:03,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-02 12:09:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2018-10-02 12:09:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-02 12:09:03,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:03,071 INFO L375 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2018-10-02 12:09:03,071 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:03,071 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1655945843, now seen corresponding path program 36 times [2018-10-02 12:09:03,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:03,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:03,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:03,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:03,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-10-02 12:09:03,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:03,799 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-02 12:09:03,806 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:09:04,461 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 195 check-sat command(s) [2018-10-02 12:09:04,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:04,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-10-02 12:09:05,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:05,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-02 12:09:05,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-02 12:09:05,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-02 12:09:05,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:05,536 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2018-10-02 12:09:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:06,056 INFO L93 Difference]: Finished difference Result 425 states and 460 transitions. [2018-10-02 12:09:06,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-02 12:09:06,056 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2018-10-02 12:09:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:06,058 INFO L225 Difference]: With dead ends: 425 [2018-10-02 12:09:06,058 INFO L226 Difference]: Without dead ends: 423 [2018-10-02 12:09:06,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.3s impTime [2018-10-02 12:09:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-02 12:09:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2018-10-02 12:09:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-02 12:09:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2018-10-02 12:09:06,194 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2018-10-02 12:09:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:06,195 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2018-10-02 12:09:06,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-02 12:09:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2018-10-02 12:09:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-02 12:09:06,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:06,197 INFO L375 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2018-10-02 12:09:06,197 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:06,198 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:06,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1941529129, now seen corresponding path program 37 times [2018-10-02 12:09:06,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:06,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:06,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-10-02 12:09:07,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:07,194 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-02 12:09:07,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:07,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-10-02 12:09:08,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:08,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-02 12:09:08,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-02 12:09:08,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-02 12:09:08,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:08,121 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2018-10-02 12:09:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:08,756 INFO L93 Difference]: Finished difference Result 437 states and 473 transitions. [2018-10-02 12:09:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-02 12:09:08,756 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2018-10-02 12:09:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:08,758 INFO L225 Difference]: With dead ends: 437 [2018-10-02 12:09:08,758 INFO L226 Difference]: Without dead ends: 435 [2018-10-02 12:09:08,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.5s impTime [2018-10-02 12:09:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-02 12:09:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-10-02 12:09:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-02 12:09:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-10-02 12:09:08,914 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2018-10-02 12:09:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:08,914 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-10-02 12:09:08,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-02 12:09:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-10-02 12:09:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-10-02 12:09:08,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:08,917 INFO L375 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2018-10-02 12:09:08,917 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:08,917 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash -799221983, now seen corresponding path program 38 times [2018-10-02 12:09:08,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:08,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:08,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-10-02 12:09:10,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:10,073 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-02 12:09:10,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:09:10,300 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:09:10,300 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:10,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-10-02 12:09:12,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:12,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-02 12:09:12,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-02 12:09:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-02 12:09:12,056 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:12,056 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2018-10-02 12:09:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:12,651 INFO L93 Difference]: Finished difference Result 449 states and 486 transitions. [2018-10-02 12:09:12,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-02 12:09:12,652 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2018-10-02 12:09:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:12,653 INFO L225 Difference]: With dead ends: 449 [2018-10-02 12:09:12,653 INFO L226 Difference]: Without dead ends: 447 [2018-10-02 12:09:12,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 0.7s impTime [2018-10-02 12:09:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-02 12:09:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2018-10-02 12:09:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-02 12:09:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2018-10-02 12:09:12,825 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2018-10-02 12:09:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:12,825 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2018-10-02 12:09:12,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-02 12:09:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2018-10-02 12:09:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-02 12:09:12,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:12,828 INFO L375 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2018-10-02 12:09:12,828 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:12,828 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1044024981, now seen corresponding path program 39 times [2018-10-02 12:09:12,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:12,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:12,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:12,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-02 12:09:13,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:13,516 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-02 12:09:13,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:09:14,260 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 217 check-sat command(s) [2018-10-02 12:09:14,261 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:14,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-02 12:09:15,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:15,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-02 12:09:15,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-02 12:09:15,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-02 12:09:15,181 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:15,181 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2018-10-02 12:09:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:15,756 INFO L93 Difference]: Finished difference Result 461 states and 499 transitions. [2018-10-02 12:09:15,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 12:09:15,757 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2018-10-02 12:09:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:15,758 INFO L225 Difference]: With dead ends: 461 [2018-10-02 12:09:15,759 INFO L226 Difference]: Without dead ends: 459 [2018-10-02 12:09:15,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.2s impTime [2018-10-02 12:09:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-02 12:09:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2018-10-02 12:09:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-10-02 12:09:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2018-10-02 12:09:15,921 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2018-10-02 12:09:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:15,922 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2018-10-02 12:09:15,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-02 12:09:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2018-10-02 12:09:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-10-02 12:09:15,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:15,924 INFO L375 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2018-10-02 12:09:15,924 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:15,924 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:15,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1695093579, now seen corresponding path program 40 times [2018-10-02 12:09:15,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:15,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:15,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:15,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:15,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-10-02 12:09:16,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:16,754 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-02 12:09:16,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:09:16,998 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:09:16,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:17,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-10-02 12:09:17,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:17,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-02 12:09:17,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-02 12:09:17,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-02 12:09:17,822 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:17,822 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2018-10-02 12:09:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:18,442 INFO L93 Difference]: Finished difference Result 473 states and 512 transitions. [2018-10-02 12:09:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 12:09:18,442 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2018-10-02 12:09:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:18,444 INFO L225 Difference]: With dead ends: 473 [2018-10-02 12:09:18,444 INFO L226 Difference]: Without dead ends: 471 [2018-10-02 12:09:18,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime [2018-10-02 12:09:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-02 12:09:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2018-10-02 12:09:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-02 12:09:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2018-10-02 12:09:18,619 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2018-10-02 12:09:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:18,619 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2018-10-02 12:09:18,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-02 12:09:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2018-10-02 12:09:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-02 12:09:18,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:18,622 INFO L375 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2018-10-02 12:09:18,622 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:18,622 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash 413649151, now seen corresponding path program 41 times [2018-10-02 12:09:18,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:18,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:18,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:18,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-10-02 12:09:19,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:19,438 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:09:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:09:20,265 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 229 check-sat command(s) [2018-10-02 12:09:20,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:20,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-10-02 12:09:21,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:21,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-02 12:09:21,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-02 12:09:21,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-02 12:09:21,147 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:21,147 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2018-10-02 12:09:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:21,947 INFO L93 Difference]: Finished difference Result 485 states and 525 transitions. [2018-10-02 12:09:21,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-02 12:09:21,947 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2018-10-02 12:09:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:21,949 INFO L225 Difference]: With dead ends: 485 [2018-10-02 12:09:21,949 INFO L226 Difference]: Without dead ends: 483 [2018-10-02 12:09:21,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime [2018-10-02 12:09:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-10-02 12:09:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2018-10-02 12:09:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-02 12:09:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2018-10-02 12:09:22,130 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2018-10-02 12:09:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:22,130 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2018-10-02 12:09:22,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-02 12:09:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2018-10-02 12:09:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-10-02 12:09:22,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:22,133 INFO L375 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2018-10-02 12:09:22,133 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:22,133 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash 432965193, now seen corresponding path program 42 times [2018-10-02 12:09:22,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:22,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:22,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-10-02 12:09:22,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:22,774 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-02 12:09:22,781 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:09:23,609 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 230 check-sat command(s) [2018-10-02 12:09:23,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:23,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-10-02 12:09:24,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:24,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-02 12:09:24,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-02 12:09:24,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-02 12:09:24,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:24,451 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2018-10-02 12:09:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:25,204 INFO L93 Difference]: Finished difference Result 497 states and 538 transitions. [2018-10-02 12:09:25,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-02 12:09:25,204 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2018-10-02 12:09:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:25,206 INFO L225 Difference]: With dead ends: 497 [2018-10-02 12:09:25,206 INFO L226 Difference]: Without dead ends: 495 [2018-10-02 12:09:25,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.2s impTime [2018-10-02 12:09:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-02 12:09:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2018-10-02 12:09:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-02 12:09:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2018-10-02 12:09:25,402 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2018-10-02 12:09:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:25,402 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2018-10-02 12:09:25,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-02 12:09:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2018-10-02 12:09:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-10-02 12:09:25,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:25,404 INFO L375 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2018-10-02 12:09:25,404 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:25,404 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:25,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1067558035, now seen corresponding path program 43 times [2018-10-02 12:09:25,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:25,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:25,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:25,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:25,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-10-02 12:09:26,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:26,484 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-02 12:09:26,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:26,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-10-02 12:09:27,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:27,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-02 12:09:27,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-02 12:09:27,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-02 12:09:27,618 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:27,618 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2018-10-02 12:09:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:28,305 INFO L93 Difference]: Finished difference Result 509 states and 551 transitions. [2018-10-02 12:09:28,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 12:09:28,305 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2018-10-02 12:09:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:28,307 INFO L225 Difference]: With dead ends: 509 [2018-10-02 12:09:28,307 INFO L226 Difference]: Without dead ends: 507 [2018-10-02 12:09:28,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.5s impTime [2018-10-02 12:09:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-10-02 12:09:28,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2018-10-02 12:09:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-10-02 12:09:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2018-10-02 12:09:28,506 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2018-10-02 12:09:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:28,506 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2018-10-02 12:09:28,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-02 12:09:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2018-10-02 12:09:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-10-02 12:09:28,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:28,508 INFO L375 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2018-10-02 12:09:28,509 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:28,509 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1919441955, now seen corresponding path program 44 times [2018-10-02 12:09:28,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:28,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:28,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:28,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-10-02 12:09:29,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:29,435 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-02 12:09:29,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:09:29,702 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:09:29,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:29,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-10-02 12:09:30,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:30,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-02 12:09:30,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-02 12:09:30,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-02 12:09:30,855 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:30,855 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2018-10-02 12:09:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:31,544 INFO L93 Difference]: Finished difference Result 521 states and 564 transitions. [2018-10-02 12:09:31,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-02 12:09:31,545 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2018-10-02 12:09:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:31,546 INFO L225 Difference]: With dead ends: 521 [2018-10-02 12:09:31,546 INFO L226 Difference]: Without dead ends: 519 [2018-10-02 12:09:31,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.4s impTime [2018-10-02 12:09:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-10-02 12:09:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2018-10-02 12:09:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-10-02 12:09:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2018-10-02 12:09:31,758 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2018-10-02 12:09:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:31,759 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2018-10-02 12:09:31,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-02 12:09:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2018-10-02 12:09:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-10-02 12:09:31,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:31,761 INFO L375 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2018-10-02 12:09:31,761 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:31,761 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash 157746215, now seen corresponding path program 45 times [2018-10-02 12:09:31,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:31,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-10-02 12:09:32,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:32,564 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-02 12:09:32,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:09:33,699 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 253 check-sat command(s) [2018-10-02 12:09:33,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:33,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-10-02 12:09:34,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:34,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-02 12:09:34,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-02 12:09:34,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-02 12:09:34,653 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:34,653 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2018-10-02 12:09:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:35,570 INFO L93 Difference]: Finished difference Result 533 states and 577 transitions. [2018-10-02 12:09:35,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-02 12:09:35,577 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2018-10-02 12:09:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:35,579 INFO L225 Difference]: With dead ends: 533 [2018-10-02 12:09:35,579 INFO L226 Difference]: Without dead ends: 531 [2018-10-02 12:09:35,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime [2018-10-02 12:09:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-02 12:09:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2018-10-02 12:09:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-02 12:09:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2018-10-02 12:09:35,846 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2018-10-02 12:09:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:35,846 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2018-10-02 12:09:35,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-02 12:09:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2018-10-02 12:09:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-02 12:09:35,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:35,848 INFO L375 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2018-10-02 12:09:35,848 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:35,848 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:35,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1527137649, now seen corresponding path program 46 times [2018-10-02 12:09:35,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:35,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:35,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:35,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:35,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-10-02 12:09:36,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:36,746 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-02 12:09:36,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:09:37,040 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:09:37,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:37,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-10-02 12:09:38,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:38,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-02 12:09:38,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-02 12:09:38,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-02 12:09:38,029 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:38,029 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2018-10-02 12:09:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:38,991 INFO L93 Difference]: Finished difference Result 545 states and 590 transitions. [2018-10-02 12:09:38,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-02 12:09:38,998 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2018-10-02 12:09:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:39,001 INFO L225 Difference]: With dead ends: 545 [2018-10-02 12:09:39,001 INFO L226 Difference]: Without dead ends: 543 [2018-10-02 12:09:39,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.4s impTime [2018-10-02 12:09:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-10-02 12:09:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2018-10-02 12:09:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-10-02 12:09:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2018-10-02 12:09:39,285 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2018-10-02 12:09:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:39,286 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2018-10-02 12:09:39,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-02 12:09:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2018-10-02 12:09:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-10-02 12:09:39,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:39,288 INFO L375 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2018-10-02 12:09:39,288 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:39,288 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1823205307, now seen corresponding path program 47 times [2018-10-02 12:09:39,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:39,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:39,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-10-02 12:09:40,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:40,079 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-02 12:09:40,086 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:09:41,167 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 265 check-sat command(s) [2018-10-02 12:09:41,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:41,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-10-02 12:09:42,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:42,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-02 12:09:42,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-02 12:09:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-02 12:09:42,185 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:42,185 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2018-10-02 12:09:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:43,037 INFO L93 Difference]: Finished difference Result 557 states and 603 transitions. [2018-10-02 12:09:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 12:09:43,038 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2018-10-02 12:09:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:43,040 INFO L225 Difference]: With dead ends: 557 [2018-10-02 12:09:43,040 INFO L226 Difference]: Without dead ends: 555 [2018-10-02 12:09:43,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.3s impTime [2018-10-02 12:09:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-10-02 12:09:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2018-10-02 12:09:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-02 12:09:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2018-10-02 12:09:43,327 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2018-10-02 12:09:43,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:43,327 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2018-10-02 12:09:43,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-02 12:09:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2018-10-02 12:09:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-10-02 12:09:43,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:43,329 INFO L375 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2018-10-02 12:09:43,330 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:43,330 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash 181299973, now seen corresponding path program 48 times [2018-10-02 12:09:43,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:43,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:43,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:43,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:43,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-10-02 12:09:44,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:44,213 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:09:44,244 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:09:45,357 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 267 check-sat command(s) [2018-10-02 12:09:45,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:45,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-10-02 12:09:46,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:46,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-02 12:09:46,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-02 12:09:46,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-02 12:09:46,603 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:46,603 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2018-10-02 12:09:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:47,428 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-10-02 12:09:47,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 12:09:47,428 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2018-10-02 12:09:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:47,430 INFO L225 Difference]: With dead ends: 569 [2018-10-02 12:09:47,430 INFO L226 Difference]: Without dead ends: 567 [2018-10-02 12:09:47,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.4s impTime [2018-10-02 12:09:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-10-02 12:09:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2018-10-02 12:09:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-10-02 12:09:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2018-10-02 12:09:47,708 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2018-10-02 12:09:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:47,709 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2018-10-02 12:09:47,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-02 12:09:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2018-10-02 12:09:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-10-02 12:09:47,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:47,711 INFO L375 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2018-10-02 12:09:47,711 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:47,711 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:47,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2077995185, now seen corresponding path program 49 times [2018-10-02 12:09:47,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:47,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:47,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:47,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:47,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-10-02 12:09:48,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:48,452 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-02 12:09:48,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:48,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-10-02 12:09:49,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:49,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-02 12:09:49,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-02 12:09:49,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-02 12:09:49,857 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:49,857 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2018-10-02 12:09:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:50,720 INFO L93 Difference]: Finished difference Result 581 states and 629 transitions. [2018-10-02 12:09:50,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 12:09:50,720 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2018-10-02 12:09:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:50,723 INFO L225 Difference]: With dead ends: 581 [2018-10-02 12:09:50,723 INFO L226 Difference]: Without dead ends: 579 [2018-10-02 12:09:50,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.2s impTime [2018-10-02 12:09:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-10-02 12:09:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2018-10-02 12:09:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-10-02 12:09:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2018-10-02 12:09:50,997 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2018-10-02 12:09:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:50,997 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2018-10-02 12:09:50,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-02 12:09:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2018-10-02 12:09:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-02 12:09:51,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:51,001 INFO L375 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2018-10-02 12:09:51,001 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:51,001 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1235489945, now seen corresponding path program 50 times [2018-10-02 12:09:51,002 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:51,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:51,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-10-02 12:09:51,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:51,771 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-02 12:09:51,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:09:52,117 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:09:52,117 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:52,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-10-02 12:09:53,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:53,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-02 12:09:53,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-02 12:09:53,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-02 12:09:53,257 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:53,257 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2018-10-02 12:09:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:54,111 INFO L93 Difference]: Finished difference Result 593 states and 642 transitions. [2018-10-02 12:09:54,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-02 12:09:54,111 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2018-10-02 12:09:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:54,113 INFO L225 Difference]: With dead ends: 593 [2018-10-02 12:09:54,113 INFO L226 Difference]: Without dead ends: 591 [2018-10-02 12:09:54,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.2s impTime [2018-10-02 12:09:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-10-02 12:09:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2018-10-02 12:09:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-10-02 12:09:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2018-10-02 12:09:54,398 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2018-10-02 12:09:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:54,398 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2018-10-02 12:09:54,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-02 12:09:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2018-10-02 12:09:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-02 12:09:54,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:54,401 INFO L375 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2018-10-02 12:09:54,401 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:54,401 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:54,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1903936797, now seen corresponding path program 51 times [2018-10-02 12:09:54,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:54,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:54,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:54,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:54,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-10-02 12:09:55,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:55,444 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:09:55,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:09:56,800 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 289 check-sat command(s) [2018-10-02 12:09:56,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:56,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-10-02 12:09:57,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:57,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-02 12:09:57,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-02 12:09:57,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-02 12:09:57,915 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:57,915 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2018-10-02 12:09:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:58,854 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2018-10-02 12:09:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-02 12:09:58,855 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2018-10-02 12:09:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:58,857 INFO L225 Difference]: With dead ends: 605 [2018-10-02 12:09:58,857 INFO L226 Difference]: Without dead ends: 603 [2018-10-02 12:09:58,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.5s impTime [2018-10-02 12:09:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-02 12:09:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2018-10-02 12:09:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-02 12:09:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2018-10-02 12:09:59,157 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2018-10-02 12:09:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:59,158 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2018-10-02 12:09:59,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-02 12:09:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2018-10-02 12:09:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2018-10-02 12:09:59,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:59,160 INFO L375 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2018-10-02 12:09:59,160 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:59,161 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash -398769619, now seen corresponding path program 52 times [2018-10-02 12:09:59,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:59,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:59,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:59,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:59,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-10-02 12:10:00,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:00,289 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-02 12:10:00,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:10:00,614 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:10:00,614 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:00,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-10-02 12:10:02,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:02,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-02 12:10:02,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-02 12:10:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-02 12:10:02,019 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:02,019 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2018-10-02 12:10:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:03,012 INFO L93 Difference]: Finished difference Result 617 states and 668 transitions. [2018-10-02 12:10:03,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-02 12:10:03,013 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2018-10-02 12:10:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:03,015 INFO L225 Difference]: With dead ends: 617 [2018-10-02 12:10:03,015 INFO L226 Difference]: Without dead ends: 615 [2018-10-02 12:10:03,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.5s impTime [2018-10-02 12:10:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-10-02 12:10:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2018-10-02 12:10:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-10-02 12:10:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2018-10-02 12:10:03,355 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2018-10-02 12:10:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:03,355 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2018-10-02 12:10:03,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-02 12:10:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2018-10-02 12:10:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-10-02 12:10:03,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:03,358 INFO L375 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2018-10-02 12:10:03,358 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:03,359 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash -293623177, now seen corresponding path program 53 times [2018-10-02 12:10:03,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:03,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:03,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:03,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:03,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-10-02 12:10:04,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:04,245 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-02 12:10:04,252 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:10:05,640 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 301 check-sat command(s) [2018-10-02 12:10:05,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:05,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-10-02 12:10:07,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:07,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-02 12:10:07,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-02 12:10:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-02 12:10:07,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:07,252 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2018-10-02 12:10:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:08,219 INFO L93 Difference]: Finished difference Result 629 states and 681 transitions. [2018-10-02 12:10:08,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-02 12:10:08,220 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2018-10-02 12:10:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:08,222 INFO L225 Difference]: With dead ends: 629 [2018-10-02 12:10:08,222 INFO L226 Difference]: Without dead ends: 627 [2018-10-02 12:10:08,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.3s impTime [2018-10-02 12:10:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-10-02 12:10:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2018-10-02 12:10:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-10-02 12:10:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2018-10-02 12:10:08,552 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2018-10-02 12:10:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:08,552 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2018-10-02 12:10:08,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-02 12:10:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2018-10-02 12:10:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-10-02 12:10:08,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:08,555 INFO L375 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2018-10-02 12:10:08,555 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:08,555 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:08,555 INFO L82 PathProgramCache]: Analyzing trace with hash -616041535, now seen corresponding path program 54 times [2018-10-02 12:10:08,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:08,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:08,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:08,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:08,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-10-02 12:10:09,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:09,487 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-02 12:10:09,494 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:10:10,942 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 302 check-sat command(s) [2018-10-02 12:10:10,942 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:10,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-10-02 12:10:12,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:12,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-02 12:10:12,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-02 12:10:12,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-02 12:10:12,456 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:12,456 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2018-10-02 12:10:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:13,425 INFO L93 Difference]: Finished difference Result 641 states and 694 transitions. [2018-10-02 12:10:13,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-02 12:10:13,425 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2018-10-02 12:10:13,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:13,428 INFO L225 Difference]: With dead ends: 641 [2018-10-02 12:10:13,428 INFO L226 Difference]: Without dead ends: 639 [2018-10-02 12:10:13,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.3s impTime [2018-10-02 12:10:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-02 12:10:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2018-10-02 12:10:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-02 12:10:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2018-10-02 12:10:13,766 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2018-10-02 12:10:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:13,766 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2018-10-02 12:10:13,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-02 12:10:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2018-10-02 12:10:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-10-02 12:10:13,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:13,769 INFO L375 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2018-10-02 12:10:13,769 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:13,769 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash 717921803, now seen corresponding path program 55 times [2018-10-02 12:10:13,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:13,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:13,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:13,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:13,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-10-02 12:10:14,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:14,722 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:10:14,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:10:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:15,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-10-02 12:10:16,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:16,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-02 12:10:16,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-02 12:10:16,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-02 12:10:16,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:16,298 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2018-10-02 12:10:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:17,686 INFO L93 Difference]: Finished difference Result 653 states and 707 transitions. [2018-10-02 12:10:17,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 12:10:17,686 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2018-10-02 12:10:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:17,689 INFO L225 Difference]: With dead ends: 653 [2018-10-02 12:10:17,689 INFO L226 Difference]: Without dead ends: 651 [2018-10-02 12:10:17,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.4s impTime [2018-10-02 12:10:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-10-02 12:10:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2018-10-02 12:10:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-02 12:10:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2018-10-02 12:10:18,068 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2018-10-02 12:10:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:18,068 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2018-10-02 12:10:18,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-02 12:10:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2018-10-02 12:10:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-02 12:10:18,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:18,071 INFO L375 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2018-10-02 12:10:18,071 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:18,072 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:18,072 INFO L82 PathProgramCache]: Analyzing trace with hash 998123861, now seen corresponding path program 56 times [2018-10-02 12:10:18,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:18,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:18,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:10:18,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-10-02 12:10:19,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:19,091 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-02 12:10:19,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:10:19,440 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:10:19,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:19,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-10-02 12:10:20,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:20,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-02 12:10:20,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-02 12:10:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-02 12:10:20,695 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:20,695 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2018-10-02 12:10:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:21,814 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-10-02 12:10:21,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 12:10:21,814 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2018-10-02 12:10:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:21,816 INFO L225 Difference]: With dead ends: 665 [2018-10-02 12:10:21,817 INFO L226 Difference]: Without dead ends: 663 [2018-10-02 12:10:21,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.4s impTime [2018-10-02 12:10:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-10-02 12:10:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2018-10-02 12:10:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-10-02 12:10:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2018-10-02 12:10:22,200 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2018-10-02 12:10:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:22,200 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2018-10-02 12:10:22,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-02 12:10:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2018-10-02 12:10:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-10-02 12:10:22,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:22,203 INFO L375 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2018-10-02 12:10:22,204 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:22,204 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash -300345953, now seen corresponding path program 57 times [2018-10-02 12:10:22,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:22,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:22,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:22,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-02 12:10:23,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:23,479 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-02 12:10:23,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:10:25,103 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 325 check-sat command(s) [2018-10-02 12:10:25,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:25,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-02 12:10:26,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:26,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-02 12:10:26,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-02 12:10:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-02 12:10:26,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:26,451 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2018-10-02 12:10:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:27,726 INFO L93 Difference]: Finished difference Result 677 states and 733 transitions. [2018-10-02 12:10:27,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-02 12:10:27,726 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2018-10-02 12:10:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:27,728 INFO L225 Difference]: With dead ends: 677 [2018-10-02 12:10:27,728 INFO L226 Difference]: Without dead ends: 675 [2018-10-02 12:10:27,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.6s impTime [2018-10-02 12:10:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-10-02 12:10:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2018-10-02 12:10:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-02 12:10:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2018-10-02 12:10:28,123 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2018-10-02 12:10:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:28,124 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2018-10-02 12:10:28,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-02 12:10:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2018-10-02 12:10:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-10-02 12:10:28,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:28,127 INFO L375 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2018-10-02 12:10:28,127 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:28,127 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:28,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1167188713, now seen corresponding path program 58 times [2018-10-02 12:10:28,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:28,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:28,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:28,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:28,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-10-02 12:10:29,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:29,111 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-02 12:10:29,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:10:29,463 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:10:29,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:29,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-10-02 12:10:30,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:30,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-02 12:10:30,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-02 12:10:30,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-02 12:10:30,791 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:30,791 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2018-10-02 12:10:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:31,895 INFO L93 Difference]: Finished difference Result 689 states and 746 transitions. [2018-10-02 12:10:31,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-02 12:10:31,895 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2018-10-02 12:10:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:31,898 INFO L225 Difference]: With dead ends: 689 [2018-10-02 12:10:31,898 INFO L226 Difference]: Without dead ends: 687 [2018-10-02 12:10:31,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.3s impTime [2018-10-02 12:10:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-02 12:10:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2018-10-02 12:10:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-10-02 12:10:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2018-10-02 12:10:32,295 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2018-10-02 12:10:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:32,296 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2018-10-02 12:10:32,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-02 12:10:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2018-10-02 12:10:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-10-02 12:10:32,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:32,299 INFO L375 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2018-10-02 12:10:32,299 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:32,299 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash 119476531, now seen corresponding path program 59 times [2018-10-02 12:10:32,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:32,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:32,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:32,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:32,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-02 12:10:33,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:33,765 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-02 12:10:33,773 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:10:35,646 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 337 check-sat command(s) [2018-10-02 12:10:35,646 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:35,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-02 12:10:37,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:37,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-02 12:10:37,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-02 12:10:37,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-02 12:10:37,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:37,080 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2018-10-02 12:10:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:38,325 INFO L93 Difference]: Finished difference Result 701 states and 759 transitions. [2018-10-02 12:10:38,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-02 12:10:38,325 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2018-10-02 12:10:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:38,328 INFO L225 Difference]: With dead ends: 701 [2018-10-02 12:10:38,328 INFO L226 Difference]: Without dead ends: 699 [2018-10-02 12:10:38,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 0.7s impTime [2018-10-02 12:10:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-10-02 12:10:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2018-10-02 12:10:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-10-02 12:10:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2018-10-02 12:10:38,756 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2018-10-02 12:10:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:38,756 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2018-10-02 12:10:38,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-02 12:10:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2018-10-02 12:10:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-10-02 12:10:38,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:38,760 INFO L375 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2018-10-02 12:10:38,760 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:38,760 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:38,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1513562237, now seen corresponding path program 60 times [2018-10-02 12:10:38,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:38,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:38,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:38,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:38,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-10-02 12:10:40,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:40,077 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-02 12:10:40,084 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:10:41,938 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 339 check-sat command(s) [2018-10-02 12:10:41,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:41,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-10-02 12:10:43,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:43,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-02 12:10:43,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-02 12:10:43,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-02 12:10:43,446 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:43,446 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2018-10-02 12:10:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:44,703 INFO L93 Difference]: Finished difference Result 713 states and 772 transitions. [2018-10-02 12:10:44,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-02 12:10:44,704 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2018-10-02 12:10:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:44,706 INFO L225 Difference]: With dead ends: 713 [2018-10-02 12:10:44,706 INFO L226 Difference]: Without dead ends: 711 [2018-10-02 12:10:44,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.6s impTime [2018-10-02 12:10:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-10-02 12:10:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2018-10-02 12:10:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-02 12:10:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2018-10-02 12:10:45,175 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2018-10-02 12:10:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:45,176 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2018-10-02 12:10:45,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-02 12:10:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2018-10-02 12:10:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-02 12:10:45,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:45,179 INFO L375 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2018-10-02 12:10:45,180 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:45,180 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1754304711, now seen corresponding path program 61 times [2018-10-02 12:10:45,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:45,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:45,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-10-02 12:10:46,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:46,609 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-02 12:10:46,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:10:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:47,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-10-02 12:10:48,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:48,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-02 12:10:48,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-02 12:10:48,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-02 12:10:48,577 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:48,578 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2018-10-02 12:10:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:49,825 INFO L93 Difference]: Finished difference Result 725 states and 785 transitions. [2018-10-02 12:10:49,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-02 12:10:49,825 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2018-10-02 12:10:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:49,827 INFO L225 Difference]: With dead ends: 725 [2018-10-02 12:10:49,828 INFO L226 Difference]: Without dead ends: 723 [2018-10-02 12:10:49,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 0.6s impTime [2018-10-02 12:10:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-10-02 12:10:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2018-10-02 12:10:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-10-02 12:10:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2018-10-02 12:10:50,314 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2018-10-02 12:10:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:50,314 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2018-10-02 12:10:50,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-02 12:10:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2018-10-02 12:10:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-10-02 12:10:50,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:50,318 INFO L375 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2018-10-02 12:10:50,318 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:50,319 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash -31333871, now seen corresponding path program 62 times [2018-10-02 12:10:50,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:50,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:50,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:10:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-10-02 12:10:51,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:51,461 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-02 12:10:51,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:10:51,848 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:10:51,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:51,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-10-02 12:10:53,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:53,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-02 12:10:53,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-02 12:10:53,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-02 12:10:53,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:53,642 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2018-10-02 12:10:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:54,885 INFO L93 Difference]: Finished difference Result 737 states and 798 transitions. [2018-10-02 12:10:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-02 12:10:54,886 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2018-10-02 12:10:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:54,888 INFO L225 Difference]: With dead ends: 737 [2018-10-02 12:10:54,888 INFO L226 Difference]: Without dead ends: 735 [2018-10-02 12:10:54,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.4s impTime [2018-10-02 12:10:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-10-02 12:10:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2018-10-02 12:10:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-02 12:10:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2018-10-02 12:10:55,354 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2018-10-02 12:10:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:55,355 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2018-10-02 12:10:55,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-02 12:10:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2018-10-02 12:10:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-10-02 12:10:55,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:55,359 INFO L375 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2018-10-02 12:10:55,359 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:55,360 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:55,360 INFO L82 PathProgramCache]: Analyzing trace with hash 690066523, now seen corresponding path program 63 times [2018-10-02 12:10:55,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:55,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:55,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:55,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:55,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-10-02 12:10:56,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:56,513 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-02 12:10:56,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:10:58,542 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 361 check-sat command(s) [2018-10-02 12:10:58,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:58,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-10-02 12:11:00,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:00,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-02 12:11:00,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-02 12:11:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-02 12:11:00,063 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:00,063 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2018-10-02 12:11:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:01,357 INFO L93 Difference]: Finished difference Result 749 states and 811 transitions. [2018-10-02 12:11:01,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-02 12:11:01,357 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2018-10-02 12:11:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:01,360 INFO L225 Difference]: With dead ends: 749 [2018-10-02 12:11:01,360 INFO L226 Difference]: Without dead ends: 747 [2018-10-02 12:11:01,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 723 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.4s impTime [2018-10-02 12:11:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-10-02 12:11:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2018-10-02 12:11:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-10-02 12:11:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2018-10-02 12:11:01,845 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2018-10-02 12:11:01,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:01,845 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2018-10-02 12:11:01,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-02 12:11:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2018-10-02 12:11:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-10-02 12:11:01,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:01,849 INFO L375 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2018-10-02 12:11:01,849 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:01,849 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:01,849 INFO L82 PathProgramCache]: Analyzing trace with hash -637130843, now seen corresponding path program 64 times [2018-10-02 12:11:01,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:01,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:01,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:01,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:01,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-10-02 12:11:03,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:03,514 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-02 12:11:03,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:11:03,910 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:11:03,910 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:03,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-10-02 12:11:05,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:05,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-02 12:11:05,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-02 12:11:05,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-02 12:11:05,375 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:05,375 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2018-10-02 12:11:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:07,219 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2018-10-02 12:11:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-02 12:11:07,219 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2018-10-02 12:11:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:07,221 INFO L225 Difference]: With dead ends: 761 [2018-10-02 12:11:07,222 INFO L226 Difference]: Without dead ends: 759 [2018-10-02 12:11:07,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 0.9s impTime [2018-10-02 12:11:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-02 12:11:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2018-10-02 12:11:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-10-02 12:11:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2018-10-02 12:11:07,825 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2018-10-02 12:11:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:07,826 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2018-10-02 12:11:07,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-02 12:11:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2018-10-02 12:11:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-10-02 12:11:07,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:07,830 INFO L375 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2018-10-02 12:11:07,830 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:07,830 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2088363025, now seen corresponding path program 65 times [2018-10-02 12:11:07,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:07,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:07,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-10-02 12:11:09,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:09,046 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-02 12:11:09,054 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:11:11,195 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 373 check-sat command(s) [2018-10-02 12:11:11,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:11,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-10-02 12:11:12,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:12,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-02 12:11:12,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-02 12:11:12,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-02 12:11:12,799 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:12,799 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2018-10-02 12:11:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:14,224 INFO L93 Difference]: Finished difference Result 773 states and 837 transitions. [2018-10-02 12:11:14,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-02 12:11:14,224 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2018-10-02 12:11:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:14,226 INFO L225 Difference]: With dead ends: 773 [2018-10-02 12:11:14,226 INFO L226 Difference]: Without dead ends: 771 [2018-10-02 12:11:14,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.5s impTime [2018-10-02 12:11:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-10-02 12:11:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2018-10-02 12:11:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-10-02 12:11:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2018-10-02 12:11:14,743 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2018-10-02 12:11:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:14,743 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2018-10-02 12:11:14,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-02 12:11:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2018-10-02 12:11:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-10-02 12:11:14,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:14,747 INFO L375 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2018-10-02 12:11:14,747 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:14,747 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:14,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1164447431, now seen corresponding path program 66 times [2018-10-02 12:11:14,748 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:14,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:14,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:14,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:14,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-10-02 12:11:15,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:15,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:11:15,981 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:11:18,145 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 374 check-sat command(s) [2018-10-02 12:11:18,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:18,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-10-02 12:11:19,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:19,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-02 12:11:19,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-02 12:11:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-02 12:11:19,829 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:19,830 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2018-10-02 12:11:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:21,269 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2018-10-02 12:11:21,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-02 12:11:21,269 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2018-10-02 12:11:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:21,271 INFO L225 Difference]: With dead ends: 785 [2018-10-02 12:11:21,272 INFO L226 Difference]: Without dead ends: 783 [2018-10-02 12:11:21,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.5s impTime [2018-10-02 12:11:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-02 12:11:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2018-10-02 12:11:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-10-02 12:11:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2018-10-02 12:11:21,852 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2018-10-02 12:11:21,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:21,853 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2018-10-02 12:11:21,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-02 12:11:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2018-10-02 12:11:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-10-02 12:11:21,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:21,857 INFO L375 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2018-10-02 12:11:21,857 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:21,857 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:21,857 INFO L82 PathProgramCache]: Analyzing trace with hash -697161853, now seen corresponding path program 67 times [2018-10-02 12:11:21,857 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:21,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:21,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:21,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:21,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-10-02 12:11:23,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:23,150 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-02 12:11:23,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:11:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:23,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-10-02 12:11:25,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:25,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-02 12:11:25,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-02 12:11:25,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-02 12:11:25,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:25,178 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2018-10-02 12:11:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:26,700 INFO L93 Difference]: Finished difference Result 797 states and 863 transitions. [2018-10-02 12:11:26,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-02 12:11:26,701 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2018-10-02 12:11:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:26,703 INFO L225 Difference]: With dead ends: 797 [2018-10-02 12:11:26,703 INFO L226 Difference]: Without dead ends: 795 [2018-10-02 12:11:26,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.5s impTime [2018-10-02 12:11:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-10-02 12:11:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2018-10-02 12:11:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-10-02 12:11:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2018-10-02 12:11:27,333 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2018-10-02 12:11:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:27,334 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2018-10-02 12:11:27,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-02 12:11:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2018-10-02 12:11:27,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-10-02 12:11:27,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:27,338 INFO L375 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2018-10-02 12:11:27,338 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:27,338 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:27,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1869922611, now seen corresponding path program 68 times [2018-10-02 12:11:27,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:27,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:27,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:27,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:11:27,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-10-02 12:11:28,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:28,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 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-02 12:11:28,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:11:28,995 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:11:28,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:29,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-10-02 12:11:30,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:30,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-02 12:11:30,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-02 12:11:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-02 12:11:30,705 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:30,705 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2018-10-02 12:11:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:32,183 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2018-10-02 12:11:32,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-02 12:11:32,184 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2018-10-02 12:11:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:32,186 INFO L225 Difference]: With dead ends: 809 [2018-10-02 12:11:32,187 INFO L226 Difference]: Without dead ends: 807 [2018-10-02 12:11:32,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.3s impTime [2018-10-02 12:11:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-10-02 12:11:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2018-10-02 12:11:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-10-02 12:11:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2018-10-02 12:11:32,827 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2018-10-02 12:11:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:32,827 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2018-10-02 12:11:32,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-02 12:11:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2018-10-02 12:11:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-10-02 12:11:32,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:32,832 INFO L375 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2018-10-02 12:11:32,832 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:32,832 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:32,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1533429993, now seen corresponding path program 69 times [2018-10-02 12:11:32,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:32,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:32,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:32,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:32,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-10-02 12:11:34,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:34,268 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:11:34,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:11:36,740 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 397 check-sat command(s) [2018-10-02 12:11:36,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:36,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-10-02 12:11:38,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:38,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-02 12:11:38,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-02 12:11:38,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-02 12:11:38,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:38,440 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. [2018-10-02 12:11:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:40,040 INFO L93 Difference]: Finished difference Result 821 states and 889 transitions. [2018-10-02 12:11:40,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-02 12:11:40,040 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 795 [2018-10-02 12:11:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:40,043 INFO L225 Difference]: With dead ends: 821 [2018-10-02 12:11:40,043 INFO L226 Difference]: Without dead ends: 819 [2018-10-02 12:11:40,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.5s impTime [2018-10-02 12:11:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-02 12:11:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 808. [2018-10-02 12:11:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-10-02 12:11:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 875 transitions. [2018-10-02 12:11:40,701 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 875 transitions. Word has length 795 [2018-10-02 12:11:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:40,701 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 875 transitions. [2018-10-02 12:11:40,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-02 12:11:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 875 transitions. [2018-10-02 12:11:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-10-02 12:11:40,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:40,706 INFO L375 BasicCegarLoop]: trace histogram [670, 67, 67, 1, 1, 1] [2018-10-02 12:11:40,706 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:40,706 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:40,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1888751713, now seen corresponding path program 70 times [2018-10-02 12:11:40,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:40,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:40,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:40,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:40,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-10-02 12:11:41,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:41,884 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-02 12:11:41,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:11:42,335 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:11:42,336 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:42,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-10-02 12:11:44,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:44,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-02 12:11:44,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-02 12:11:44,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-02 12:11:44,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:44,352 INFO L87 Difference]: Start difference. First operand 808 states and 875 transitions. Second operand 70 states. [2018-10-02 12:11:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:45,915 INFO L93 Difference]: Finished difference Result 833 states and 902 transitions. [2018-10-02 12:11:45,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-02 12:11:45,915 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 807 [2018-10-02 12:11:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:45,918 INFO L225 Difference]: With dead ends: 833 [2018-10-02 12:11:45,918 INFO L226 Difference]: Without dead ends: 831 [2018-10-02 12:11:45,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.3s impTime [2018-10-02 12:11:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-10-02 12:11:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 820. [2018-10-02 12:11:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-10-02 12:11:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 888 transitions. [2018-10-02 12:11:46,590 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 888 transitions. Word has length 807 [2018-10-02 12:11:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:46,591 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 888 transitions. [2018-10-02 12:11:46,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-02 12:11:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 888 transitions. [2018-10-02 12:11:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-10-02 12:11:46,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:46,595 INFO L375 BasicCegarLoop]: trace histogram [680, 68, 68, 1, 1, 1] [2018-10-02 12:11:46,596 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:46,596 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:46,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1800353109, now seen corresponding path program 71 times [2018-10-02 12:11:46,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:46,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:46,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-10-02 12:11:47,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:47,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:11:47,796 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:11:50,338 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 409 check-sat command(s) [2018-10-02 12:11:50,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:50,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-10-02 12:11:52,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:52,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-02 12:11:52,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-02 12:11:52,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-02 12:11:52,398 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:52,398 INFO L87 Difference]: Start difference. First operand 820 states and 888 transitions. Second operand 71 states. [2018-10-02 12:11:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:53,922 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-10-02 12:11:53,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-02 12:11:53,922 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 819 [2018-10-02 12:11:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:53,925 INFO L225 Difference]: With dead ends: 845 [2018-10-02 12:11:53,925 INFO L226 Difference]: Without dead ends: 843 [2018-10-02 12:11:53,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.3s impTime [2018-10-02 12:11:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-10-02 12:11:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 832. [2018-10-02 12:11:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-10-02 12:11:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 901 transitions. [2018-10-02 12:11:54,633 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 901 transitions. Word has length 819 [2018-10-02 12:11:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:54,634 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 901 transitions. [2018-10-02 12:11:54,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-02 12:11:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 901 transitions. [2018-10-02 12:11:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-10-02 12:11:54,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:54,638 INFO L375 BasicCegarLoop]: trace histogram [690, 69, 69, 1, 1, 1] [2018-10-02 12:11:54,638 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:54,638 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:54,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1822005771, now seen corresponding path program 72 times [2018-10-02 12:11:54,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:54,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:54,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:54,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:54,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-10-02 12:11:56,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:56,100 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-02 12:11:56,107 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:11:58,718 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 411 check-sat command(s) [2018-10-02 12:11:58,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:58,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:12:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-10-02 12:12:00,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:12:00,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-02 12:12:00,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-02 12:12:00,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-02 12:12:00,688 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:12:00,688 INFO L87 Difference]: Start difference. First operand 832 states and 901 transitions. Second operand 72 states. [2018-10-02 12:12:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:12:02,317 INFO L93 Difference]: Finished difference Result 857 states and 928 transitions. [2018-10-02 12:12:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-02 12:12:02,318 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 831 [2018-10-02 12:12:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:12:02,320 INFO L225 Difference]: With dead ends: 857 [2018-10-02 12:12:02,320 INFO L226 Difference]: Without dead ends: 855 [2018-10-02 12:12:02,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 831 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 0.5s impTime [2018-10-02 12:12:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-10-02 12:12:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 844. [2018-10-02 12:12:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-02 12:12:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 914 transitions. [2018-10-02 12:12:03,036 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 914 transitions. Word has length 831 [2018-10-02 12:12:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:12:03,037 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 914 transitions. [2018-10-02 12:12:03,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-02 12:12:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 914 transitions. [2018-10-02 12:12:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-10-02 12:12:03,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:12:03,042 INFO L375 BasicCegarLoop]: trace histogram [700, 70, 70, 1, 1, 1] [2018-10-02 12:12:03,042 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:12:03,042 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:12:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1902862911, now seen corresponding path program 73 times [2018-10-02 12:12:03,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:12:03,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:12:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:03,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:12:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:12:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-10-02 12:12:04,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:12:04,861 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-02 12:12:04,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:12:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:12:05,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:12:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-10-02 12:12:07,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:12:07,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-02 12:12:07,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-02 12:12:07,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-02 12:12:07,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:12:07,176 INFO L87 Difference]: Start difference. First operand 844 states and 914 transitions. Second operand 73 states. [2018-10-02 12:12:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:12:08,992 INFO L93 Difference]: Finished difference Result 869 states and 941 transitions. [2018-10-02 12:12:08,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-02 12:12:08,992 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 843 [2018-10-02 12:12:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:12:08,994 INFO L225 Difference]: With dead ends: 869 [2018-10-02 12:12:08,994 INFO L226 Difference]: Without dead ends: 867 [2018-10-02 12:12:08,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 843 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 0.8s impTime [2018-10-02 12:12:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-10-02 12:12:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 856. [2018-10-02 12:12:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-02 12:12:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 927 transitions. [2018-10-02 12:12:09,683 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 927 transitions. Word has length 843 [2018-10-02 12:12:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:12:09,683 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 927 transitions. [2018-10-02 12:12:09,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-02 12:12:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 927 transitions. [2018-10-02 12:12:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-10-02 12:12:09,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:12:09,688 INFO L375 BasicCegarLoop]: trace histogram [710, 71, 71, 1, 1, 1] [2018-10-02 12:12:09,688 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:12:09,688 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:12:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1438007177, now seen corresponding path program 74 times [2018-10-02 12:12:09,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:12:09,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:12:09,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:09,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:12:09,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-02 12:12:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-10-02 12:12:11,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:12:11,188 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-02 12:12:11,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:12:11,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:12:11,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:12:11,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:12:11,694 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-02 12:12:11,895 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:12:11,895 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 12:12:11,901 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 12:12:11,901 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:12:11 BoogieIcfgContainer [2018-10-02 12:12:11,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:12:11,902 INFO L168 Benchmark]: Toolchain (without parser) took 249867.69 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 518.8 MB. Max. memory is 7.1 GB. [2018-10-02 12:12:11,904 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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-02 12:12:11,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.97 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-02 12:12:11,905 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 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-02 12:12:11,906 INFO L168 Benchmark]: RCFGBuilder took 336.11 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-02 12:12:11,906 INFO L168 Benchmark]: TraceAbstraction took 249454.04 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 497.7 MB. Max. memory is 7.1 GB. [2018-10-02 12:12:11,910 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.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. * Boogie Procedure Inliner took 43.97 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.97 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 336.11 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 249454.04 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 497.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 856 with TraceHistMax 710, 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, 7 locations, 1 error locations. TIMEOUT Result, 249.3s OverallTime, 76 OverallIterations, 710 TraceHistogramMax, 59.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 298 SDtfs, 5106 SDslu, 3676 SDs, 0 SdLazy, 6456 SolverSat, 461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32806 GetRequests, 29986 SyntacticMatches, 0 SemanticMatches, 2820 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 89.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=856occurred in iteration=75, 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: 16.8s AutomataMinimizationTime, 75 MinimizatonAttempts, 752 StatesRemovedByMinimization, 71 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 3.6s SsaConstructionTime, 41.3s SatisfiabilityAnalysisTime, 108.4s InterpolantComputationTime, 60050 NumberOfCodeBlocks, 59889 NumberOfCodeBlocksAsserted, 7579 NumberOfCheckSat, 59902 ConstructedInterpolants, 0 QuantifiedInterpolants, 101469592 SizeOfPredicates, 73 NumberOfNonLiveVariables, 120018 ConjunctsInSsa, 2655 ConjunctsInUnsatCore, 148 InterpolantComputations, 2 PerfectInterpolantSequences, 275833/14221117 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/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-12-11-928.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-12-11-928.csv Completed graceful shutdown