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/reve/021-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:15:42,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:15:42,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:15:42,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:15:42,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:15:42,794 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:15:42,795 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:15:42,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:15:42,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:15:42,802 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:15:42,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:15:42,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:15:42,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:15:42,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:15:42,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:15:42,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:15:42,811 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:15:42,824 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:15:42,826 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:15:42,827 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:15:42,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:15:42,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:15:42,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:15:42,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:15:42,831 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:15:42,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:15:42,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:15:42,838 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:15:42,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:15:42,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:15:42,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:15:42,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:15:42,845 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:15:42,846 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:15:42,846 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:15:42,846 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:15:42,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:15:42,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:15:42,869 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:15:42,869 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:15:42,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:15:42,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:15:42,871 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:15:42,871 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:15:42,871 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:15:42,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:15:42,871 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:15:42,872 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:15:42,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:15:42,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:15:42,872 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:15:42,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:15:42,873 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:15:42,873 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:15:42,873 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:15:42,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:15:42,873 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:15:42,875 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:15:42,875 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:15:42,920 INFO ]: Repository-Root is: /tmp [2018-06-25 09:15:42,938 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:15:42,943 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:15:42,945 INFO ]: Initializing SmtParser... [2018-06-25 09:15:42,945 INFO ]: SmtParser initialized [2018-06-25 09:15:42,945 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/021-horn.smt2 [2018-06-25 09:15:42,947 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 09:15:43,038 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/021-horn.smt2 unknown [2018-06-25 09:15:43,234 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/021-horn.smt2 [2018-06-25 09:15:43,238 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:15:43,244 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:15:43,245 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:15:43,245 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:15:43,245 INFO ]: ChcToBoogie initialized [2018-06-25 09:15:43,248 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:15:43" (1/1) ... [2018-06-25 09:15:43,313 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:15:43 Unit [2018-06-25 09:15:43,313 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:15:43,313 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:15:43,313 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:15:43,313 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:15:43,335 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:15:43" (1/1) ... [2018-06-25 09:15:43,335 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:15:43" (1/1) ... [2018-06-25 09:15:43,341 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:15:43" (1/1) ... [2018-06-25 09:15:43,341 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:15:43" (1/1) ... [2018-06-25 09:15:43,346 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:15:43" (1/1) ... [2018-06-25 09:15:43,348 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:15:43" (1/1) ... [2018-06-25 09:15:43,349 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:15:43" (1/1) ... [2018-06-25 09:15:43,357 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:15:43,357 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:15:43,357 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:15:43,357 INFO ]: RCFGBuilder initialized [2018-06-25 09:15:43,358 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:15:43" (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 09:15:43,372 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:15:43,372 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:15:43,372 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:15:43,372 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:15:43,372 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:15:43,372 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 09:15:43,759 INFO ]: Using library mode [2018-06-25 09:15:43,763 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:15:43 BoogieIcfgContainer [2018-06-25 09:15:43,763 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:15:43,764 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:15:43,764 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:15:43,767 INFO ]: TraceAbstraction initialized [2018-06-25 09:15:43,767 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:15:43" (1/3) ... [2018-06-25 09:15:43,768 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7514cd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:15:43, skipping insertion in model container [2018-06-25 09:15:43,768 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:15:43" (2/3) ... [2018-06-25 09:15:43,768 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7514cd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:15:43, skipping insertion in model container [2018-06-25 09:15:43,768 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:15:43" (3/3) ... [2018-06-25 09:15:43,773 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:15:43,781 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:15:43,788 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:15:43,829 INFO ]: Using default assertion order modulation [2018-06-25 09:15:43,830 INFO ]: Interprodecural is true [2018-06-25 09:15:43,830 INFO ]: Hoare is false [2018-06-25 09:15:43,830 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:15:43,830 INFO ]: Backedges is TWOTRACK [2018-06-25 09:15:43,830 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:15:43,830 INFO ]: Difference is false [2018-06-25 09:15:43,830 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:15:43,830 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:15:43,843 INFO ]: Start isEmpty. Operand 31 states. [2018-06-25 09:15:43,856 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:15:43,856 INFO ]: Found error trace [2018-06-25 09:15:43,857 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:15:43,857 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:15:43,860 INFO ]: Analyzing trace with hash 18628553, now seen corresponding path program 1 times [2018-06-25 09:15:43,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:15:43,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:15:43,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:43,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:43,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:43,922 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:43,978 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:15:43,980 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:15:43,980 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:15:43,982 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:15:43,992 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:15:43,992 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:15:43,994 INFO ]: Start difference. First operand 31 states. Second operand 4 states. [2018-06-25 09:15:44,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:15:44,663 INFO ]: Finished difference Result 47 states and 73 transitions. [2018-06-25 09:15:44,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:15:44,665 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-25 09:15:44,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:15:44,675 INFO ]: With dead ends: 47 [2018-06-25 09:15:44,675 INFO ]: Without dead ends: 47 [2018-06-25 09:15:44,677 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:15:44,692 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-25 09:15:44,725 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-25 09:15:44,730 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 09:15:44,738 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-06-25 09:15:44,739 INFO ]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 7 [2018-06-25 09:15:44,739 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:15:44,740 INFO ]: Abstraction has 47 states and 73 transitions. [2018-06-25 09:15:44,740 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:15:44,740 INFO ]: Start isEmpty. Operand 47 states and 73 transitions. [2018-06-25 09:15:44,741 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:15:44,741 INFO ]: Found error trace [2018-06-25 09:15:44,741 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:15:44,742 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:15:44,742 INFO ]: Analyzing trace with hash 578775496, now seen corresponding path program 1 times [2018-06-25 09:15:44,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:15:44,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:15:44,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:44,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:44,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:44,750 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:44,796 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:15:44,796 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:15:44,796 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:15:44,797 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:15:44,798 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:15:44,798 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:15:44,798 INFO ]: Start difference. First operand 47 states and 73 transitions. Second operand 4 states. [2018-06-25 09:15:45,034 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:15:45,034 INFO ]: Finished difference Result 69 states and 108 transitions. [2018-06-25 09:15:45,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:15:45,034 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:15:45,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:15:45,037 INFO ]: With dead ends: 69 [2018-06-25 09:15:45,037 INFO ]: Without dead ends: 69 [2018-06-25 09:15:45,038 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:15:45,038 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-25 09:15:45,049 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-25 09:15:45,049 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-25 09:15:45,052 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 108 transitions. [2018-06-25 09:15:45,052 INFO ]: Start accepts. Automaton has 69 states and 108 transitions. Word has length 8 [2018-06-25 09:15:45,053 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:15:45,053 INFO ]: Abstraction has 69 states and 108 transitions. [2018-06-25 09:15:45,053 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:15:45,053 INFO ]: Start isEmpty. Operand 69 states and 108 transitions. [2018-06-25 09:15:45,054 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:15:45,054 INFO ]: Found error trace [2018-06-25 09:15:45,054 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:15:45,054 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:15:45,055 INFO ]: Analyzing trace with hash 783510888, now seen corresponding path program 1 times [2018-06-25 09:15:45,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:15:45,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:15:45,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:45,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:45,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:45,060 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:45,093 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:15:45,093 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:15:45,093 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:15:45,093 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:15:45,093 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:15:45,094 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:15:45,094 INFO ]: Start difference. First operand 69 states and 108 transitions. Second operand 4 states. [2018-06-25 09:15:45,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:15:45,539 INFO ]: Finished difference Result 91 states and 143 transitions. [2018-06-25 09:15:45,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:15:45,540 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:15:45,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:15:45,543 INFO ]: With dead ends: 91 [2018-06-25 09:15:45,543 INFO ]: Without dead ends: 91 [2018-06-25 09:15:45,543 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:15:45,543 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-25 09:15:45,557 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-06-25 09:15:45,557 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-25 09:15:45,561 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2018-06-25 09:15:45,561 INFO ]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 9 [2018-06-25 09:15:45,561 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:15:45,561 INFO ]: Abstraction has 91 states and 143 transitions. [2018-06-25 09:15:45,561 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:15:45,561 INFO ]: Start isEmpty. Operand 91 states and 143 transitions. [2018-06-25 09:15:45,566 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:15:45,566 INFO ]: Found error trace [2018-06-25 09:15:45,566 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:15:45,566 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:15:45,566 INFO ]: Analyzing trace with hash 1326495729, now seen corresponding path program 1 times [2018-06-25 09:15:45,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:15:45,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:15:45,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:45,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:45,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:45,589 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:45,862 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-25 09:15:45,960 INFO ]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:15:45,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:15:45,960 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 09:15:45,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:46,006 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:46,018 INFO ]: Computing forward predicates... [2018-06-25 09:15:46,242 INFO ]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:15:46,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:15:46,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-25 09:15:46,264 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:15:46,264 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:15:46,264 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:15:46,264 INFO ]: Start difference. First operand 91 states and 143 transitions. Second operand 11 states. [2018-06-25 09:15:46,575 WARN ]: Spent 279.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-06-25 09:15:47,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:15:47,554 INFO ]: Finished difference Result 184 states and 444 transitions. [2018-06-25 09:15:47,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:15:47,554 INFO ]: Start accepts. Automaton has 11 states. Word has length 18 [2018-06-25 09:15:47,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:15:47,565 INFO ]: With dead ends: 184 [2018-06-25 09:15:47,565 INFO ]: Without dead ends: 182 [2018-06-25 09:15:47,566 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:15:47,566 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-25 09:15:47,613 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 103. [2018-06-25 09:15:47,613 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-25 09:15:47,616 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 171 transitions. [2018-06-25 09:15:47,616 INFO ]: Start accepts. Automaton has 103 states and 171 transitions. Word has length 18 [2018-06-25 09:15:47,616 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:15:47,616 INFO ]: Abstraction has 103 states and 171 transitions. [2018-06-25 09:15:47,616 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:15:47,616 INFO ]: Start isEmpty. Operand 103 states and 171 transitions. [2018-06-25 09:15:47,619 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:15:47,619 INFO ]: Found error trace [2018-06-25 09:15:47,619 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:15:47,620 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:15:47,620 INFO ]: Analyzing trace with hash 746746309, now seen corresponding path program 1 times [2018-06-25 09:15:47,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:15:47,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:15:47,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:47,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:47,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:47,629 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:47,673 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:15:47,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:15:47,673 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:15:47,673 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:15:47,673 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:15:47,673 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:15:47,673 INFO ]: Start difference. First operand 103 states and 171 transitions. Second operand 4 states. [2018-06-25 09:15:48,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:15:48,042 INFO ]: Finished difference Result 129 states and 212 transitions. [2018-06-25 09:15:48,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:15:48,042 INFO ]: Start accepts. Automaton has 4 states. Word has length 19 [2018-06-25 09:15:48,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:15:48,044 INFO ]: With dead ends: 129 [2018-06-25 09:15:48,044 INFO ]: Without dead ends: 103 [2018-06-25 09:15:48,044 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 09:15:48,044 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-25 09:15:48,061 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-06-25 09:15:48,061 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-25 09:15:48,063 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 165 transitions. [2018-06-25 09:15:48,063 INFO ]: Start accepts. Automaton has 103 states and 165 transitions. Word has length 19 [2018-06-25 09:15:48,063 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:15:48,063 INFO ]: Abstraction has 103 states and 165 transitions. [2018-06-25 09:15:48,063 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:15:48,063 INFO ]: Start isEmpty. Operand 103 states and 165 transitions. [2018-06-25 09:15:48,068 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:15:48,068 INFO ]: Found error trace [2018-06-25 09:15:48,068 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:15:48,068 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:15:48,068 INFO ]: Analyzing trace with hash 291103909, now seen corresponding path program 1 times [2018-06-25 09:15:48,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:15:48,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:15:48,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:48,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:48,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:48,087 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:48,173 INFO ]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:15:48,173 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:15:48,173 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 09:15:48,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:48,211 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:48,214 INFO ]: Computing forward predicates... [2018-06-25 09:15:48,265 INFO ]: Checked inductivity of 15 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:15:48,289 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:15:48,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 09:15:48,289 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:15:48,290 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:15:48,290 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:15:48,290 INFO ]: Start difference. First operand 103 states and 165 transitions. Second operand 9 states. [2018-06-25 09:15:49,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:15:49,735 INFO ]: Finished difference Result 159 states and 329 transitions. [2018-06-25 09:15:49,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:15:49,735 INFO ]: Start accepts. Automaton has 9 states. Word has length 26 [2018-06-25 09:15:49,735 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:15:49,738 INFO ]: With dead ends: 159 [2018-06-25 09:15:49,738 INFO ]: Without dead ends: 154 [2018-06-25 09:15:49,738 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:15:49,739 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-25 09:15:49,757 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 103. [2018-06-25 09:15:49,757 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-25 09:15:49,759 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 160 transitions. [2018-06-25 09:15:49,759 INFO ]: Start accepts. Automaton has 103 states and 160 transitions. Word has length 26 [2018-06-25 09:15:49,759 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:15:49,759 INFO ]: Abstraction has 103 states and 160 transitions. [2018-06-25 09:15:49,759 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:15:49,759 INFO ]: Start isEmpty. Operand 103 states and 160 transitions. [2018-06-25 09:15:49,761 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:15:49,761 INFO ]: Found error trace [2018-06-25 09:15:49,761 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:15:49,762 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:15:49,762 INFO ]: Analyzing trace with hash 2073394597, now seen corresponding path program 2 times [2018-06-25 09:15:49,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:15:49,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:15:49,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:49,763 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:49,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:49,781 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:49,876 INFO ]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:15:49,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:15:49,876 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 09:15:49,898 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:15:49,979 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:15:49,979 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:49,981 INFO ]: Computing forward predicates... [2018-06-25 09:15:50,056 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:15:50,077 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:15:50,077 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2018-06-25 09:15:50,077 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:15:50,078 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:15:50,078 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:15:50,078 INFO ]: Start difference. First operand 103 states and 160 transitions. Second operand 14 states. [2018-06-25 09:15:51,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:15:51,746 INFO ]: Finished difference Result 272 states and 762 transitions. [2018-06-25 09:15:51,746 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:15:51,746 INFO ]: Start accepts. Automaton has 14 states. Word has length 26 [2018-06-25 09:15:51,747 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:15:51,753 INFO ]: With dead ends: 272 [2018-06-25 09:15:51,753 INFO ]: Without dead ends: 253 [2018-06-25 09:15:51,754 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:15:51,754 INFO ]: Start minimizeSevpa. Operand 253 states. [2018-06-25 09:15:51,804 INFO ]: Finished minimizeSevpa. Reduced states from 253 to 145. [2018-06-25 09:15:51,804 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-25 09:15:51,809 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 273 transitions. [2018-06-25 09:15:51,810 INFO ]: Start accepts. Automaton has 145 states and 273 transitions. Word has length 26 [2018-06-25 09:15:51,810 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:15:51,810 INFO ]: Abstraction has 145 states and 273 transitions. [2018-06-25 09:15:51,810 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:15:51,810 INFO ]: Start isEmpty. Operand 145 states and 273 transitions. [2018-06-25 09:15:51,814 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:15:51,814 INFO ]: Found error trace [2018-06-25 09:15:51,814 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:15:51,814 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:15:51,815 INFO ]: Analyzing trace with hash 654793687, now seen corresponding path program 1 times [2018-06-25 09:15:51,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:15:51,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:15:51,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:51,815 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:15:51,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:51,832 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:52,043 INFO ]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:15:52,043 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:15:52,043 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 09:15:52,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:52,069 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:52,073 INFO ]: Computing forward predicates... [2018-06-25 09:15:52,400 INFO ]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:15:52,420 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:15:52,420 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-25 09:15:52,420 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:15:52,420 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:15:52,420 INFO ]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:15:52,421 INFO ]: Start difference. First operand 145 states and 273 transitions. Second operand 22 states. [2018-06-25 09:15:54,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:15:54,884 INFO ]: Finished difference Result 240 states and 608 transitions. [2018-06-25 09:15:54,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 09:15:54,884 INFO ]: Start accepts. Automaton has 22 states. Word has length 27 [2018-06-25 09:15:54,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:15:54,887 INFO ]: With dead ends: 240 [2018-06-25 09:15:54,887 INFO ]: Without dead ends: 240 [2018-06-25 09:15:54,888 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:15:54,888 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-25 09:15:54,916 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 169. [2018-06-25 09:15:54,916 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-25 09:15:54,919 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 333 transitions. [2018-06-25 09:15:54,919 INFO ]: Start accepts. Automaton has 169 states and 333 transitions. Word has length 27 [2018-06-25 09:15:54,921 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:15:54,921 INFO ]: Abstraction has 169 states and 333 transitions. [2018-06-25 09:15:54,921 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:15:54,921 INFO ]: Start isEmpty. Operand 169 states and 333 transitions. [2018-06-25 09:15:54,924 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:15:54,924 INFO ]: Found error trace [2018-06-25 09:15:54,924 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:15:54,924 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:15:54,924 INFO ]: Analyzing trace with hash 1436465725, now seen corresponding path program 2 times [2018-06-25 09:15:54,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:15:54,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:15:54,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:54,926 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:15:54,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:15:54,944 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:55,111 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:15:55,111 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:15:55,111 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 09:15:55,127 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:15:55,157 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:15:55,157 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:15:55,160 INFO ]: Computing forward predicates... [2018-06-25 09:15:55,265 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:15:55,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:15:55,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-25 09:15:55,284 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:15:55,284 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:15:55,284 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:15:55,285 INFO ]: Start difference. First operand 169 states and 333 transitions. Second operand 20 states. [2018-06-25 09:16:00,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:16:00,068 INFO ]: Finished difference Result 433 states and 1716 transitions. [2018-06-25 09:16:00,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-06-25 09:16:00,069 INFO ]: Start accepts. Automaton has 20 states. Word has length 27 [2018-06-25 09:16:00,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:16:00,080 INFO ]: With dead ends: 433 [2018-06-25 09:16:00,080 INFO ]: Without dead ends: 419 [2018-06-25 09:16:00,082 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2645 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1053, Invalid=6957, Unknown=0, NotChecked=0, Total=8010 [2018-06-25 09:16:00,083 INFO ]: Start minimizeSevpa. Operand 419 states. [2018-06-25 09:16:00,147 INFO ]: Finished minimizeSevpa. Reduced states from 419 to 222. [2018-06-25 09:16:00,147 INFO ]: Start removeUnreachable. Operand 222 states. [2018-06-25 09:16:00,152 INFO ]: Finished removeUnreachable. Reduced from 222 states to 222 states and 504 transitions. [2018-06-25 09:16:00,152 INFO ]: Start accepts. Automaton has 222 states and 504 transitions. Word has length 27 [2018-06-25 09:16:00,153 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:16:00,153 INFO ]: Abstraction has 222 states and 504 transitions. [2018-06-25 09:16:00,153 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:16:00,153 INFO ]: Start isEmpty. Operand 222 states and 504 transitions. [2018-06-25 09:16:00,156 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:16:00,156 INFO ]: Found error trace [2018-06-25 09:16:00,156 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:16:00,156 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:16:00,156 INFO ]: Analyzing trace with hash 738613790, now seen corresponding path program 1 times [2018-06-25 09:16:00,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:16:00,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:16:00,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:00,157 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:16:00,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:00,170 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:00,309 INFO ]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:16:00,309 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:16:00,309 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 09:16:00,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:00,327 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:00,329 INFO ]: Computing forward predicates... [2018-06-25 09:16:00,373 INFO ]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:16:00,392 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:16:00,392 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2018-06-25 09:16:00,392 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:16:00,392 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:16:00,392 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:16:00,393 INFO ]: Start difference. First operand 222 states and 504 transitions. Second operand 14 states. [2018-06-25 09:16:00,980 WARN ]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-25 09:16:01,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:16:01,832 INFO ]: Finished difference Result 349 states and 990 transitions. [2018-06-25 09:16:01,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 09:16:01,832 INFO ]: Start accepts. Automaton has 14 states. Word has length 28 [2018-06-25 09:16:01,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:16:01,838 INFO ]: With dead ends: 349 [2018-06-25 09:16:01,838 INFO ]: Without dead ends: 349 [2018-06-25 09:16:01,839 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:16:01,839 INFO ]: Start minimizeSevpa. Operand 349 states. [2018-06-25 09:16:01,865 INFO ]: Finished minimizeSevpa. Reduced states from 349 to 234. [2018-06-25 09:16:01,865 INFO ]: Start removeUnreachable. Operand 234 states. [2018-06-25 09:16:01,869 INFO ]: Finished removeUnreachable. Reduced from 234 states to 234 states and 562 transitions. [2018-06-25 09:16:01,869 INFO ]: Start accepts. Automaton has 234 states and 562 transitions. Word has length 28 [2018-06-25 09:16:01,869 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:16:01,869 INFO ]: Abstraction has 234 states and 562 transitions. [2018-06-25 09:16:01,869 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:16:01,869 INFO ]: Start isEmpty. Operand 234 states and 562 transitions. [2018-06-25 09:16:01,873 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 09:16:01,873 INFO ]: Found error trace [2018-06-25 09:16:01,873 INFO ]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:16:01,873 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:16:01,873 INFO ]: Analyzing trace with hash 905263172, now seen corresponding path program 1 times [2018-06-25 09:16:01,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:16:01,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:16:01,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:01,873 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:01,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:01,896 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:01,980 INFO ]: Checked inductivity of 38 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 09:16:01,980 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:16:01,980 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 09:16:01,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:02,005 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:02,007 INFO ]: Computing forward predicates... [2018-06-25 09:16:02,091 INFO ]: Checked inductivity of 38 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-25 09:16:02,110 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:16:02,110 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-06-25 09:16:02,110 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:16:02,110 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:16:02,110 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:16:02,111 INFO ]: Start difference. First operand 234 states and 562 transitions. Second operand 18 states. [2018-06-25 09:16:02,574 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 09:16:04,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:16:04,821 INFO ]: Finished difference Result 459 states and 1423 transitions. [2018-06-25 09:16:04,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-25 09:16:04,821 INFO ]: Start accepts. Automaton has 18 states. Word has length 37 [2018-06-25 09:16:04,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:16:04,830 INFO ]: With dead ends: 459 [2018-06-25 09:16:04,830 INFO ]: Without dead ends: 447 [2018-06-25 09:16:04,832 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=607, Invalid=3425, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 09:16:04,833 INFO ]: Start minimizeSevpa. Operand 447 states. [2018-06-25 09:16:04,872 INFO ]: Finished minimizeSevpa. Reduced states from 447 to 278. [2018-06-25 09:16:04,872 INFO ]: Start removeUnreachable. Operand 278 states. [2018-06-25 09:16:04,875 INFO ]: Finished removeUnreachable. Reduced from 278 states to 278 states and 623 transitions. [2018-06-25 09:16:04,876 INFO ]: Start accepts. Automaton has 278 states and 623 transitions. Word has length 37 [2018-06-25 09:16:04,876 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:16:04,876 INFO ]: Abstraction has 278 states and 623 transitions. [2018-06-25 09:16:04,876 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:16:04,876 INFO ]: Start isEmpty. Operand 278 states and 623 transitions. [2018-06-25 09:16:04,879 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 09:16:04,879 INFO ]: Found error trace [2018-06-25 09:16:04,881 INFO ]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:16:04,881 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:16:04,881 INFO ]: Analyzing trace with hash -1359260021, now seen corresponding path program 1 times [2018-06-25 09:16:04,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:16:04,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:16:04,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:04,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:04,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:04,894 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:05,037 INFO ]: Checked inductivity of 34 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:16:05,037 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:16:05,037 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 09:16:05,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:05,081 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:05,083 INFO ]: Computing forward predicates... [2018-06-25 09:16:05,173 INFO ]: Checked inductivity of 34 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:16:05,191 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:16:05,191 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-06-25 09:16:05,192 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:16:05,192 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:16:05,192 INFO ]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:16:05,192 INFO ]: Start difference. First operand 278 states and 623 transitions. Second operand 18 states. [2018-06-25 09:16:07,780 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:16:07,780 INFO ]: Finished difference Result 545 states and 1752 transitions. [2018-06-25 09:16:07,780 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-25 09:16:07,780 INFO ]: Start accepts. Automaton has 18 states. Word has length 35 [2018-06-25 09:16:07,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:16:07,792 INFO ]: With dead ends: 545 [2018-06-25 09:16:07,792 INFO ]: Without dead ends: 545 [2018-06-25 09:16:07,793 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=451, Invalid=3089, Unknown=0, NotChecked=0, Total=3540 [2018-06-25 09:16:07,793 INFO ]: Start minimizeSevpa. Operand 545 states. [2018-06-25 09:16:07,835 INFO ]: Finished minimizeSevpa. Reduced states from 545 to 355. [2018-06-25 09:16:07,835 INFO ]: Start removeUnreachable. Operand 355 states. [2018-06-25 09:16:07,840 INFO ]: Finished removeUnreachable. Reduced from 355 states to 355 states and 837 transitions. [2018-06-25 09:16:07,840 INFO ]: Start accepts. Automaton has 355 states and 837 transitions. Word has length 35 [2018-06-25 09:16:07,841 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:16:07,841 INFO ]: Abstraction has 355 states and 837 transitions. [2018-06-25 09:16:07,841 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:16:07,841 INFO ]: Start isEmpty. Operand 355 states and 837 transitions. [2018-06-25 09:16:07,846 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:16:07,846 INFO ]: Found error trace [2018-06-25 09:16:07,846 INFO ]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:16:07,846 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:16:07,846 INFO ]: Analyzing trace with hash -1192677621, now seen corresponding path program 3 times [2018-06-25 09:16:07,846 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:16:07,846 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:16:07,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:07,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:07,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:07,862 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:08,029 INFO ]: Checked inductivity of 47 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:16:08,029 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:16:08,029 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 09:16:08,034 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:16:08,067 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:16:08,067 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:08,069 INFO ]: Computing forward predicates... [2018-06-25 09:16:08,266 INFO ]: Checked inductivity of 47 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:16:08,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:16:08,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-25 09:16:08,291 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:16:08,291 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:16:08,292 INFO ]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:16:08,292 INFO ]: Start difference. First operand 355 states and 837 transitions. Second operand 26 states. [2018-06-25 09:16:09,752 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 09:16:10,533 WARN ]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 09:16:11,725 WARN ]: Spent 389.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-06-25 09:16:15,433 WARN ]: Spent 175.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-06-25 09:16:19,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:16:19,089 INFO ]: Finished difference Result 1033 states and 3426 transitions. [2018-06-25 09:16:19,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-06-25 09:16:19,089 INFO ]: Start accepts. Automaton has 26 states. Word has length 36 [2018-06-25 09:16:19,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:16:19,110 INFO ]: With dead ends: 1033 [2018-06-25 09:16:19,110 INFO ]: Without dead ends: 1033 [2018-06-25 09:16:19,122 INFO ]: 0 DeclaredPredicates, 250 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20133 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4210, Invalid=45742, Unknown=0, NotChecked=0, Total=49952 [2018-06-25 09:16:19,122 INFO ]: Start minimizeSevpa. Operand 1033 states. [2018-06-25 09:16:19,216 INFO ]: Finished minimizeSevpa. Reduced states from 1033 to 469. [2018-06-25 09:16:19,216 INFO ]: Start removeUnreachable. Operand 469 states. [2018-06-25 09:16:19,222 INFO ]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1119 transitions. [2018-06-25 09:16:19,222 INFO ]: Start accepts. Automaton has 469 states and 1119 transitions. Word has length 36 [2018-06-25 09:16:19,223 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:16:19,223 INFO ]: Abstraction has 469 states and 1119 transitions. [2018-06-25 09:16:19,223 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:16:19,223 INFO ]: Start isEmpty. Operand 469 states and 1119 transitions. [2018-06-25 09:16:19,229 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-25 09:16:19,229 INFO ]: Found error trace [2018-06-25 09:16:19,229 INFO ]: trace histogram [6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:16:19,229 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:16:19,230 INFO ]: Analyzing trace with hash -995119518, now seen corresponding path program 1 times [2018-06-25 09:16:19,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:16:19,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:16:19,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:19,231 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:16:19,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:19,243 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:20,867 INFO ]: Checked inductivity of 101 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-25 09:16:20,867 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:16:20,910 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:16:20,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:20,939 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:20,942 INFO ]: Computing forward predicates... [2018-06-25 09:16:21,109 INFO ]: Checked inductivity of 101 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-25 09:16:21,128 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:16:21,128 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-25 09:16:21,128 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:16:21,128 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:16:21,129 INFO ]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:16:21,129 INFO ]: Start difference. First operand 469 states and 1119 transitions. Second operand 25 states. [2018-06-25 09:16:25,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:16:25,029 INFO ]: Finished difference Result 953 states and 3009 transitions. [2018-06-25 09:16:25,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-06-25 09:16:25,029 INFO ]: Start accepts. Automaton has 25 states. Word has length 56 [2018-06-25 09:16:25,029 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:16:25,058 INFO ]: With dead ends: 953 [2018-06-25 09:16:25,058 INFO ]: Without dead ends: 953 [2018-06-25 09:16:25,058 INFO ]: 0 DeclaredPredicates, 151 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1773 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=732, Invalid=5748, Unknown=0, NotChecked=0, Total=6480 [2018-06-25 09:16:25,059 INFO ]: Start minimizeSevpa. Operand 953 states. [2018-06-25 09:16:25,135 INFO ]: Finished minimizeSevpa. Reduced states from 953 to 613. [2018-06-25 09:16:25,135 INFO ]: Start removeUnreachable. Operand 613 states. [2018-06-25 09:16:25,143 INFO ]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1393 transitions. [2018-06-25 09:16:25,143 INFO ]: Start accepts. Automaton has 613 states and 1393 transitions. Word has length 56 [2018-06-25 09:16:25,144 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:16:25,144 INFO ]: Abstraction has 613 states and 1393 transitions. [2018-06-25 09:16:25,144 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:16:25,144 INFO ]: Start isEmpty. Operand 613 states and 1393 transitions. [2018-06-25 09:16:25,153 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-25 09:16:25,153 INFO ]: Found error trace [2018-06-25 09:16:25,153 INFO ]: trace histogram [6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:16:25,153 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:16:25,153 INFO ]: Analyzing trace with hash -1846740022, now seen corresponding path program 1 times [2018-06-25 09:16:25,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:16:25,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:16:25,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:25,153 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:25,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:25,166 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:25,451 INFO ]: Checked inductivity of 89 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-25 09:16:25,451 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:16:25,451 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 09:16:25,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:25,477 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:25,480 INFO ]: Computing forward predicates... [2018-06-25 09:16:25,677 INFO ]: Checked inductivity of 89 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-25 09:16:25,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:16:25,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2018-06-25 09:16:25,697 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:16:25,697 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:16:25,697 INFO ]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:16:25,697 INFO ]: Start difference. First operand 613 states and 1393 transitions. Second operand 23 states. [2018-06-25 09:16:28,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:16:28,128 INFO ]: Finished difference Result 1034 states and 2887 transitions. [2018-06-25 09:16:28,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-06-25 09:16:28,129 INFO ]: Start accepts. Automaton has 23 states. Word has length 52 [2018-06-25 09:16:28,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:16:28,144 INFO ]: With dead ends: 1034 [2018-06-25 09:16:28,144 INFO ]: Without dead ends: 1034 [2018-06-25 09:16:28,146 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=482, Invalid=4074, Unknown=0, NotChecked=0, Total=4556 [2018-06-25 09:16:28,147 INFO ]: Start minimizeSevpa. Operand 1034 states. [2018-06-25 09:16:28,216 INFO ]: Finished minimizeSevpa. Reduced states from 1034 to 750. [2018-06-25 09:16:28,216 INFO ]: Start removeUnreachable. Operand 750 states. [2018-06-25 09:16:28,225 INFO ]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1616 transitions. [2018-06-25 09:16:28,226 INFO ]: Start accepts. Automaton has 750 states and 1616 transitions. Word has length 52 [2018-06-25 09:16:28,226 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:16:28,226 INFO ]: Abstraction has 750 states and 1616 transitions. [2018-06-25 09:16:28,226 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:16:28,226 INFO ]: Start isEmpty. Operand 750 states and 1616 transitions. [2018-06-25 09:16:28,255 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 09:16:28,255 INFO ]: Found error trace [2018-06-25 09:16:28,255 INFO ]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:16:28,255 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:16:28,255 INFO ]: Analyzing trace with hash 1127891453, now seen corresponding path program 4 times [2018-06-25 09:16:28,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:16:28,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:16:28,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:28,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:28,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:28,272 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:28,952 INFO ]: Checked inductivity of 84 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-25 09:16:28,952 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:16:28,953 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 09:16:28,965 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:16:28,987 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:16:28,987 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:28,990 INFO ]: Computing forward predicates... [2018-06-25 09:16:29,264 INFO ]: Checked inductivity of 84 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-25 09:16:29,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:16:29,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-06-25 09:16:29,283 INFO ]: Interpolant automaton has 33 states [2018-06-25 09:16:29,283 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-25 09:16:29,283 INFO ]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:16:29,283 INFO ]: Start difference. First operand 750 states and 1616 transitions. Second operand 33 states. [2018-06-25 09:16:38,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:16:38,265 INFO ]: Finished difference Result 1953 states and 6931 transitions. [2018-06-25 09:16:38,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-06-25 09:16:38,265 INFO ]: Start accepts. Automaton has 33 states. Word has length 45 [2018-06-25 09:16:38,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:16:38,313 INFO ]: With dead ends: 1953 [2018-06-25 09:16:38,313 INFO ]: Without dead ends: 1953 [2018-06-25 09:16:38,315 INFO ]: 0 DeclaredPredicates, 223 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12697 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2743, Invalid=33167, Unknown=0, NotChecked=0, Total=35910 [2018-06-25 09:16:38,316 INFO ]: Start minimizeSevpa. Operand 1953 states. [2018-06-25 09:16:38,506 INFO ]: Finished minimizeSevpa. Reduced states from 1953 to 975. [2018-06-25 09:16:38,506 INFO ]: Start removeUnreachable. Operand 975 states. [2018-06-25 09:16:38,522 INFO ]: Finished removeUnreachable. Reduced from 975 states to 975 states and 2268 transitions. [2018-06-25 09:16:38,523 INFO ]: Start accepts. Automaton has 975 states and 2268 transitions. Word has length 45 [2018-06-25 09:16:38,523 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:16:38,524 INFO ]: Abstraction has 975 states and 2268 transitions. [2018-06-25 09:16:38,524 INFO ]: Interpolant automaton has 33 states. [2018-06-25 09:16:38,524 INFO ]: Start isEmpty. Operand 975 states and 2268 transitions. [2018-06-25 09:16:38,558 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-25 09:16:38,558 INFO ]: Found error trace [2018-06-25 09:16:38,558 INFO ]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:16:38,558 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:16:38,558 INFO ]: Analyzing trace with hash 80366494, now seen corresponding path program 2 times [2018-06-25 09:16:38,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:16:38,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:16:38,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:38,559 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:16:38,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:38,568 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:38,864 INFO ]: Checked inductivity of 69 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:16:38,864 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:16:38,864 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 09:16:38,870 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:16:38,890 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:16:38,890 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:38,893 INFO ]: Computing forward predicates... [2018-06-25 09:16:38,934 INFO ]: Checked inductivity of 69 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-25 09:16:38,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:16:38,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-25 09:16:38,964 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:16:38,964 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:16:38,964 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:16:38,964 INFO ]: Start difference. First operand 975 states and 2268 transitions. Second operand 11 states. [2018-06-25 09:16:39,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:16:39,343 INFO ]: Finished difference Result 1015 states and 2549 transitions. [2018-06-25 09:16:39,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:16:39,344 INFO ]: Start accepts. Automaton has 11 states. Word has length 46 [2018-06-25 09:16:39,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:16:39,357 INFO ]: With dead ends: 1015 [2018-06-25 09:16:39,357 INFO ]: Without dead ends: 1015 [2018-06-25 09:16:39,358 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:16:39,358 INFO ]: Start minimizeSevpa. Operand 1015 states. [2018-06-25 09:16:39,418 INFO ]: Finished minimizeSevpa. Reduced states from 1015 to 951. [2018-06-25 09:16:39,418 INFO ]: Start removeUnreachable. Operand 951 states. [2018-06-25 09:16:39,498 INFO ]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2226 transitions. [2018-06-25 09:16:39,498 INFO ]: Start accepts. Automaton has 951 states and 2226 transitions. Word has length 46 [2018-06-25 09:16:39,498 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:16:39,498 INFO ]: Abstraction has 951 states and 2226 transitions. [2018-06-25 09:16:39,498 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:16:39,498 INFO ]: Start isEmpty. Operand 951 states and 2226 transitions. [2018-06-25 09:16:39,537 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-25 09:16:39,537 INFO ]: Found error trace [2018-06-25 09:16:39,537 INFO ]: trace histogram [6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:16:39,537 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:16:39,537 INFO ]: Analyzing trace with hash -1842221053, now seen corresponding path program 1 times [2018-06-25 09:16:39,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:16:39,537 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:16:39,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:39,538 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:16:39,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:39,546 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:40,118 INFO ]: Checked inductivity of 80 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-25 09:16:40,118 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:16:40,118 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 09:16:40,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:40,146 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:40,148 INFO ]: Computing forward predicates... [2018-06-25 09:16:40,236 INFO ]: Checked inductivity of 80 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-25 09:16:40,256 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:16:40,256 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 21 [2018-06-25 09:16:40,256 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:16:40,256 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:16:40,256 INFO ]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:16:40,256 INFO ]: Start difference. First operand 951 states and 2226 transitions. Second operand 21 states. [2018-06-25 09:16:42,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:16:42,577 INFO ]: Finished difference Result 1191 states and 3315 transitions. [2018-06-25 09:16:42,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-25 09:16:42,578 INFO ]: Start accepts. Automaton has 21 states. Word has length 53 [2018-06-25 09:16:42,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:16:42,596 INFO ]: With dead ends: 1191 [2018-06-25 09:16:42,596 INFO ]: Without dead ends: 1173 [2018-06-25 09:16:42,596 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=466, Invalid=3440, Unknown=0, NotChecked=0, Total=3906 [2018-06-25 09:16:42,597 INFO ]: Start minimizeSevpa. Operand 1173 states. [2018-06-25 09:16:42,671 INFO ]: Finished minimizeSevpa. Reduced states from 1173 to 1047. [2018-06-25 09:16:42,671 INFO ]: Start removeUnreachable. Operand 1047 states. [2018-06-25 09:16:42,691 INFO ]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 2589 transitions. [2018-06-25 09:16:42,692 INFO ]: Start accepts. Automaton has 1047 states and 2589 transitions. Word has length 53 [2018-06-25 09:16:42,692 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:16:42,692 INFO ]: Abstraction has 1047 states and 2589 transitions. [2018-06-25 09:16:42,692 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:16:42,692 INFO ]: Start isEmpty. Operand 1047 states and 2589 transitions. [2018-06-25 09:16:42,722 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-25 09:16:42,722 INFO ]: Found error trace [2018-06-25 09:16:42,722 INFO ]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:16:42,722 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:16:42,722 INFO ]: Analyzing trace with hash -1810154462, now seen corresponding path program 1 times [2018-06-25 09:16:42,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:16:42,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:16:42,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:42,723 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:42,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:16:42,730 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:43,315 INFO ]: Checked inductivity of 86 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-25 09:16:43,315 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:16:43,315 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 09:16:43,322 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:16:43,349 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:16:43,351 INFO ]: Computing forward predicates... [2018-06-25 09:16:43,492 INFO ]: Checked inductivity of 86 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-25 09:16:43,516 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:16:43,516 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-06-25 09:16:43,516 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:16:43,516 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:16:43,517 INFO ]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:16:43,517 INFO ]: Start difference. First operand 1047 states and 2589 transitions. Second operand 23 states. Received shutdown request... [2018-06-25 09:16:43,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:16:43,602 WARN ]: Verification canceled [2018-06-25 09:16:43,606 WARN ]: Timeout [2018-06-25 09:16:43,606 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:16:43 BoogieIcfgContainer [2018-06-25 09:16:43,606 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:16:43,606 INFO ]: Toolchain (without parser) took 60367.63 ms. Allocated memory was 308.3 MB in the beginning and 800.6 MB in the end (delta: 492.3 MB). Free memory was 263.8 MB in the beginning and 484.8 MB in the end (delta: -221.0 MB). Peak memory consumption was 271.3 MB. Max. memory is 3.6 GB. [2018-06-25 09:16:43,607 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:16:43,607 INFO ]: ChcToBoogie took 68.29 ms. Allocated memory is still 308.3 MB. Free memory was 263.8 MB in the beginning and 260.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:16:43,608 INFO ]: Boogie Preprocessor took 43.29 ms. Allocated memory is still 308.3 MB. Free memory was 260.8 MB in the beginning and 259.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 09:16:43,608 INFO ]: RCFGBuilder took 405.46 ms. Allocated memory is still 308.3 MB. Free memory was 259.8 MB in the beginning and 247.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:16:43,608 INFO ]: TraceAbstraction took 59842.12 ms. Allocated memory was 308.3 MB in the beginning and 800.6 MB in the end (delta: 492.3 MB). Free memory was 247.8 MB in the beginning and 484.8 MB in the end (delta: -237.0 MB). Peak memory consumption was 255.3 MB. Max. memory is 3.6 GB. [2018-06-25 09:16:43,611 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 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.29 ms. Allocated memory is still 308.3 MB. Free memory was 263.8 MB in the beginning and 260.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.29 ms. Allocated memory is still 308.3 MB. Free memory was 260.8 MB in the beginning and 259.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 405.46 ms. Allocated memory is still 308.3 MB. Free memory was 259.8 MB in the beginning and 247.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59842.12 ms. Allocated memory was 308.3 MB in the beginning and 800.6 MB in the end (delta: 492.3 MB). Free memory was 247.8 MB in the beginning and 484.8 MB in the end (delta: -237.0 MB). Peak memory consumption was 255.3 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 (1047states) and interpolant automaton (currently 6 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. TIMEOUT Result, 59.7s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 49.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1646 SDtfs, 2931 SDslu, 12668 SDs, 0 SdLazy, 50481 SolverSat, 6318 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1627 GetRequests, 611 SyntacticMatches, 1 SemanticMatches, 1014 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42153 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1047occurred in iteration=18, 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: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 3336 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1177 NumberOfCodeBlocks, 1177 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1143 ConstructedInterpolants, 0 QuantifiedInterpolants, 119423 SizeOfPredicates, 170 NumberOfNonLiveVariables, 2497 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 34 InterpolantComputations, 6 PerfectInterpolantSequences, 1162/1454 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/021-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-16-43-620.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/021-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-16-43-620.csv Completed graceful shutdown