java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:52:50,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:52:50,677 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:52:50,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:52:50,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:52:50,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:52:50,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:52:50,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:52:50,701 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:52:50,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:52:50,704 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:52:50,705 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:52:50,705 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:52:50,706 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:52:50,709 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:52:50,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:52:50,712 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:52:50,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:52:50,723 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:52:50,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:52:50,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:52:50,727 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:52:50,730 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:52:50,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:52:50,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:52:50,731 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:52:50,732 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:52:50,733 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:52:50,734 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:52:50,734 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:52:50,735 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:52:50,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:52:50,736 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:52:50,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:52:50,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:52:50,739 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 08:52:50,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:52:50,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:52:50,763 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:52:50,763 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:52:50,764 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:52:50,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:52:50,764 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:52:50,764 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:52:50,765 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:52:50,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:52:50,765 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:52:50,765 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:52:50,765 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:52:50,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:52:50,768 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:52:50,768 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:52:50,768 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:52:50,769 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:52:50,769 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:52:50,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:52:50,769 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:52:50,770 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:52:50,771 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:52:50,816 INFO ]: Repository-Root is: /tmp [2018-06-25 08:52:50,835 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:52:50,843 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:52:50,844 INFO ]: Initializing SmtParser... [2018-06-25 08:52:50,844 INFO ]: SmtParser initialized [2018-06-25 08:52:50,845 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 [2018-06-25 08:52:50,846 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 08:52:50,935 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 unknown [2018-06-25 08:52:51,171 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 [2018-06-25 08:52:51,176 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:52:51,182 INFO ]: Walking toolchain with 4 elements. [2018-06-25 08:52:51,182 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:52:51,182 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:52:51,183 INFO ]: ChcToBoogie initialized [2018-06-25 08:52:51,186 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:52:51" (1/1) ... [2018-06-25 08:52:51,246 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:52:51 Unit [2018-06-25 08:52:51,246 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:52:51,248 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:52:51,248 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:52:51,248 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:52:51,268 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:52:51" (1/1) ... [2018-06-25 08:52:51,268 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:52:51" (1/1) ... [2018-06-25 08:52:51,273 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:52:51" (1/1) ... [2018-06-25 08:52:51,274 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:52:51" (1/1) ... [2018-06-25 08:52:51,277 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:52:51" (1/1) ... [2018-06-25 08:52:51,280 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:52:51" (1/1) ... [2018-06-25 08:52:51,281 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:52:51" (1/1) ... [2018-06-25 08:52:51,284 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:52:51,284 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:52:51,284 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:52:51,284 INFO ]: RCFGBuilder initialized [2018-06-25 08:52:51,285 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:52:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 08:52:51,298 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:52:51,298 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:52:51,298 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:52:51,298 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:52:51,298 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:52:51,298 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:52:51,581 INFO ]: Using library mode [2018-06-25 08:52:51,581 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:52:51 BoogieIcfgContainer [2018-06-25 08:52:51,581 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:52:51,582 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:52:51,582 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:52:51,585 INFO ]: TraceAbstraction initialized [2018-06-25 08:52:51,586 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:52:51" (1/3) ... [2018-06-25 08:52:51,586 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522eefd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:52:51, skipping insertion in model container [2018-06-25 08:52:51,586 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:52:51" (2/3) ... [2018-06-25 08:52:51,587 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522eefd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:52:51, skipping insertion in model container [2018-06-25 08:52:51,587 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:52:51" (3/3) ... [2018-06-25 08:52:51,590 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 08:52:51,599 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:52:51,607 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:52:51,659 INFO ]: Using default assertion order modulation [2018-06-25 08:52:51,660 INFO ]: Interprodecural is true [2018-06-25 08:52:51,660 INFO ]: Hoare is false [2018-06-25 08:52:51,660 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:52:51,660 INFO ]: Backedges is TWOTRACK [2018-06-25 08:52:51,660 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:52:51,660 INFO ]: Difference is false [2018-06-25 08:52:51,660 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:52:51,660 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:52:51,675 INFO ]: Start isEmpty. Operand 13 states. [2018-06-25 08:52:51,685 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:52:51,685 INFO ]: Found error trace [2018-06-25 08:52:51,686 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:52:51,686 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:51,689 INFO ]: Analyzing trace with hash 2004193684, now seen corresponding path program 1 times [2018-06-25 08:52:51,690 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:51,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:51,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:51,730 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:51,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:51,756 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:51,781 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:51,783 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:52:51,783 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-25 08:52:51,784 INFO ]: Interpolant automaton has 2 states [2018-06-25 08:52:51,795 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-25 08:52:51,795 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 08:52:51,797 INFO ]: Start difference. First operand 13 states. Second operand 2 states. [2018-06-25 08:52:51,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:51,814 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-25 08:52:51,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 08:52:51,815 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-25 08:52:51,816 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:51,829 INFO ]: With dead ends: 11 [2018-06-25 08:52:51,829 INFO ]: Without dead ends: 11 [2018-06-25 08:52:51,832 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 08:52:51,849 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 08:52:51,863 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 08:52:51,864 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 08:52:51,865 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-06-25 08:52:51,867 INFO ]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 6 [2018-06-25 08:52:51,867 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:51,867 INFO ]: Abstraction has 11 states and 15 transitions. [2018-06-25 08:52:51,867 INFO ]: Interpolant automaton has 2 states. [2018-06-25 08:52:51,867 INFO ]: Start isEmpty. Operand 11 states and 15 transitions. [2018-06-25 08:52:51,867 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 08:52:51,867 INFO ]: Found error trace [2018-06-25 08:52:51,867 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:51,868 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:51,868 INFO ]: Analyzing trace with hash 1738631457, now seen corresponding path program 1 times [2018-06-25 08:52:51,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:51,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:51,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:51,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:51,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:51,898 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:52,001 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:52,001 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:52:52,001 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:52:52,002 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:52:52,003 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:52:52,003 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:52:52,003 INFO ]: Start difference. First operand 11 states and 15 transitions. Second operand 3 states. [2018-06-25 08:52:52,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:52,055 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-25 08:52:52,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:52:52,055 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 08:52:52,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:52,056 INFO ]: With dead ends: 14 [2018-06-25 08:52:52,056 INFO ]: Without dead ends: 14 [2018-06-25 08:52:52,056 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:52:52,056 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 08:52:52,059 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-25 08:52:52,059 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 08:52:52,059 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-25 08:52:52,059 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2018-06-25 08:52:52,060 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:52,060 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-25 08:52:52,060 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:52:52,060 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-25 08:52:52,060 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 08:52:52,060 INFO ]: Found error trace [2018-06-25 08:52:52,060 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:52,061 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:52,061 INFO ]: Analyzing trace with hash 1795889759, now seen corresponding path program 1 times [2018-06-25 08:52:52,061 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:52,061 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:52,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:52,062 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:52,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:52,090 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:52,185 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:52,185 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:52:52,185 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 08:52:52,185 INFO ]: Interpolant automaton has 4 states [2018-06-25 08:52:52,185 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 08:52:52,186 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 08:52:52,186 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2018-06-25 08:52:52,395 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:52,395 INFO ]: Finished difference Result 19 states and 28 transitions. [2018-06-25 08:52:52,396 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 08:52:52,396 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-25 08:52:52,396 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:52,399 INFO ]: With dead ends: 19 [2018-06-25 08:52:52,399 INFO ]: Without dead ends: 19 [2018-06-25 08:52:52,399 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:52:52,399 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 08:52:52,403 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-25 08:52:52,403 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 08:52:52,403 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-06-25 08:52:52,403 INFO ]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 10 [2018-06-25 08:52:52,403 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:52,403 INFO ]: Abstraction has 14 states and 19 transitions. [2018-06-25 08:52:52,403 INFO ]: Interpolant automaton has 4 states. [2018-06-25 08:52:52,403 INFO ]: Start isEmpty. Operand 14 states and 19 transitions. [2018-06-25 08:52:52,404 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 08:52:52,404 INFO ]: Found error trace [2018-06-25 08:52:52,404 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:52,404 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:52,404 INFO ]: Analyzing trace with hash 1509598249, now seen corresponding path program 1 times [2018-06-25 08:52:52,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:52,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:52,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:52,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:52,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:52,437 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:52,590 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:52,591 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:52:52,591 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:52:52,591 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:52:52,591 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:52:52,591 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:52:52,591 INFO ]: Start difference. First operand 14 states and 19 transitions. Second operand 5 states. [2018-06-25 08:52:52,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:52,832 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-25 08:52:52,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:52:52,833 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-25 08:52:52,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:52,833 INFO ]: With dead ends: 17 [2018-06-25 08:52:52,833 INFO ]: Without dead ends: 17 [2018-06-25 08:52:52,834 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:52:52,834 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 08:52:52,835 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-25 08:52:52,836 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 08:52:52,836 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-25 08:52:52,836 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2018-06-25 08:52:52,836 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:52,836 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-25 08:52:52,836 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:52:52,836 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-25 08:52:52,837 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:52:52,837 INFO ]: Found error trace [2018-06-25 08:52:52,840 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:52,840 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:52,840 INFO ]: Analyzing trace with hash -161163777, now seen corresponding path program 1 times [2018-06-25 08:52:52,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:52,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:52,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:52,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:52,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:52,877 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:52,984 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:52:52,984 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:52:52,984 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 08:52:52,985 INFO ]: Interpolant automaton has 6 states [2018-06-25 08:52:52,985 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 08:52:52,985 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 08:52:52,985 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 6 states. [2018-06-25 08:52:53,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:53,298 INFO ]: Finished difference Result 28 states and 41 transitions. [2018-06-25 08:52:53,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 08:52:53,298 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-25 08:52:53,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:53,299 INFO ]: With dead ends: 28 [2018-06-25 08:52:53,299 INFO ]: Without dead ends: 26 [2018-06-25 08:52:53,300 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:52:53,300 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 08:52:53,305 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-06-25 08:52:53,306 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:52:53,306 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-25 08:52:53,306 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 11 [2018-06-25 08:52:53,306 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:53,306 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-25 08:52:53,306 INFO ]: Interpolant automaton has 6 states. [2018-06-25 08:52:53,306 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-25 08:52:53,306 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:52:53,306 INFO ]: Found error trace [2018-06-25 08:52:53,307 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:53,307 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:53,307 INFO ]: Analyzing trace with hash -446265995, now seen corresponding path program 1 times [2018-06-25 08:52:53,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:53,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:53,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:53,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:53,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:53,323 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:53,384 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:53,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:52:53,384 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:52:53,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:53,433 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:53,442 INFO ]: Computing forward predicates... [2018-06-25 08:52:53,594 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:53,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:52:53,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 08:52:53,627 INFO ]: Interpolant automaton has 6 states [2018-06-25 08:52:53,627 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 08:52:53,627 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 08:52:53,627 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 6 states. [2018-06-25 08:52:53,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:53,833 INFO ]: Finished difference Result 21 states and 32 transitions. [2018-06-25 08:52:53,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:52:53,833 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-25 08:52:53,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:53,834 INFO ]: With dead ends: 21 [2018-06-25 08:52:53,834 INFO ]: Without dead ends: 19 [2018-06-25 08:52:53,834 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 08:52:53,834 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 08:52:53,836 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-25 08:52:53,836 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:52:53,836 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-25 08:52:53,836 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 11 [2018-06-25 08:52:53,836 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:53,836 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-25 08:52:53,836 INFO ]: Interpolant automaton has 6 states. [2018-06-25 08:52:53,836 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-25 08:52:53,837 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 08:52:53,837 INFO ]: Found error trace [2018-06-25 08:52:53,837 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:53,837 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:53,837 INFO ]: Analyzing trace with hash 445588536, now seen corresponding path program 1 times [2018-06-25 08:52:53,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:53,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:53,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:53,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:53,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:53,854 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:53,963 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:52:53,963 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:52:53,963 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:52:53,974 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:54,013 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:54,016 INFO ]: Computing forward predicates... [2018-06-25 08:52:54,036 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:52:54,069 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 08:52:54,069 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2018-06-25 08:52:54,070 INFO ]: Interpolant automaton has 6 states [2018-06-25 08:52:54,070 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 08:52:54,070 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 08:52:54,070 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 6 states. [2018-06-25 08:52:54,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:54,128 INFO ]: Finished difference Result 21 states and 30 transitions. [2018-06-25 08:52:54,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:52:54,129 INFO ]: Start accepts. Automaton has 6 states. Word has length 14 [2018-06-25 08:52:54,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:54,130 INFO ]: With dead ends: 21 [2018-06-25 08:52:54,130 INFO ]: Without dead ends: 15 [2018-06-25 08:52:54,130 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 08:52:54,130 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 08:52:54,132 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 08:52:54,132 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:52:54,132 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-25 08:52:54,132 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 14 [2018-06-25 08:52:54,132 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:54,132 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-25 08:52:54,132 INFO ]: Interpolant automaton has 6 states. [2018-06-25 08:52:54,132 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-25 08:52:54,133 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 08:52:54,133 INFO ]: Found error trace [2018-06-25 08:52:54,133 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:54,133 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:54,133 INFO ]: Analyzing trace with hash 52561526, now seen corresponding path program 1 times [2018-06-25 08:52:54,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:54,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:54,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:54,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:54,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:54,156 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:54,222 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:54,222 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:52:54,222 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:52:54,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:54,254 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:54,257 INFO ]: Computing forward predicates... [2018-06-25 08:52:54,291 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:54,311 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:52:54,312 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 08:52:54,312 INFO ]: Interpolant automaton has 9 states [2018-06-25 08:52:54,312 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 08:52:54,312 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-25 08:52:54,312 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 9 states. [2018-06-25 08:52:54,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:54,522 INFO ]: Finished difference Result 26 states and 33 transitions. [2018-06-25 08:52:54,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 08:52:54,522 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-25 08:52:54,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:54,523 INFO ]: With dead ends: 26 [2018-06-25 08:52:54,523 INFO ]: Without dead ends: 26 [2018-06-25 08:52:54,523 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:52:54,523 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 08:52:54,525 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-06-25 08:52:54,525 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 08:52:54,526 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-06-25 08:52:54,526 INFO ]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 14 [2018-06-25 08:52:54,526 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:54,526 INFO ]: Abstraction has 20 states and 26 transitions. [2018-06-25 08:52:54,526 INFO ]: Interpolant automaton has 9 states. [2018-06-25 08:52:54,526 INFO ]: Start isEmpty. Operand 20 states and 26 transitions. [2018-06-25 08:52:54,526 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 08:52:54,526 INFO ]: Found error trace [2018-06-25 08:52:54,526 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:54,527 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:54,527 INFO ]: Analyzing trace with hash 2017696576, now seen corresponding path program 1 times [2018-06-25 08:52:54,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:54,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:54,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:54,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:54,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:54,540 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:54,763 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:54,763 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:52:54,763 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:52:54,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:54,789 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:54,791 INFO ]: Computing forward predicates... [2018-06-25 08:52:54,946 INFO ]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:52:54,966 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:52:54,966 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2018-06-25 08:52:54,966 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:52:54,966 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:52:54,966 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:52:54,966 INFO ]: Start difference. First operand 20 states and 26 transitions. Second operand 12 states. [2018-06-25 08:52:55,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:55,404 INFO ]: Finished difference Result 28 states and 32 transitions. [2018-06-25 08:52:55,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 08:52:55,406 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-25 08:52:55,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:55,406 INFO ]: With dead ends: 28 [2018-06-25 08:52:55,406 INFO ]: Without dead ends: 18 [2018-06-25 08:52:55,406 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-06-25 08:52:55,406 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 08:52:55,407 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-06-25 08:52:55,407 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 08:52:55,408 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-25 08:52:55,408 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-25 08:52:55,408 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:55,408 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-25 08:52:55,408 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:52:55,408 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-25 08:52:55,408 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 08:52:55,408 INFO ]: Found error trace [2018-06-25 08:52:55,408 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:55,409 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:55,409 INFO ]: Analyzing trace with hash 1630235848, now seen corresponding path program 2 times [2018-06-25 08:52:55,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:55,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:55,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:55,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:52:55,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:55,425 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:55,568 INFO ]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 08:52:55,569 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:52:55,569 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:52:55,583 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:52:55,604 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:52:55,604 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:55,607 INFO ]: Computing forward predicates... [2018-06-25 08:52:55,667 INFO ]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 08:52:55,688 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:52:55,688 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-25 08:52:55,688 INFO ]: Interpolant automaton has 10 states [2018-06-25 08:52:55,688 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 08:52:55,688 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:52:55,688 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 10 states. [2018-06-25 08:52:55,882 WARN ]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-25 08:52:56,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:56,014 INFO ]: Finished difference Result 24 states and 26 transitions. [2018-06-25 08:52:56,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 08:52:56,014 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-25 08:52:56,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:56,015 INFO ]: With dead ends: 24 [2018-06-25 08:52:56,015 INFO ]: Without dead ends: 21 [2018-06-25 08:52:56,015 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-06-25 08:52:56,015 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 08:52:56,017 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-25 08:52:56,017 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 08:52:56,017 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-25 08:52:56,017 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-06-25 08:52:56,017 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:56,017 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-25 08:52:56,017 INFO ]: Interpolant automaton has 10 states. [2018-06-25 08:52:56,017 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-25 08:52:56,018 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 08:52:56,018 INFO ]: Found error trace [2018-06-25 08:52:56,018 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:56,018 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:56,018 INFO ]: Analyzing trace with hash 1918732735, now seen corresponding path program 3 times [2018-06-25 08:52:56,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:56,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:56,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:56,023 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:52:56,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:56,048 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:56,246 INFO ]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:56,246 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:52:56,246 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:52:56,252 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:52:56,328 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 08:52:56,328 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:56,331 INFO ]: Computing forward predicates... [2018-06-25 08:52:56,558 INFO ]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:56,578 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:52:56,578 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-25 08:52:56,578 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:52:56,578 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:52:56,578 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:52:56,579 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 13 states. [2018-06-25 08:52:56,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:56,865 INFO ]: Finished difference Result 22 states and 23 transitions. [2018-06-25 08:52:56,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 08:52:56,865 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-25 08:52:56,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:56,865 INFO ]: With dead ends: 22 [2018-06-25 08:52:56,865 INFO ]: Without dead ends: 22 [2018-06-25 08:52:56,866 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-06-25 08:52:56,866 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 08:52:56,867 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-25 08:52:56,867 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 08:52:56,868 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-25 08:52:56,868 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-25 08:52:56,868 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:56,868 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-25 08:52:56,868 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:52:56,868 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-25 08:52:56,868 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 08:52:56,868 INFO ]: Found error trace [2018-06-25 08:52:56,868 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:56,869 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:56,869 INFO ]: Analyzing trace with hash -647998817, now seen corresponding path program 4 times [2018-06-25 08:52:56,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:56,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:56,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:56,869 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:52:56,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:56,893 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:57,140 INFO ]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 08:52:57,140 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:52:57,140 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:52:57,147 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:52:57,181 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:52:57,181 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:57,185 INFO ]: Computing forward predicates... [2018-06-25 08:52:57,303 INFO ]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 08:52:57,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:52:57,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-25 08:52:57,335 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:52:57,335 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:52:57,335 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:52:57,335 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2018-06-25 08:52:57,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:57,746 INFO ]: Finished difference Result 29 states and 31 transitions. [2018-06-25 08:52:57,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 08:52:57,747 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-25 08:52:57,747 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:57,748 INFO ]: With dead ends: 29 [2018-06-25 08:52:57,748 INFO ]: Without dead ends: 25 [2018-06-25 08:52:57,748 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-06-25 08:52:57,748 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 08:52:57,752 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-25 08:52:57,752 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 08:52:57,752 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-25 08:52:57,752 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2018-06-25 08:52:57,752 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:57,752 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-25 08:52:57,752 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:52:57,752 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-25 08:52:57,753 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 08:52:57,753 INFO ]: Found error trace [2018-06-25 08:52:57,753 INFO ]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:57,753 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:57,754 INFO ]: Analyzing trace with hash -1715659754, now seen corresponding path program 5 times [2018-06-25 08:52:57,754 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:57,754 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:57,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:57,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:52:57,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:57,769 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:58,346 INFO ]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:58,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:52:58,346 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:52:58,352 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:52:58,434 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 08:52:58,434 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:58,438 INFO ]: Computing forward predicates... [2018-06-25 08:52:58,484 INFO ]: Checked inductivity of 24 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:52:58,508 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:52:58,508 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-25 08:52:58,509 INFO ]: Interpolant automaton has 17 states [2018-06-25 08:52:58,509 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 08:52:58,509 INFO ]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-06-25 08:52:58,509 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 17 states. [2018-06-25 08:52:58,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:58,777 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-25 08:52:58,777 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 08:52:58,777 INFO ]: Start accepts. Automaton has 17 states. Word has length 22 [2018-06-25 08:52:58,777 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:58,778 INFO ]: With dead ends: 26 [2018-06-25 08:52:58,778 INFO ]: Without dead ends: 26 [2018-06-25 08:52:58,778 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=607, Unknown=0, NotChecked=0, Total=870 [2018-06-25 08:52:58,778 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 08:52:58,780 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-25 08:52:58,780 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 08:52:58,780 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-25 08:52:58,780 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-25 08:52:58,780 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:58,780 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-25 08:52:58,780 INFO ]: Interpolant automaton has 17 states. [2018-06-25 08:52:58,780 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-25 08:52:58,781 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 08:52:58,781 INFO ]: Found error trace [2018-06-25 08:52:58,781 INFO ]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:58,781 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:58,781 INFO ]: Analyzing trace with hash -1645016280, now seen corresponding path program 6 times [2018-06-25 08:52:58,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:58,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:58,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:58,782 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:52:58,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:58,812 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:59,052 INFO ]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 08:52:59,052 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:52:59,052 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:52:59,060 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:52:59,104 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 08:52:59,104 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:52:59,110 INFO ]: Computing forward predicates... [2018-06-25 08:52:59,249 INFO ]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 08:52:59,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:52:59,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-25 08:52:59,270 INFO ]: Interpolant automaton has 16 states [2018-06-25 08:52:59,270 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 08:52:59,270 INFO ]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-06-25 08:52:59,271 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 16 states. [2018-06-25 08:52:59,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:52:59,802 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-25 08:52:59,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 08:52:59,802 INFO ]: Start accepts. Automaton has 16 states. Word has length 23 [2018-06-25 08:52:59,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:52:59,803 INFO ]: With dead ends: 34 [2018-06-25 08:52:59,803 INFO ]: Without dead ends: 29 [2018-06-25 08:52:59,803 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2018-06-25 08:52:59,804 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 08:52:59,805 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-25 08:52:59,805 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 08:52:59,806 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-25 08:52:59,806 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2018-06-25 08:52:59,806 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:52:59,806 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-25 08:52:59,806 INFO ]: Interpolant automaton has 16 states. [2018-06-25 08:52:59,806 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-25 08:52:59,808 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 08:52:59,808 INFO ]: Found error trace [2018-06-25 08:52:59,808 INFO ]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:52:59,808 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:52:59,808 INFO ]: Analyzing trace with hash -414170849, now seen corresponding path program 7 times [2018-06-25 08:52:59,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:52:59,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:52:59,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:59,809 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:52:59,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:52:59,825 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:00,153 INFO ]: Checked inductivity of 40 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:00,153 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:00,153 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-25 08:53:00,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:53:00,208 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:00,211 INFO ]: Computing forward predicates... [2018-06-25 08:53:00,247 INFO ]: Checked inductivity of 40 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:00,267 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:00,267 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-25 08:53:00,267 INFO ]: Interpolant automaton has 21 states [2018-06-25 08:53:00,267 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 08:53:00,267 INFO ]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:53:00,268 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 21 states. [2018-06-25 08:53:00,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:00,616 INFO ]: Finished difference Result 30 states and 31 transitions. [2018-06-25 08:53:00,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 08:53:00,617 INFO ]: Start accepts. Automaton has 21 states. Word has length 26 [2018-06-25 08:53:00,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:00,617 INFO ]: With dead ends: 30 [2018-06-25 08:53:00,617 INFO ]: Without dead ends: 30 [2018-06-25 08:53:00,618 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=418, Invalid=988, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 08:53:00,618 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 08:53:00,620 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-25 08:53:00,620 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 08:53:00,620 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-25 08:53:00,620 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-25 08:53:00,620 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:00,620 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-25 08:53:00,620 INFO ]: Interpolant automaton has 21 states. [2018-06-25 08:53:00,621 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-25 08:53:00,625 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 08:53:00,625 INFO ]: Found error trace [2018-06-25 08:53:00,625 INFO ]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:00,625 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:00,625 INFO ]: Analyzing trace with hash 46434111, now seen corresponding path program 8 times [2018-06-25 08:53:00,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:00,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:00,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:00,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:53:00,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:00,656 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:01,080 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 08:53:01,080 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:01,080 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:01,087 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:53:01,124 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:53:01,124 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:01,130 INFO ]: Computing forward predicates... [2018-06-25 08:53:01,515 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 08:53:01,547 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:01,547 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-25 08:53:01,548 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:53:01,548 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:53:01,548 INFO ]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:53:01,548 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 19 states. [2018-06-25 08:53:02,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:02,150 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-25 08:53:02,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 08:53:02,150 INFO ]: Start accepts. Automaton has 19 states. Word has length 27 [2018-06-25 08:53:02,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:02,151 INFO ]: With dead ends: 39 [2018-06-25 08:53:02,151 INFO ]: Without dead ends: 33 [2018-06-25 08:53:02,151 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 08:53:02,151 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 08:53:02,153 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-25 08:53:02,153 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 08:53:02,153 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-25 08:53:02,153 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2018-06-25 08:53:02,153 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:02,153 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-25 08:53:02,153 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:53:02,153 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-25 08:53:02,155 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 08:53:02,155 INFO ]: Found error trace [2018-06-25 08:53:02,155 INFO ]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:02,155 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:02,155 INFO ]: Analyzing trace with hash 1310190006, now seen corresponding path program 9 times [2018-06-25 08:53:02,155 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:02,155 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:02,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:02,155 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:02,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:02,172 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:02,973 INFO ]: Checked inductivity of 60 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:02,973 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:02,973 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:02,979 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:53:03,026 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-25 08:53:03,026 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:03,030 INFO ]: Computing forward predicates... [2018-06-25 08:53:03,118 INFO ]: Checked inductivity of 60 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:03,138 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:03,138 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-25 08:53:03,138 INFO ]: Interpolant automaton has 25 states [2018-06-25 08:53:03,138 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 08:53:03,138 INFO ]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-06-25 08:53:03,138 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 25 states. [2018-06-25 08:53:03,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:03,724 INFO ]: Finished difference Result 34 states and 35 transitions. [2018-06-25 08:53:03,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 08:53:03,724 INFO ]: Start accepts. Automaton has 25 states. Word has length 30 [2018-06-25 08:53:03,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:03,724 INFO ]: With dead ends: 34 [2018-06-25 08:53:03,724 INFO ]: Without dead ends: 34 [2018-06-25 08:53:03,725 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=609, Invalid=1461, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 08:53:03,725 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 08:53:03,727 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-25 08:53:03,727 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 08:53:03,727 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-25 08:53:03,727 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-25 08:53:03,728 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:03,728 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-25 08:53:03,728 INFO ]: Interpolant automaton has 25 states. [2018-06-25 08:53:03,728 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-25 08:53:03,728 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 08:53:03,728 INFO ]: Found error trace [2018-06-25 08:53:03,728 INFO ]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:03,728 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:03,728 INFO ]: Analyzing trace with hash 1962013064, now seen corresponding path program 10 times [2018-06-25 08:53:03,728 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:03,728 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:03,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:03,730 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:03,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:03,749 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:04,190 INFO ]: Checked inductivity of 66 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 08:53:04,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:04,190 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:04,196 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:53:04,241 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:53:04,241 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:04,247 INFO ]: Computing forward predicates... [2018-06-25 08:53:04,552 INFO ]: Checked inductivity of 66 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 08:53:04,572 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:04,572 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-25 08:53:04,572 INFO ]: Interpolant automaton has 22 states [2018-06-25 08:53:04,572 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 08:53:04,572 INFO ]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-06-25 08:53:04,572 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 22 states. [2018-06-25 08:53:05,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:05,326 INFO ]: Finished difference Result 44 states and 46 transitions. [2018-06-25 08:53:05,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 08:53:05,326 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-25 08:53:05,327 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:05,327 INFO ]: With dead ends: 44 [2018-06-25 08:53:05,327 INFO ]: Without dead ends: 37 [2018-06-25 08:53:05,327 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=169, Invalid=1471, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 08:53:05,328 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 08:53:05,330 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-25 08:53:05,330 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 08:53:05,330 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-25 08:53:05,330 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2018-06-25 08:53:05,331 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:05,331 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-25 08:53:05,331 INFO ]: Interpolant automaton has 22 states. [2018-06-25 08:53:05,331 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-25 08:53:05,331 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 08:53:05,331 INFO ]: Found error trace [2018-06-25 08:53:05,331 INFO ]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:05,331 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:05,331 INFO ]: Analyzing trace with hash 1246838911, now seen corresponding path program 11 times [2018-06-25 08:53:05,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:05,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:05,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:05,332 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:05,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:05,352 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:05,719 INFO ]: Checked inductivity of 84 backedges. 57 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:05,719 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:05,719 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:05,737 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:53:05,793 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-25 08:53:05,793 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:05,799 INFO ]: Computing forward predicates... [2018-06-25 08:53:05,903 INFO ]: Checked inductivity of 84 backedges. 63 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:05,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:05,932 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-25 08:53:05,933 INFO ]: Interpolant automaton has 29 states [2018-06-25 08:53:05,933 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 08:53:05,933 INFO ]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2018-06-25 08:53:05,933 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 29 states. [2018-06-25 08:53:06,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:06,964 INFO ]: Finished difference Result 38 states and 39 transitions. [2018-06-25 08:53:06,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 08:53:06,964 INFO ]: Start accepts. Automaton has 29 states. Word has length 34 [2018-06-25 08:53:06,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:06,964 INFO ]: With dead ends: 38 [2018-06-25 08:53:06,964 INFO ]: Without dead ends: 38 [2018-06-25 08:53:06,965 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=836, Invalid=2026, Unknown=0, NotChecked=0, Total=2862 [2018-06-25 08:53:06,965 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-25 08:53:06,967 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-25 08:53:06,967 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 08:53:06,968 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-25 08:53:06,968 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-25 08:53:06,968 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:06,968 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-25 08:53:06,968 INFO ]: Interpolant automaton has 29 states. [2018-06-25 08:53:06,968 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-25 08:53:06,969 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:53:06,969 INFO ]: Found error trace [2018-06-25 08:53:06,969 INFO ]: trace histogram [7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:06,969 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:06,969 INFO ]: Analyzing trace with hash -1870881, now seen corresponding path program 12 times [2018-06-25 08:53:06,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:06,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:06,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:06,970 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:06,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:06,990 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:07,519 INFO ]: Checked inductivity of 91 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 08:53:07,519 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:07,519 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:07,535 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:53:07,669 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 08:53:07,669 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:07,683 INFO ]: Computing forward predicates... [2018-06-25 08:53:07,902 INFO ]: Checked inductivity of 91 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 08:53:07,921 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:07,921 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-25 08:53:07,921 INFO ]: Interpolant automaton has 25 states [2018-06-25 08:53:07,921 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 08:53:07,921 INFO ]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-06-25 08:53:07,922 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 25 states. [2018-06-25 08:53:08,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:08,784 INFO ]: Finished difference Result 49 states and 51 transitions. [2018-06-25 08:53:08,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 08:53:08,785 INFO ]: Start accepts. Automaton has 25 states. Word has length 35 [2018-06-25 08:53:08,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:08,785 INFO ]: With dead ends: 49 [2018-06-25 08:53:08,785 INFO ]: Without dead ends: 41 [2018-06-25 08:53:08,786 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=195, Invalid=1967, Unknown=0, NotChecked=0, Total=2162 [2018-06-25 08:53:08,786 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-25 08:53:08,788 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-06-25 08:53:08,788 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 08:53:08,788 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-25 08:53:08,788 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2018-06-25 08:53:08,788 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:08,788 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-25 08:53:08,788 INFO ]: Interpolant automaton has 25 states. [2018-06-25 08:53:08,788 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-25 08:53:08,789 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 08:53:08,789 INFO ]: Found error trace [2018-06-25 08:53:08,789 INFO ]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:08,789 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:08,789 INFO ]: Analyzing trace with hash 1719955286, now seen corresponding path program 13 times [2018-06-25 08:53:08,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:08,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:08,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:08,790 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:08,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:08,810 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:09,378 INFO ]: Checked inductivity of 112 backedges. 77 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:09,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:09,378 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:09,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:53:09,434 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:09,438 INFO ]: Computing forward predicates... [2018-06-25 08:53:09,508 INFO ]: Checked inductivity of 112 backedges. 84 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:09,529 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:09,529 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-25 08:53:09,529 INFO ]: Interpolant automaton has 33 states [2018-06-25 08:53:09,529 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-25 08:53:09,530 INFO ]: CoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 08:53:09,530 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 33 states. [2018-06-25 08:53:10,860 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:10,860 INFO ]: Finished difference Result 42 states and 43 transitions. [2018-06-25 08:53:10,860 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 08:53:10,860 INFO ]: Start accepts. Automaton has 33 states. Word has length 38 [2018-06-25 08:53:10,860 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:10,861 INFO ]: With dead ends: 42 [2018-06-25 08:53:10,861 INFO ]: Without dead ends: 42 [2018-06-25 08:53:10,861 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1099, Invalid=2683, Unknown=0, NotChecked=0, Total=3782 [2018-06-25 08:53:10,861 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 08:53:10,867 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-25 08:53:10,867 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 08:53:10,868 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-25 08:53:10,868 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-25 08:53:10,868 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:10,868 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-25 08:53:10,868 INFO ]: Interpolant automaton has 33 states. [2018-06-25 08:53:10,868 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-25 08:53:10,868 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 08:53:10,868 INFO ]: Found error trace [2018-06-25 08:53:10,868 INFO ]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:10,869 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:10,869 INFO ]: Analyzing trace with hash 1779834856, now seen corresponding path program 14 times [2018-06-25 08:53:10,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:10,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:10,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:10,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:53:10,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:10,895 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:11,439 INFO ]: Checked inductivity of 120 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 08:53:11,440 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:11,440 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:11,446 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:53:11,538 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:53:11,538 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:11,548 INFO ]: Computing forward predicates... [2018-06-25 08:53:12,234 INFO ]: Checked inductivity of 120 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 08:53:12,255 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:12,255 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-25 08:53:12,255 INFO ]: Interpolant automaton has 28 states [2018-06-25 08:53:12,255 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 08:53:12,255 INFO ]: CoverageRelationStatistics Valid=61, Invalid=695, Unknown=0, NotChecked=0, Total=756 [2018-06-25 08:53:12,255 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 28 states. [2018-06-25 08:53:13,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:13,391 INFO ]: Finished difference Result 54 states and 56 transitions. [2018-06-25 08:53:13,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 08:53:13,393 INFO ]: Start accepts. Automaton has 28 states. Word has length 39 [2018-06-25 08:53:13,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:13,393 INFO ]: With dead ends: 54 [2018-06-25 08:53:13,393 INFO ]: Without dead ends: 45 [2018-06-25 08:53:13,393 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=221, Invalid=2535, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 08:53:13,394 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 08:53:13,396 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-06-25 08:53:13,396 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 08:53:13,397 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-06-25 08:53:13,397 INFO ]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2018-06-25 08:53:13,397 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:13,397 INFO ]: Abstraction has 43 states and 44 transitions. [2018-06-25 08:53:13,397 INFO ]: Interpolant automaton has 28 states. [2018-06-25 08:53:13,397 INFO ]: Start isEmpty. Operand 43 states and 44 transitions. [2018-06-25 08:53:13,397 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 08:53:13,397 INFO ]: Found error trace [2018-06-25 08:53:13,398 INFO ]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:13,398 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:13,398 INFO ]: Analyzing trace with hash 1481541599, now seen corresponding path program 15 times [2018-06-25 08:53:13,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:13,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:13,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:13,398 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:13,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:13,421 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:14,158 INFO ]: Checked inductivity of 144 backedges. 100 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:14,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:14,158 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:14,163 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:53:14,236 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-25 08:53:14,236 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:14,242 INFO ]: Computing forward predicates... [2018-06-25 08:53:14,283 INFO ]: Checked inductivity of 144 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:14,302 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:14,303 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-25 08:53:14,303 INFO ]: Interpolant automaton has 37 states [2018-06-25 08:53:14,303 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-25 08:53:14,303 INFO ]: CoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 08:53:14,303 INFO ]: Start difference. First operand 43 states and 44 transitions. Second operand 37 states. [2018-06-25 08:53:15,105 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:15,105 INFO ]: Finished difference Result 46 states and 47 transitions. [2018-06-25 08:53:15,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 08:53:15,105 INFO ]: Start accepts. Automaton has 37 states. Word has length 42 [2018-06-25 08:53:15,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:15,106 INFO ]: With dead ends: 46 [2018-06-25 08:53:15,106 INFO ]: Without dead ends: 46 [2018-06-25 08:53:15,107 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1398, Invalid=3432, Unknown=0, NotChecked=0, Total=4830 [2018-06-25 08:53:15,107 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-25 08:53:15,109 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-06-25 08:53:15,109 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 08:53:15,109 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-06-25 08:53:15,109 INFO ]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-06-25 08:53:15,109 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:15,109 INFO ]: Abstraction has 44 states and 45 transitions. [2018-06-25 08:53:15,109 INFO ]: Interpolant automaton has 37 states. [2018-06-25 08:53:15,109 INFO ]: Start isEmpty. Operand 44 states and 45 transitions. [2018-06-25 08:53:15,110 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-25 08:53:15,110 INFO ]: Found error trace [2018-06-25 08:53:15,110 INFO ]: trace histogram [9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:15,110 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:15,110 INFO ]: Analyzing trace with hash -1316022145, now seen corresponding path program 16 times [2018-06-25 08:53:15,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:15,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:15,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:15,110 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:15,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:15,136 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:15,830 INFO ]: Checked inductivity of 153 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 08:53:15,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:15,830 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:15,836 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:53:15,902 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:53:15,902 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:15,909 INFO ]: Computing forward predicates... [2018-06-25 08:53:16,930 INFO ]: Checked inductivity of 153 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 08:53:16,955 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:16,955 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-25 08:53:16,955 INFO ]: Interpolant automaton has 31 states [2018-06-25 08:53:16,956 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 08:53:16,956 INFO ]: CoverageRelationStatistics Valid=68, Invalid=862, Unknown=0, NotChecked=0, Total=930 [2018-06-25 08:53:16,956 INFO ]: Start difference. First operand 44 states and 45 transitions. Second operand 31 states. [2018-06-25 08:53:18,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:18,301 INFO ]: Finished difference Result 59 states and 61 transitions. [2018-06-25 08:53:18,302 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 08:53:18,302 INFO ]: Start accepts. Automaton has 31 states. Word has length 43 [2018-06-25 08:53:18,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:18,303 INFO ]: With dead ends: 59 [2018-06-25 08:53:18,303 INFO ]: Without dead ends: 49 [2018-06-25 08:53:18,304 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=247, Invalid=3175, Unknown=0, NotChecked=0, Total=3422 [2018-06-25 08:53:18,304 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-25 08:53:18,306 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-25 08:53:18,306 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 08:53:18,307 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-06-25 08:53:18,307 INFO ]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2018-06-25 08:53:18,307 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:18,307 INFO ]: Abstraction has 47 states and 48 transitions. [2018-06-25 08:53:18,307 INFO ]: Interpolant automaton has 31 states. [2018-06-25 08:53:18,307 INFO ]: Start isEmpty. Operand 47 states and 48 transitions. [2018-06-25 08:53:18,307 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-25 08:53:18,307 INFO ]: Found error trace [2018-06-25 08:53:18,307 INFO ]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:18,307 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:18,308 INFO ]: Analyzing trace with hash 2094312694, now seen corresponding path program 17 times [2018-06-25 08:53:18,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:18,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:18,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:18,313 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:18,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:18,337 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:18,943 INFO ]: Checked inductivity of 180 backedges. 126 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:18,943 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:18,943 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:18,951 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:53:19,039 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-25 08:53:19,039 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:19,047 INFO ]: Computing forward predicates... [2018-06-25 08:53:19,096 INFO ]: Checked inductivity of 180 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:19,117 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:19,117 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-06-25 08:53:19,118 INFO ]: Interpolant automaton has 41 states [2018-06-25 08:53:19,118 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-25 08:53:19,118 INFO ]: CoverageRelationStatistics Valid=242, Invalid=1398, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 08:53:19,118 INFO ]: Start difference. First operand 47 states and 48 transitions. Second operand 41 states. [2018-06-25 08:53:20,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:20,062 INFO ]: Finished difference Result 50 states and 51 transitions. [2018-06-25 08:53:20,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-25 08:53:20,062 INFO ]: Start accepts. Automaton has 41 states. Word has length 46 [2018-06-25 08:53:20,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:20,063 INFO ]: With dead ends: 50 [2018-06-25 08:53:20,063 INFO ]: Without dead ends: 50 [2018-06-25 08:53:20,064 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1733, Invalid=4273, Unknown=0, NotChecked=0, Total=6006 [2018-06-25 08:53:20,064 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-25 08:53:20,066 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-06-25 08:53:20,066 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 08:53:20,066 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-06-25 08:53:20,066 INFO ]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-06-25 08:53:20,066 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:20,066 INFO ]: Abstraction has 48 states and 49 transitions. [2018-06-25 08:53:20,066 INFO ]: Interpolant automaton has 41 states. [2018-06-25 08:53:20,066 INFO ]: Start isEmpty. Operand 48 states and 49 transitions. [2018-06-25 08:53:20,067 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-25 08:53:20,067 INFO ]: Found error trace [2018-06-25 08:53:20,067 INFO ]: trace histogram [10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:20,067 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:20,067 INFO ]: Analyzing trace with hash 500012616, now seen corresponding path program 18 times [2018-06-25 08:53:20,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:20,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:20,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:20,068 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:20,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:20,095 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:20,946 INFO ]: Checked inductivity of 190 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 08:53:20,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:20,946 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:20,951 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:53:21,035 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-25 08:53:21,035 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:21,043 INFO ]: Computing forward predicates... [2018-06-25 08:53:21,383 INFO ]: Checked inductivity of 190 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 08:53:21,403 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:21,403 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-25 08:53:21,403 INFO ]: Interpolant automaton has 34 states [2018-06-25 08:53:21,403 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 08:53:21,403 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1047, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 08:53:21,403 INFO ]: Start difference. First operand 48 states and 49 transitions. Second operand 34 states. [2018-06-25 08:53:22,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:22,958 INFO ]: Finished difference Result 64 states and 66 transitions. [2018-06-25 08:53:22,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 08:53:22,960 INFO ]: Start accepts. Automaton has 34 states. Word has length 47 [2018-06-25 08:53:22,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:22,960 INFO ]: With dead ends: 64 [2018-06-25 08:53:22,960 INFO ]: Without dead ends: 53 [2018-06-25 08:53:22,961 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 44 SyntacticMatches, 13 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=273, Invalid=3887, Unknown=0, NotChecked=0, Total=4160 [2018-06-25 08:53:22,961 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-25 08:53:22,963 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-06-25 08:53:22,963 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-25 08:53:22,963 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-06-25 08:53:22,963 INFO ]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 47 [2018-06-25 08:53:22,963 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:22,963 INFO ]: Abstraction has 51 states and 52 transitions. [2018-06-25 08:53:22,963 INFO ]: Interpolant automaton has 34 states. [2018-06-25 08:53:22,963 INFO ]: Start isEmpty. Operand 51 states and 52 transitions. [2018-06-25 08:53:22,964 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-25 08:53:22,964 INFO ]: Found error trace [2018-06-25 08:53:22,964 INFO ]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:22,964 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:22,964 INFO ]: Analyzing trace with hash -357165249, now seen corresponding path program 19 times [2018-06-25 08:53:22,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:22,964 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:22,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:22,965 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:22,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:22,988 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:24,337 INFO ]: Checked inductivity of 220 backedges. 155 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:24,338 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:24,338 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:24,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:53:24,419 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:24,426 INFO ]: Computing forward predicates... [2018-06-25 08:53:24,488 INFO ]: Checked inductivity of 220 backedges. 165 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:24,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:24,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-06-25 08:53:24,521 INFO ]: Interpolant automaton has 45 states [2018-06-25 08:53:24,521 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-25 08:53:24,522 INFO ]: CoverageRelationStatistics Valid=288, Invalid=1692, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 08:53:24,522 INFO ]: Start difference. First operand 51 states and 52 transitions. Second operand 45 states. [2018-06-25 08:53:25,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:25,731 INFO ]: Finished difference Result 54 states and 55 transitions. [2018-06-25 08:53:25,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-25 08:53:25,731 INFO ]: Start accepts. Automaton has 45 states. Word has length 50 [2018-06-25 08:53:25,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:25,732 INFO ]: With dead ends: 54 [2018-06-25 08:53:25,732 INFO ]: Without dead ends: 54 [2018-06-25 08:53:25,733 INFO ]: 0 DeclaredPredicates, 136 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2104, Invalid=5206, Unknown=0, NotChecked=0, Total=7310 [2018-06-25 08:53:25,733 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-25 08:53:25,735 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-25 08:53:25,735 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-25 08:53:25,735 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-06-25 08:53:25,735 INFO ]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-06-25 08:53:25,735 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:25,735 INFO ]: Abstraction has 52 states and 53 transitions. [2018-06-25 08:53:25,735 INFO ]: Interpolant automaton has 45 states. [2018-06-25 08:53:25,735 INFO ]: Start isEmpty. Operand 52 states and 53 transitions. [2018-06-25 08:53:25,735 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-25 08:53:25,735 INFO ]: Found error trace [2018-06-25 08:53:25,735 INFO ]: trace histogram [11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:25,736 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:25,736 INFO ]: Analyzing trace with hash 1813607711, now seen corresponding path program 20 times [2018-06-25 08:53:25,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:25,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:25,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:25,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:53:25,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:25,763 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:26,848 INFO ]: Checked inductivity of 231 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 08:53:26,848 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:26,848 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:26,854 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:53:26,927 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:53:26,927 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:26,936 INFO ]: Computing forward predicates... [2018-06-25 08:53:27,355 INFO ]: Checked inductivity of 231 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 08:53:27,374 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:27,374 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-25 08:53:27,374 INFO ]: Interpolant automaton has 37 states [2018-06-25 08:53:27,374 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-25 08:53:27,375 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1250, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 08:53:27,375 INFO ]: Start difference. First operand 52 states and 53 transitions. Second operand 37 states. [2018-06-25 08:53:28,174 WARN ]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-06-25 08:53:29,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:29,477 INFO ]: Finished difference Result 69 states and 71 transitions. [2018-06-25 08:53:29,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-25 08:53:29,477 INFO ]: Start accepts. Automaton has 37 states. Word has length 51 [2018-06-25 08:53:29,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:29,478 INFO ]: With dead ends: 69 [2018-06-25 08:53:29,478 INFO ]: Without dead ends: 57 [2018-06-25 08:53:29,478 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 48 SyntacticMatches, 14 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=299, Invalid=4671, Unknown=0, NotChecked=0, Total=4970 [2018-06-25 08:53:29,478 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 08:53:29,479 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-25 08:53:29,479 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-25 08:53:29,480 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-06-25 08:53:29,480 INFO ]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 51 [2018-06-25 08:53:29,480 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:29,480 INFO ]: Abstraction has 55 states and 56 transitions. [2018-06-25 08:53:29,480 INFO ]: Interpolant automaton has 37 states. [2018-06-25 08:53:29,480 INFO ]: Start isEmpty. Operand 55 states and 56 transitions. [2018-06-25 08:53:29,481 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-25 08:53:29,481 INFO ]: Found error trace [2018-06-25 08:53:29,481 INFO ]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:29,481 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:29,481 INFO ]: Analyzing trace with hash -1638227306, now seen corresponding path program 21 times [2018-06-25 08:53:29,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:29,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:29,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:29,481 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:29,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:29,508 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:30,811 INFO ]: Checked inductivity of 264 backedges. 187 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:30,811 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:30,811 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:30,817 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:53:30,915 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-25 08:53:30,915 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:30,921 INFO ]: Computing forward predicates... [2018-06-25 08:53:30,969 INFO ]: Checked inductivity of 264 backedges. 198 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:30,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:30,989 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-06-25 08:53:30,989 INFO ]: Interpolant automaton has 49 states [2018-06-25 08:53:30,989 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-25 08:53:30,989 INFO ]: CoverageRelationStatistics Valid=338, Invalid=2014, Unknown=0, NotChecked=0, Total=2352 [2018-06-25 08:53:30,989 INFO ]: Start difference. First operand 55 states and 56 transitions. Second operand 49 states. [2018-06-25 08:53:32,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:32,288 INFO ]: Finished difference Result 58 states and 59 transitions. [2018-06-25 08:53:32,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-25 08:53:32,289 INFO ]: Start accepts. Automaton has 49 states. Word has length 54 [2018-06-25 08:53:32,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:32,289 INFO ]: With dead ends: 58 [2018-06-25 08:53:32,289 INFO ]: Without dead ends: 58 [2018-06-25 08:53:32,290 INFO ]: 0 DeclaredPredicates, 148 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2511, Invalid=6231, Unknown=0, NotChecked=0, Total=8742 [2018-06-25 08:53:32,290 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-25 08:53:32,292 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-25 08:53:32,292 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-25 08:53:32,292 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-06-25 08:53:32,292 INFO ]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2018-06-25 08:53:32,293 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:32,293 INFO ]: Abstraction has 56 states and 57 transitions. [2018-06-25 08:53:32,293 INFO ]: Interpolant automaton has 49 states. [2018-06-25 08:53:32,293 INFO ]: Start isEmpty. Operand 56 states and 57 transitions. [2018-06-25 08:53:32,293 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-25 08:53:32,293 INFO ]: Found error trace [2018-06-25 08:53:32,293 INFO ]: trace histogram [12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:32,293 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:32,294 INFO ]: Analyzing trace with hash 755389608, now seen corresponding path program 22 times [2018-06-25 08:53:32,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:32,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:32,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:32,294 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:32,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:32,325 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:33,530 INFO ]: Checked inductivity of 276 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-25 08:53:33,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:33,530 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:33,537 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:53:33,616 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:53:33,616 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:33,625 INFO ]: Computing forward predicates... [2018-06-25 08:53:34,116 INFO ]: Checked inductivity of 276 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-25 08:53:34,135 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:34,135 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-06-25 08:53:34,135 INFO ]: Interpolant automaton has 40 states [2018-06-25 08:53:34,136 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 08:53:34,136 INFO ]: CoverageRelationStatistics Valid=89, Invalid=1471, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 08:53:34,136 INFO ]: Start difference. First operand 56 states and 57 transitions. Second operand 40 states. [2018-06-25 08:53:36,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:36,294 INFO ]: Finished difference Result 74 states and 76 transitions. [2018-06-25 08:53:36,295 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-25 08:53:36,295 INFO ]: Start accepts. Automaton has 40 states. Word has length 55 [2018-06-25 08:53:36,295 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:36,296 INFO ]: With dead ends: 74 [2018-06-25 08:53:36,296 INFO ]: Without dead ends: 61 [2018-06-25 08:53:36,296 INFO ]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 15 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=325, Invalid=5527, Unknown=0, NotChecked=0, Total=5852 [2018-06-25 08:53:36,296 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-25 08:53:36,297 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-06-25 08:53:36,297 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-25 08:53:36,298 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-06-25 08:53:36,298 INFO ]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 55 [2018-06-25 08:53:36,298 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:36,298 INFO ]: Abstraction has 59 states and 60 transitions. [2018-06-25 08:53:36,298 INFO ]: Interpolant automaton has 40 states. [2018-06-25 08:53:36,298 INFO ]: Start isEmpty. Operand 59 states and 60 transitions. [2018-06-25 08:53:36,298 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-25 08:53:36,298 INFO ]: Found error trace [2018-06-25 08:53:36,298 INFO ]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:36,298 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:36,298 INFO ]: Analyzing trace with hash -680137057, now seen corresponding path program 23 times [2018-06-25 08:53:36,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:36,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:36,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:36,299 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:36,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:36,326 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:37,609 INFO ]: Checked inductivity of 312 backedges. 222 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:37,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:37,609 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:37,623 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:53:37,724 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-25 08:53:37,724 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:37,731 INFO ]: Computing forward predicates... [2018-06-25 08:53:37,820 INFO ]: Checked inductivity of 312 backedges. 234 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:37,840 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:37,840 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2018-06-25 08:53:37,840 INFO ]: Interpolant automaton has 53 states [2018-06-25 08:53:37,840 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-25 08:53:37,840 INFO ]: CoverageRelationStatistics Valid=392, Invalid=2364, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 08:53:37,840 INFO ]: Start difference. First operand 59 states and 60 transitions. Second operand 53 states. [2018-06-25 08:53:39,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:39,257 INFO ]: Finished difference Result 62 states and 63 transitions. [2018-06-25 08:53:39,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-25 08:53:39,257 INFO ]: Start accepts. Automaton has 53 states. Word has length 58 [2018-06-25 08:53:39,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:39,257 INFO ]: With dead ends: 62 [2018-06-25 08:53:39,257 INFO ]: Without dead ends: 62 [2018-06-25 08:53:39,258 INFO ]: 0 DeclaredPredicates, 160 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2954, Invalid=7348, Unknown=0, NotChecked=0, Total=10302 [2018-06-25 08:53:39,259 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-25 08:53:39,260 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-06-25 08:53:39,260 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-25 08:53:39,260 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-06-25 08:53:39,260 INFO ]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2018-06-25 08:53:39,261 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:39,261 INFO ]: Abstraction has 60 states and 61 transitions. [2018-06-25 08:53:39,261 INFO ]: Interpolant automaton has 53 states. [2018-06-25 08:53:39,261 INFO ]: Start isEmpty. Operand 60 states and 61 transitions. [2018-06-25 08:53:39,261 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-25 08:53:39,261 INFO ]: Found error trace [2018-06-25 08:53:39,261 INFO ]: trace histogram [13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:39,261 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:39,261 INFO ]: Analyzing trace with hash 391416255, now seen corresponding path program 24 times [2018-06-25 08:53:39,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:39,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:39,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:39,262 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:39,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:39,289 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:40,344 INFO ]: Checked inductivity of 325 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-25 08:53:40,344 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:40,344 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:40,351 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:53:40,457 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-25 08:53:40,457 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:40,472 INFO ]: Computing forward predicates... [2018-06-25 08:53:41,016 INFO ]: Checked inductivity of 325 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-25 08:53:41,036 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:41,036 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-06-25 08:53:41,036 INFO ]: Interpolant automaton has 43 states [2018-06-25 08:53:41,036 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-25 08:53:41,036 INFO ]: CoverageRelationStatistics Valid=96, Invalid=1710, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 08:53:41,036 INFO ]: Start difference. First operand 60 states and 61 transitions. Second operand 43 states. [2018-06-25 08:53:43,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:43,599 INFO ]: Finished difference Result 79 states and 81 transitions. [2018-06-25 08:53:43,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-25 08:53:43,600 INFO ]: Start accepts. Automaton has 43 states. Word has length 59 [2018-06-25 08:53:43,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:43,600 INFO ]: With dead ends: 79 [2018-06-25 08:53:43,600 INFO ]: Without dead ends: 65 [2018-06-25 08:53:43,601 INFO ]: 0 DeclaredPredicates, 153 GetRequests, 56 SyntacticMatches, 16 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=351, Invalid=6455, Unknown=0, NotChecked=0, Total=6806 [2018-06-25 08:53:43,601 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-25 08:53:43,603 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-06-25 08:53:43,603 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-25 08:53:43,603 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-06-25 08:53:43,603 INFO ]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 59 [2018-06-25 08:53:43,603 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:43,603 INFO ]: Abstraction has 63 states and 64 transitions. [2018-06-25 08:53:43,603 INFO ]: Interpolant automaton has 43 states. [2018-06-25 08:53:43,603 INFO ]: Start isEmpty. Operand 63 states and 64 transitions. [2018-06-25 08:53:43,604 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-25 08:53:43,604 INFO ]: Found error trace [2018-06-25 08:53:43,604 INFO ]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:43,604 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:43,604 INFO ]: Analyzing trace with hash 1810386998, now seen corresponding path program 25 times [2018-06-25 08:53:43,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:43,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:43,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:43,604 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:53:43,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:43,635 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:44,512 INFO ]: Checked inductivity of 364 backedges. 260 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:44,512 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:44,512 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:44,519 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:53:44,603 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:44,610 INFO ]: Computing forward predicates... [2018-06-25 08:53:44,688 INFO ]: Checked inductivity of 364 backedges. 273 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:53:44,708 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:44,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2018-06-25 08:53:44,708 INFO ]: Interpolant automaton has 57 states [2018-06-25 08:53:44,708 INFO ]: Constructing interpolant automaton starting with 57 interpolants. [2018-06-25 08:53:44,709 INFO ]: CoverageRelationStatistics Valid=450, Invalid=2742, Unknown=0, NotChecked=0, Total=3192 [2018-06-25 08:53:44,709 INFO ]: Start difference. First operand 63 states and 64 transitions. Second operand 57 states. [2018-06-25 08:53:46,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:53:46,358 INFO ]: Finished difference Result 66 states and 67 transitions. [2018-06-25 08:53:46,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-25 08:53:46,358 INFO ]: Start accepts. Automaton has 57 states. Word has length 62 [2018-06-25 08:53:46,358 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:53:46,358 INFO ]: With dead ends: 66 [2018-06-25 08:53:46,358 INFO ]: Without dead ends: 66 [2018-06-25 08:53:46,359 INFO ]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3433, Invalid=8557, Unknown=0, NotChecked=0, Total=11990 [2018-06-25 08:53:46,359 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-25 08:53:46,360 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-06-25 08:53:46,360 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 08:53:46,361 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-06-25 08:53:46,361 INFO ]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-06-25 08:53:46,361 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:53:46,361 INFO ]: Abstraction has 64 states and 65 transitions. [2018-06-25 08:53:46,361 INFO ]: Interpolant automaton has 57 states. [2018-06-25 08:53:46,361 INFO ]: Start isEmpty. Operand 64 states and 65 transitions. [2018-06-25 08:53:46,361 INFO ]: Finished isEmpty. Found accepting run of length 64 [2018-06-25 08:53:46,361 INFO ]: Found error trace [2018-06-25 08:53:46,361 INFO ]: trace histogram [14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:53:46,361 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:53:46,361 INFO ]: Analyzing trace with hash 288250632, now seen corresponding path program 26 times [2018-06-25 08:53:46,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:53:46,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:53:46,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:46,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:53:46,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:53:46,392 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:47,883 INFO ]: Checked inductivity of 378 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-06-25 08:53:47,883 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:53:47,883 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 08:53:47,889 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:53:47,998 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:53:47,998 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:53:48,010 INFO ]: Computing forward predicates... [2018-06-25 08:53:50,313 INFO ]: Checked inductivity of 378 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-06-25 08:53:50,333 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:53:50,333 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-06-25 08:53:50,333 INFO ]: Interpolant automaton has 46 states [2018-06-25 08:53:50,333 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-25 08:53:50,333 INFO ]: CoverageRelationStatistics Valid=103, Invalid=1967, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 08:53:50,333 INFO ]: Start difference. First operand 64 states and 65 transitions. Second operand 46 states. Received shutdown request... [2018-06-25 08:53:50,611 WARN ]: Removed 1 from assertion stack [2018-06-25 08:53:50,611 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 08:53:50,611 WARN ]: Verification canceled [2018-06-25 08:53:50,713 WARN ]: Timeout [2018-06-25 08:53:50,713 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:53:50 BoogieIcfgContainer [2018-06-25 08:53:50,713 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 08:53:50,714 INFO ]: Toolchain (without parser) took 59537.43 ms. Allocated memory was 306.2 MB in the beginning and 851.4 MB in the end (delta: 545.3 MB). Free memory was 260.6 MB in the beginning and 822.9 MB in the end (delta: -562.4 MB). Peak memory consumption was 243.1 MB. Max. memory is 3.6 GB. [2018-06-25 08:53:50,715 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:53:50,715 INFO ]: ChcToBoogie took 63.86 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:53:50,716 INFO ]: Boogie Preprocessor took 35.99 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:53:50,716 INFO ]: RCFGBuilder took 297.35 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 246.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:53:50,716 INFO ]: TraceAbstraction took 59130.70 ms. Allocated memory was 306.2 MB in the beginning and 851.4 MB in the end (delta: 545.3 MB). Free memory was 246.6 MB in the beginning and 822.9 MB in the end (delta: -576.3 MB). Peak memory consumption was 229.1 MB. Max. memory is 3.6 GB. [2018-06-25 08:53:50,719 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.86 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.99 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 297.35 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 246.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59130.70 ms. Allocated memory was 306.2 MB in the beginning and 851.4 MB in the end (delta: 545.3 MB). Free memory was 246.6 MB in the beginning and 822.9 MB in the end (delta: -576.3 MB). Peak memory consumption was 229.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 7 states, 46 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 38. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 59.0s OverallTime, 34 OverallIterations, 14 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 348 SDtfs, 1114 SDslu, 3551 SDs, 0 SdLazy, 13196 SolverSat, 3534 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2643 GetRequests, 1040 SyntacticMatches, 148 SemanticMatches, 1454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12269 ImplicationChecksByTransitivity, 42.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 82 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 27.3s InterpolantComputationTime, 2127 NumberOfCodeBlocks, 2127 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 2064 ConstructedInterpolants, 0 QuantifiedInterpolants, 853179 SizeOfPredicates, 1888 NumberOfNonLiveVariables, 14216 ConjunctsInSsa, 5201 ConjunctsInUnsatCore, 63 InterpolantComputations, 6 PerfectInterpolantSequences, 3770/7507 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2-big2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_08-53-50-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2-big2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_08-53-50-734.csv Completed graceful shutdown