java -Xss1g -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/HOLA/12.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:56:53,101 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:56:53,103 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:56:53,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:56:53,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:56:53,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:56:53,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:56:53,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:56:53,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:56:53,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:56:53,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:56:53,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:56:53,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:56:53,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:56:53,128 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:56:53,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:56:53,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:56:53,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:56:53,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:56:53,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:56:53,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:56:53,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:56:53,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:56:53,155 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:56:53,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:56:53,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:56:53,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:56:53,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:56:53,159 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:56:53,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:56:53,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:56:53,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:56:53,161 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:56:53,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:56:53,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:56:53,168 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:56:53,188 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:56:53,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:56:53,188 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:56:53,189 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:56:53,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:56:53,190 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:56:53,191 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:56:53,191 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:56:53,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:56:53,191 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:56:53,191 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:56:53,191 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:56:53,192 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:56:53,192 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:56:53,192 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:56:53,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:56:53,192 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:56:53,196 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:56:53,197 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:56:53,240 INFO ]: Repository-Root is: /tmp [2018-06-22 00:56:53,255 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:56:53,262 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:56:53,264 INFO ]: Initializing SmtParser... [2018-06-22 00:56:53,264 INFO ]: SmtParser initialized [2018-06-22 00:56:53,265 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/12.c.smt2 [2018-06-22 00:56:53,266 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-22 00:56:53,350 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/12.c.smt2 unknown [2018-06-22 00:56:54,079 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/12.c.smt2 [2018-06-22 00:56:54,083 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:56:54,096 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:56:54,097 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:56:54,097 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:56:54,097 INFO ]: ChcToBoogie initialized [2018-06-22 00:56:54,100 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:56:54" (1/1) ... [2018-06-22 00:56:54,186 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:54 Unit [2018-06-22 00:56:54,186 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:56:54,187 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:56:54,187 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:56:54,187 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:56:54,207 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:54" (1/1) ... [2018-06-22 00:56:54,207 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:54" (1/1) ... [2018-06-22 00:56:54,234 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:54" (1/1) ... [2018-06-22 00:56:54,235 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:54" (1/1) ... [2018-06-22 00:56:54,259 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:54" (1/1) ... [2018-06-22 00:56:54,263 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:54" (1/1) ... [2018-06-22 00:56:54,266 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:54" (1/1) ... [2018-06-22 00:56:54,275 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:56:54,276 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:56:54,276 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:56:54,276 INFO ]: RCFGBuilder initialized [2018-06-22 00:56:54,277 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:54" (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-22 00:56:54,289 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:56:54,289 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:56:54,289 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:56:54,289 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:56:54,289 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:56:54,289 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-22 00:56:55,572 INFO ]: Using library mode [2018-06-22 00:56:55,573 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:56:55 BoogieIcfgContainer [2018-06-22 00:56:55,573 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:56:55,575 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:56:55,575 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:56:55,581 INFO ]: TraceAbstraction initialized [2018-06-22 00:56:55,581 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:56:54" (1/3) ... [2018-06-22 00:56:55,582 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ac5d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:56:55, skipping insertion in model container [2018-06-22 00:56:55,582 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:54" (2/3) ... [2018-06-22 00:56:55,582 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ac5d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:56:55, skipping insertion in model container [2018-06-22 00:56:55,583 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:56:55" (3/3) ... [2018-06-22 00:56:55,584 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:56:55,593 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:56:55,602 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:56:55,661 INFO ]: Using default assertion order modulation [2018-06-22 00:56:55,662 INFO ]: Interprodecural is true [2018-06-22 00:56:55,662 INFO ]: Hoare is false [2018-06-22 00:56:55,662 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:56:55,662 INFO ]: Backedges is TWOTRACK [2018-06-22 00:56:55,662 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:56:55,662 INFO ]: Difference is false [2018-06-22 00:56:55,662 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:56:55,662 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:56:55,684 INFO ]: Start isEmpty. Operand 53 states. [2018-06-22 00:56:55,701 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 00:56:55,701 INFO ]: Found error trace [2018-06-22 00:56:55,702 INFO ]: trace histogram [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, 1, 1, 1, 1] [2018-06-22 00:56:55,703 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:55,709 INFO ]: Analyzing trace with hash -2075014428, now seen corresponding path program 1 times [2018-06-22 00:56:55,711 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:55,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:55,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:55,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:55,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:55,903 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:56,588 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:56,597 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:56,597 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:56:56,599 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:56:56,616 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:56:56,616 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:56:56,619 INFO ]: Start difference. First operand 53 states. Second operand 11 states. [2018-06-22 00:56:57,417 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-22 00:56:57,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:57,688 INFO ]: Finished difference Result 66 states and 76 transitions. [2018-06-22 00:56:57,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 00:56:57,689 INFO ]: Start accepts. Automaton has 11 states. Word has length 30 [2018-06-22 00:56:57,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:57,701 INFO ]: With dead ends: 66 [2018-06-22 00:56:57,701 INFO ]: Without dead ends: 63 [2018-06-22 00:56:57,703 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-06-22 00:56:57,716 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 00:56:57,735 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-06-22 00:56:57,736 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 00:56:57,738 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-06-22 00:56:57,739 INFO ]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 30 [2018-06-22 00:56:57,739 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:57,739 INFO ]: Abstraction has 53 states and 62 transitions. [2018-06-22 00:56:57,739 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:56:57,739 INFO ]: Start isEmpty. Operand 53 states and 62 transitions. [2018-06-22 00:56:57,740 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 00:56:57,740 INFO ]: Found error trace [2018-06-22 00:56:57,740 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:57,740 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:57,741 INFO ]: Analyzing trace with hash 1176012014, now seen corresponding path program 1 times [2018-06-22 00:56:57,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:57,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:57,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:57,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:57,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:57,787 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:58,592 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:58,593 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:56:58,593 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-22 00:56:58,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:58,803 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:58,819 INFO ]: Computing forward predicates... [2018-06-22 00:56:59,381 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:59,414 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:56:59,414 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-06-22 00:56:59,414 INFO ]: Interpolant automaton has 30 states [2018-06-22 00:56:59,415 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 00:56:59,415 INFO ]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-06-22 00:56:59,415 INFO ]: Start difference. First operand 53 states and 62 transitions. Second operand 30 states. [2018-06-22 00:57:00,649 WARN ]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-22 00:57:02,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:02,006 INFO ]: Finished difference Result 186 states and 218 transitions. [2018-06-22 00:57:02,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 00:57:02,006 INFO ]: Start accepts. Automaton has 30 states. Word has length 38 [2018-06-22 00:57:02,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:02,011 INFO ]: With dead ends: 186 [2018-06-22 00:57:02,011 INFO ]: Without dead ends: 180 [2018-06-22 00:57:02,017 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1502, Invalid=4660, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 00:57:02,017 INFO ]: Start minimizeSevpa. Operand 180 states. [2018-06-22 00:57:02,027 INFO ]: Finished minimizeSevpa. Reduced states from 180 to 69. [2018-06-22 00:57:02,027 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 00:57:02,029 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-06-22 00:57:02,029 INFO ]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 38 [2018-06-22 00:57:02,029 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:02,029 INFO ]: Abstraction has 69 states and 80 transitions. [2018-06-22 00:57:02,030 INFO ]: Interpolant automaton has 30 states. [2018-06-22 00:57:02,030 INFO ]: Start isEmpty. Operand 69 states and 80 transitions. [2018-06-22 00:57:02,031 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 00:57:02,031 INFO ]: Found error trace [2018-06-22 00:57:02,031 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:02,031 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:02,031 INFO ]: Analyzing trace with hash -1411937740, now seen corresponding path program 1 times [2018-06-22 00:57:02,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:02,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:02,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:02,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:02,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:02,061 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:02,421 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:02,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:02,421 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-22 00:57:02,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:02,625 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:02,634 INFO ]: Computing forward predicates... [2018-06-22 00:57:02,938 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:02,969 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:02,969 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-06-22 00:57:02,969 INFO ]: Interpolant automaton has 30 states [2018-06-22 00:57:02,970 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 00:57:02,970 INFO ]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-06-22 00:57:02,970 INFO ]: Start difference. First operand 69 states and 80 transitions. Second operand 30 states. [2018-06-22 00:57:03,460 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-06-22 00:57:05,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:05,257 INFO ]: Finished difference Result 362 states and 428 transitions. [2018-06-22 00:57:05,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-06-22 00:57:05,257 INFO ]: Start accepts. Automaton has 30 states. Word has length 38 [2018-06-22 00:57:05,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:05,265 INFO ]: With dead ends: 362 [2018-06-22 00:57:05,265 INFO ]: Without dead ends: 356 [2018-06-22 00:57:05,267 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2032, Invalid=6340, Unknown=0, NotChecked=0, Total=8372 [2018-06-22 00:57:05,268 INFO ]: Start minimizeSevpa. Operand 356 states. [2018-06-22 00:57:05,281 INFO ]: Finished minimizeSevpa. Reduced states from 356 to 79. [2018-06-22 00:57:05,281 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 00:57:05,282 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2018-06-22 00:57:05,282 INFO ]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 38 [2018-06-22 00:57:05,282 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:05,282 INFO ]: Abstraction has 79 states and 93 transitions. [2018-06-22 00:57:05,282 INFO ]: Interpolant automaton has 30 states. [2018-06-22 00:57:05,282 INFO ]: Start isEmpty. Operand 79 states and 93 transitions. [2018-06-22 00:57:05,283 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 00:57:05,283 INFO ]: Found error trace [2018-06-22 00:57:05,284 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:05,284 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:05,284 INFO ]: Analyzing trace with hash 1817204, now seen corresponding path program 1 times [2018-06-22 00:57:05,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:05,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:05,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:05,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:05,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:05,306 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:05,486 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:05,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:05,486 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-22 00:57:05,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:05,648 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:05,657 INFO ]: Computing forward predicates... [2018-06-22 00:57:05,894 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:05,913 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:05,913 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-06-22 00:57:05,914 INFO ]: Interpolant automaton has 30 states [2018-06-22 00:57:05,914 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 00:57:05,914 INFO ]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-06-22 00:57:05,914 INFO ]: Start difference. First operand 79 states and 93 transitions. Second operand 30 states. [2018-06-22 00:57:07,730 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 00:57:08,213 WARN ]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 00:57:08,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:08,465 INFO ]: Finished difference Result 365 states and 433 transitions. [2018-06-22 00:57:08,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-06-22 00:57:08,465 INFO ]: Start accepts. Automaton has 30 states. Word has length 38 [2018-06-22 00:57:08,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:08,469 INFO ]: With dead ends: 365 [2018-06-22 00:57:08,469 INFO ]: Without dead ends: 359 [2018-06-22 00:57:08,472 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2365 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2032, Invalid=6340, Unknown=0, NotChecked=0, Total=8372 [2018-06-22 00:57:08,473 INFO ]: Start minimizeSevpa. Operand 359 states. [2018-06-22 00:57:08,486 INFO ]: Finished minimizeSevpa. Reduced states from 359 to 88. [2018-06-22 00:57:08,486 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 00:57:08,488 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2018-06-22 00:57:08,488 INFO ]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 38 [2018-06-22 00:57:08,488 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:08,488 INFO ]: Abstraction has 88 states and 104 transitions. [2018-06-22 00:57:08,488 INFO ]: Interpolant automaton has 30 states. [2018-06-22 00:57:08,488 INFO ]: Start isEmpty. Operand 88 states and 104 transitions. [2018-06-22 00:57:08,489 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 00:57:08,489 INFO ]: Found error trace [2018-06-22 00:57:08,489 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:08,489 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:08,489 INFO ]: Analyzing trace with hash -890201538, now seen corresponding path program 1 times [2018-06-22 00:57:08,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:08,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:08,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:08,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:08,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:08,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:08,881 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:08,881 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:08,881 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:08,881 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:08,882 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:08,882 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:08,882 INFO ]: Start difference. First operand 88 states and 104 transitions. Second operand 10 states. [2018-06-22 00:57:09,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:09,230 INFO ]: Finished difference Result 221 states and 262 transitions. [2018-06-22 00:57:09,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 00:57:09,230 INFO ]: Start accepts. Automaton has 10 states. Word has length 46 [2018-06-22 00:57:09,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:09,231 INFO ]: With dead ends: 221 [2018-06-22 00:57:09,231 INFO ]: Without dead ends: 220 [2018-06-22 00:57:09,231 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-06-22 00:57:09,232 INFO ]: Start minimizeSevpa. Operand 220 states. [2018-06-22 00:57:09,239 INFO ]: Finished minimizeSevpa. Reduced states from 220 to 101. [2018-06-22 00:57:09,239 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 00:57:09,242 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2018-06-22 00:57:09,242 INFO ]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 46 [2018-06-22 00:57:09,243 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:09,243 INFO ]: Abstraction has 101 states and 120 transitions. [2018-06-22 00:57:09,243 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:09,243 INFO ]: Start isEmpty. Operand 101 states and 120 transitions. [2018-06-22 00:57:09,244 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 00:57:09,244 INFO ]: Found error trace [2018-06-22 00:57:09,244 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:09,244 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:09,244 INFO ]: Analyzing trace with hash 523553406, now seen corresponding path program 1 times [2018-06-22 00:57:09,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:09,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:09,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:09,245 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:09,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:09,274 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:09,767 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:09,768 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:09,768 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:09,768 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:09,768 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:09,768 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:09,768 INFO ]: Start difference. First operand 101 states and 120 transitions. Second operand 10 states. [2018-06-22 00:57:09,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:09,946 INFO ]: Finished difference Result 139 states and 163 transitions. [2018-06-22 00:57:09,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 00:57:09,946 INFO ]: Start accepts. Automaton has 10 states. Word has length 46 [2018-06-22 00:57:09,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:09,947 INFO ]: With dead ends: 139 [2018-06-22 00:57:09,947 INFO ]: Without dead ends: 137 [2018-06-22 00:57:09,947 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-22 00:57:09,947 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-22 00:57:09,954 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 100. [2018-06-22 00:57:09,954 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 00:57:09,955 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2018-06-22 00:57:09,955 INFO ]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 46 [2018-06-22 00:57:09,955 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:09,955 INFO ]: Abstraction has 100 states and 116 transitions. [2018-06-22 00:57:09,955 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:09,955 INFO ]: Start isEmpty. Operand 100 states and 116 transitions. [2018-06-22 00:57:09,957 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 00:57:09,957 INFO ]: Found error trace [2018-06-22 00:57:09,957 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:09,957 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:09,957 INFO ]: Analyzing trace with hash 2094134334, now seen corresponding path program 2 times [2018-06-22 00:57:09,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:09,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:09,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:09,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:09,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:09,997 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:10,160 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:10,160 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:10,161 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:10,161 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:10,161 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:10,161 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:10,161 INFO ]: Start difference. First operand 100 states and 116 transitions. Second operand 10 states. [2018-06-22 00:57:10,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:10,266 INFO ]: Finished difference Result 132 states and 153 transitions. [2018-06-22 00:57:10,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 00:57:10,267 INFO ]: Start accepts. Automaton has 10 states. Word has length 46 [2018-06-22 00:57:10,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:10,268 INFO ]: With dead ends: 132 [2018-06-22 00:57:10,268 INFO ]: Without dead ends: 130 [2018-06-22 00:57:10,268 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-22 00:57:10,268 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-22 00:57:10,273 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 100. [2018-06-22 00:57:10,273 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 00:57:10,274 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2018-06-22 00:57:10,274 INFO ]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 46 [2018-06-22 00:57:10,274 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:10,274 INFO ]: Abstraction has 100 states and 112 transitions. [2018-06-22 00:57:10,274 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:10,274 INFO ]: Start isEmpty. Operand 100 states and 112 transitions. [2018-06-22 00:57:10,277 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 00:57:10,277 INFO ]: Found error trace [2018-06-22 00:57:10,277 INFO ]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:10,277 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:10,278 INFO ]: Analyzing trace with hash 919939524, now seen corresponding path program 1 times [2018-06-22 00:57:10,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:10,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:10,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:10,278 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:57:10,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:10,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:10,399 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:10,399 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:10,399 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:10,399 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:10,399 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:10,399 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:10,400 INFO ]: Start difference. First operand 100 states and 112 transitions. Second operand 10 states. [2018-06-22 00:57:10,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:10,504 INFO ]: Finished difference Result 181 states and 207 transitions. [2018-06-22 00:57:10,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 00:57:10,505 INFO ]: Start accepts. Automaton has 10 states. Word has length 46 [2018-06-22 00:57:10,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:10,506 INFO ]: With dead ends: 181 [2018-06-22 00:57:10,506 INFO ]: Without dead ends: 180 [2018-06-22 00:57:10,506 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-22 00:57:10,507 INFO ]: Start minimizeSevpa. Operand 180 states. [2018-06-22 00:57:10,511 INFO ]: Finished minimizeSevpa. Reduced states from 180 to 113. [2018-06-22 00:57:10,511 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-22 00:57:10,512 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-06-22 00:57:10,512 INFO ]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 46 [2018-06-22 00:57:10,513 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:10,513 INFO ]: Abstraction has 113 states and 125 transitions. [2018-06-22 00:57:10,513 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:10,513 INFO ]: Start isEmpty. Operand 113 states and 125 transitions. [2018-06-22 00:57:10,514 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 00:57:10,514 INFO ]: Found error trace [2018-06-22 00:57:10,514 INFO ]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:10,514 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:10,514 INFO ]: Analyzing trace with hash -1732187708, now seen corresponding path program 2 times [2018-06-22 00:57:10,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:10,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:10,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:10,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:10,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:10,541 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:10,882 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:10,882 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:10,882 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:57:10,882 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:57:10,882 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:57:10,882 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:57:10,882 INFO ]: Start difference. First operand 113 states and 125 transitions. Second operand 10 states. [2018-06-22 00:57:10,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:10,997 INFO ]: Finished difference Result 144 states and 161 transitions. [2018-06-22 00:57:10,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 00:57:10,997 INFO ]: Start accepts. Automaton has 10 states. Word has length 46 [2018-06-22 00:57:10,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:10,998 INFO ]: With dead ends: 144 [2018-06-22 00:57:10,998 INFO ]: Without dead ends: 143 [2018-06-22 00:57:10,998 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-22 00:57:10,998 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-22 00:57:11,002 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 113. [2018-06-22 00:57:11,002 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-22 00:57:11,002 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2018-06-22 00:57:11,002 INFO ]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 46 [2018-06-22 00:57:11,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:11,003 INFO ]: Abstraction has 113 states and 123 transitions. [2018-06-22 00:57:11,003 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:57:11,003 INFO ]: Start isEmpty. Operand 113 states and 123 transitions. [2018-06-22 00:57:11,004 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-22 00:57:11,004 INFO ]: Found error trace [2018-06-22 00:57:11,004 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-06-22 00:57:11,004 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:11,004 INFO ]: Analyzing trace with hash 1827076866, now seen corresponding path program 2 times [2018-06-22 00:57:11,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:11,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:11,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:11,005 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:57:11,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:11,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:11,631 WARN ]: Spent 202.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 00:57:12,580 INFO ]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 00:57:12,580 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:12,580 INFO ]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-06-22 00:57:12,580 INFO ]: Interpolant automaton has 28 states [2018-06-22 00:57:12,580 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 00:57:12,580 INFO ]: CoverageRelationStatistics Valid=61, Invalid=695, Unknown=0, NotChecked=0, Total=756 [2018-06-22 00:57:12,580 INFO ]: Start difference. First operand 113 states and 123 transitions. Second operand 28 states. [2018-06-22 00:57:14,264 WARN ]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-06-22 00:57:14,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:14,276 INFO ]: Finished difference Result 145 states and 160 transitions. [2018-06-22 00:57:14,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 00:57:14,277 INFO ]: Start accepts. Automaton has 28 states. Word has length 54 [2018-06-22 00:57:14,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:14,278 INFO ]: With dead ends: 145 [2018-06-22 00:57:14,278 INFO ]: Without dead ends: 142 [2018-06-22 00:57:14,279 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=752, Invalid=2004, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 00:57:14,279 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-22 00:57:14,282 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 116. [2018-06-22 00:57:14,282 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 00:57:14,283 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-06-22 00:57:14,283 INFO ]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 54 [2018-06-22 00:57:14,284 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:14,284 INFO ]: Abstraction has 116 states and 126 transitions. [2018-06-22 00:57:14,284 INFO ]: Interpolant automaton has 28 states. [2018-06-22 00:57:14,284 INFO ]: Start isEmpty. Operand 116 states and 126 transitions. [2018-06-22 00:57:14,284 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-22 00:57:14,284 INFO ]: Found error trace [2018-06-22 00:57:14,284 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-06-22 00:57:14,285 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:14,285 INFO ]: Analyzing trace with hash 1372461268, now seen corresponding path program 2 times [2018-06-22 00:57:14,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:14,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:14,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:14,285 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:57:14,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:14,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:14,728 INFO ]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 00:57:14,728 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:14,728 INFO ]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-06-22 00:57:14,728 INFO ]: Interpolant automaton has 28 states [2018-06-22 00:57:14,728 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 00:57:14,728 INFO ]: CoverageRelationStatistics Valid=61, Invalid=695, Unknown=0, NotChecked=0, Total=756 [2018-06-22 00:57:14,728 INFO ]: Start difference. First operand 116 states and 126 transitions. Second operand 28 states. [2018-06-22 00:57:16,682 WARN ]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-06-22 00:57:16,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:16,909 INFO ]: Finished difference Result 148 states and 163 transitions. [2018-06-22 00:57:16,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 00:57:16,910 INFO ]: Start accepts. Automaton has 28 states. Word has length 54 [2018-06-22 00:57:16,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:16,911 INFO ]: With dead ends: 148 [2018-06-22 00:57:16,911 INFO ]: Without dead ends: 145 [2018-06-22 00:57:16,912 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=813, Invalid=2157, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 00:57:16,912 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-22 00:57:16,918 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 116. [2018-06-22 00:57:16,918 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 00:57:16,919 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-06-22 00:57:16,919 INFO ]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 54 [2018-06-22 00:57:16,919 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:16,919 INFO ]: Abstraction has 116 states and 126 transitions. [2018-06-22 00:57:16,919 INFO ]: Interpolant automaton has 28 states. [2018-06-22 00:57:16,919 INFO ]: Start isEmpty. Operand 116 states and 126 transitions. [2018-06-22 00:57:16,920 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-22 00:57:16,920 INFO ]: Found error trace [2018-06-22 00:57:16,920 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-06-22 00:57:16,920 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:16,920 INFO ]: Analyzing trace with hash -1398937196, now seen corresponding path program 2 times [2018-06-22 00:57:16,920 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:16,920 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:16,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:16,921 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:57:16,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:16,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:17,516 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 00:57:18,101 INFO ]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 00:57:18,101 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:18,101 INFO ]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-06-22 00:57:18,102 INFO ]: Interpolant automaton has 28 states [2018-06-22 00:57:18,102 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 00:57:18,102 INFO ]: CoverageRelationStatistics Valid=61, Invalid=695, Unknown=0, NotChecked=0, Total=756 [2018-06-22 00:57:18,102 INFO ]: Start difference. First operand 116 states and 126 transitions. Second operand 28 states. [2018-06-22 00:57:19,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:19,270 INFO ]: Finished difference Result 144 states and 158 transitions. [2018-06-22 00:57:19,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 00:57:19,272 INFO ]: Start accepts. Automaton has 28 states. Word has length 54 [2018-06-22 00:57:19,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:19,273 INFO ]: With dead ends: 144 [2018-06-22 00:57:19,273 INFO ]: Without dead ends: 141 [2018-06-22 00:57:19,274 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=813, Invalid=2157, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 00:57:19,274 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 00:57:19,278 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-06-22 00:57:19,278 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 00:57:19,278 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-06-22 00:57:19,278 INFO ]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 54 [2018-06-22 00:57:19,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:19,279 INFO ]: Abstraction has 112 states and 121 transitions. [2018-06-22 00:57:19,279 INFO ]: Interpolant automaton has 28 states. [2018-06-22 00:57:19,279 INFO ]: Start isEmpty. Operand 112 states and 121 transitions. [2018-06-22 00:57:19,279 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-22 00:57:19,279 INFO ]: Found error trace [2018-06-22 00:57:19,279 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-06-22 00:57:19,279 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:19,280 INFO ]: Analyzing trace with hash 1157919008, now seen corresponding path program 1 times [2018-06-22 00:57:19,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:19,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:19,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:19,281 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:57:19,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:19,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:20,184 INFO ]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:20,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:20,184 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-22 00:57:20,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:20,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:20,419 INFO ]: Computing forward predicates... [2018-06-22 00:57:21,808 INFO ]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:21,829 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 00:57:21,830 INFO ]: Number of different interpolants: perfect sequences [37] imperfect sequences [37] total 62 [2018-06-22 00:57:21,830 INFO ]: Interpolant automaton has 62 states [2018-06-22 00:57:21,831 INFO ]: Constructing interpolant automaton starting with 62 interpolants. [2018-06-22 00:57:21,832 INFO ]: CoverageRelationStatistics Valid=158, Invalid=3624, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 00:57:21,832 INFO ]: Start difference. First operand 112 states and 121 transitions. Second operand 62 states. [2018-06-22 00:57:23,711 WARN ]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-06-22 00:57:24,925 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-06-22 00:57:25,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:25,357 INFO ]: Finished difference Result 189 states and 210 transitions. [2018-06-22 00:57:25,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 00:57:25,357 INFO ]: Start accepts. Automaton has 62 states. Word has length 55 [2018-06-22 00:57:25,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:25,357 INFO ]: With dead ends: 189 [2018-06-22 00:57:25,357 INFO ]: Without dead ends: 186 [2018-06-22 00:57:25,359 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1993, Invalid=7709, Unknown=0, NotChecked=0, Total=9702 [2018-06-22 00:57:25,359 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-22 00:57:25,362 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 126. [2018-06-22 00:57:25,362 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-22 00:57:25,363 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2018-06-22 00:57:25,363 INFO ]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 55 [2018-06-22 00:57:25,363 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:25,363 INFO ]: Abstraction has 126 states and 137 transitions. [2018-06-22 00:57:25,363 INFO ]: Interpolant automaton has 62 states. [2018-06-22 00:57:25,363 INFO ]: Start isEmpty. Operand 126 states and 137 transitions. [2018-06-22 00:57:25,364 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-22 00:57:25,364 INFO ]: Found error trace [2018-06-22 00:57:25,364 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-06-22 00:57:25,364 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:25,364 INFO ]: Analyzing trace with hash 1870393696, now seen corresponding path program 1 times [2018-06-22 00:57:25,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:25,364 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:25,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:25,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:25,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:25,397 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:26,218 INFO ]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:26,218 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:26,218 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-22 00:57:26,223 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:26,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:26,423 INFO ]: Computing forward predicates... [2018-06-22 00:57:27,645 INFO ]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:27,668 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 00:57:27,668 INFO ]: Number of different interpolants: perfect sequences [37] imperfect sequences [37] total 62 [2018-06-22 00:57:27,668 INFO ]: Interpolant automaton has 62 states [2018-06-22 00:57:27,668 INFO ]: Constructing interpolant automaton starting with 62 interpolants. [2018-06-22 00:57:27,669 INFO ]: CoverageRelationStatistics Valid=158, Invalid=3624, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 00:57:27,669 INFO ]: Start difference. First operand 126 states and 137 transitions. Second operand 62 states. [2018-06-22 00:57:31,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:31,031 INFO ]: Finished difference Result 193 states and 215 transitions. [2018-06-22 00:57:31,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 00:57:31,031 INFO ]: Start accepts. Automaton has 62 states. Word has length 55 [2018-06-22 00:57:31,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:31,032 INFO ]: With dead ends: 193 [2018-06-22 00:57:31,032 INFO ]: Without dead ends: 190 [2018-06-22 00:57:31,034 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1993, Invalid=7709, Unknown=0, NotChecked=0, Total=9702 [2018-06-22 00:57:31,034 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-22 00:57:31,038 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 127. [2018-06-22 00:57:31,038 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-22 00:57:31,039 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2018-06-22 00:57:31,039 INFO ]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 55 [2018-06-22 00:57:31,039 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:31,039 INFO ]: Abstraction has 127 states and 138 transitions. [2018-06-22 00:57:31,039 INFO ]: Interpolant automaton has 62 states. [2018-06-22 00:57:31,039 INFO ]: Start isEmpty. Operand 127 states and 138 transitions. [2018-06-22 00:57:31,040 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-22 00:57:31,040 INFO ]: Found error trace [2018-06-22 00:57:31,040 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-06-22 00:57:31,040 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:31,040 INFO ]: Analyzing trace with hash -50262642, now seen corresponding path program 1 times [2018-06-22 00:57:31,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:31,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:31,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:31,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:31,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:31,072 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:31,730 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:31,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:31,730 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-22 00:57:31,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:31,949 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:31,957 INFO ]: Computing forward predicates... [2018-06-22 00:57:32,166 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:32,200 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:32,220 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 46 [2018-06-22 00:57:32,392 INFO ]: Interpolant automaton has 46 states [2018-06-22 00:57:32,392 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 00:57:32,393 INFO ]: CoverageRelationStatistics Valid=148, Invalid=1922, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 00:57:32,393 INFO ]: Start difference. First operand 127 states and 138 transitions. Second operand 46 states. [2018-06-22 00:57:34,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:34,284 INFO ]: Finished difference Result 156 states and 167 transitions. [2018-06-22 00:57:34,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 00:57:34,284 INFO ]: Start accepts. Automaton has 46 states. Word has length 55 [2018-06-22 00:57:34,284 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:34,285 INFO ]: With dead ends: 156 [2018-06-22 00:57:34,285 INFO ]: Without dead ends: 150 [2018-06-22 00:57:34,286 INFO ]: 0 DeclaredPredicates, 142 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2156, Invalid=7546, Unknown=0, NotChecked=0, Total=9702 [2018-06-22 00:57:34,286 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 00:57:34,292 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 143. [2018-06-22 00:57:34,293 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-22 00:57:34,293 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-06-22 00:57:34,293 INFO ]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 55 [2018-06-22 00:57:34,294 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:34,294 INFO ]: Abstraction has 143 states and 154 transitions. [2018-06-22 00:57:34,294 INFO ]: Interpolant automaton has 46 states. [2018-06-22 00:57:34,294 INFO ]: Start isEmpty. Operand 143 states and 154 transitions. [2018-06-22 00:57:34,294 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-22 00:57:34,294 INFO ]: Found error trace [2018-06-22 00:57:34,294 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-06-22 00:57:34,294 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:34,294 INFO ]: Analyzing trace with hash -64269106, now seen corresponding path program 1 times [2018-06-22 00:57:34,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:34,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:34,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:34,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:34,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:34,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:34,851 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:34,851 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:34,851 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-22 00:57:34,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:35,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:35,062 INFO ]: Computing forward predicates... [2018-06-22 00:57:35,276 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:35,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:35,297 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 46 [2018-06-22 00:57:35,297 INFO ]: Interpolant automaton has 46 states [2018-06-22 00:57:35,297 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 00:57:35,297 INFO ]: CoverageRelationStatistics Valid=148, Invalid=1922, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 00:57:35,298 INFO ]: Start difference. First operand 143 states and 154 transitions. Second operand 46 states. [2018-06-22 00:57:37,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:37,333 INFO ]: Finished difference Result 172 states and 183 transitions. [2018-06-22 00:57:37,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 00:57:37,346 INFO ]: Start accepts. Automaton has 46 states. Word has length 55 [2018-06-22 00:57:37,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:37,347 INFO ]: With dead ends: 172 [2018-06-22 00:57:37,347 INFO ]: Without dead ends: 166 [2018-06-22 00:57:37,348 INFO ]: 0 DeclaredPredicates, 142 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2156, Invalid=7546, Unknown=0, NotChecked=0, Total=9702 [2018-06-22 00:57:37,348 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 00:57:37,352 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 159. [2018-06-22 00:57:37,352 INFO ]: Start removeUnreachable. Operand 159 states. [2018-06-22 00:57:37,353 INFO ]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2018-06-22 00:57:37,353 INFO ]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 55 [2018-06-22 00:57:37,353 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:37,353 INFO ]: Abstraction has 159 states and 170 transitions. [2018-06-22 00:57:37,353 INFO ]: Interpolant automaton has 46 states. [2018-06-22 00:57:37,354 INFO ]: Start isEmpty. Operand 159 states and 170 transitions. [2018-06-22 00:57:37,355 INFO ]: Finished isEmpty. Found accepting run of length 64 [2018-06-22 00:57:37,355 INFO ]: Found error trace [2018-06-22 00:57:37,355 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:37,355 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:37,355 INFO ]: Analyzing trace with hash 1850014736, now seen corresponding path program 1 times [2018-06-22 00:57:37,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:37,355 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:37,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:37,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:37,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:37,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:37,644 INFO ]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 00:57:37,644 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:37,644 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:57:37,644 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:57:37,644 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:57:37,644 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:57:37,645 INFO ]: Start difference. First operand 159 states and 170 transitions. Second operand 12 states. [2018-06-22 00:57:37,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:37,800 INFO ]: Finished difference Result 180 states and 194 transitions. [2018-06-22 00:57:37,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:57:37,801 INFO ]: Start accepts. Automaton has 12 states. Word has length 63 [2018-06-22 00:57:37,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:37,801 INFO ]: With dead ends: 180 [2018-06-22 00:57:37,801 INFO ]: Without dead ends: 179 [2018-06-22 00:57:37,802 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2018-06-22 00:57:37,802 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-22 00:57:37,807 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 163. [2018-06-22 00:57:37,807 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-22 00:57:37,808 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 174 transitions. [2018-06-22 00:57:37,808 INFO ]: Start accepts. Automaton has 163 states and 174 transitions. Word has length 63 [2018-06-22 00:57:37,808 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:37,808 INFO ]: Abstraction has 163 states and 174 transitions. [2018-06-22 00:57:37,808 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:57:37,808 INFO ]: Start isEmpty. Operand 163 states and 174 transitions. [2018-06-22 00:57:37,809 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-22 00:57:37,809 INFO ]: Found error trace [2018-06-22 00:57:37,809 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:37,809 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:37,809 INFO ]: Analyzing trace with hash 314763567, now seen corresponding path program 1 times [2018-06-22 00:57:37,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:37,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:37,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:37,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:37,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:37,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:37,999 INFO ]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 00:57:37,999 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:37,999 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:57:37,999 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:57:37,999 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:57:37,999 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:57:38,000 INFO ]: Start difference. First operand 163 states and 174 transitions. Second operand 11 states. [2018-06-22 00:57:38,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:38,314 INFO ]: Finished difference Result 247 states and 273 transitions. [2018-06-22 00:57:38,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 00:57:38,315 INFO ]: Start accepts. Automaton has 11 states. Word has length 64 [2018-06-22 00:57:38,315 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:38,316 INFO ]: With dead ends: 247 [2018-06-22 00:57:38,316 INFO ]: Without dead ends: 246 [2018-06-22 00:57:38,316 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2018-06-22 00:57:38,316 INFO ]: Start minimizeSevpa. Operand 246 states. [2018-06-22 00:57:38,321 INFO ]: Finished minimizeSevpa. Reduced states from 246 to 167. [2018-06-22 00:57:38,321 INFO ]: Start removeUnreachable. Operand 167 states. [2018-06-22 00:57:38,322 INFO ]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2018-06-22 00:57:38,322 INFO ]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 64 [2018-06-22 00:57:38,322 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:38,322 INFO ]: Abstraction has 167 states and 179 transitions. [2018-06-22 00:57:38,322 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:57:38,322 INFO ]: Start isEmpty. Operand 167 states and 179 transitions. [2018-06-22 00:57:38,323 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-22 00:57:38,323 INFO ]: Found error trace [2018-06-22 00:57:38,323 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:38,323 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:38,323 INFO ]: Analyzing trace with hash -13877009, now seen corresponding path program 1 times [2018-06-22 00:57:38,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:38,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:38,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:38,324 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:38,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:38,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:39,006 INFO ]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 00:57:39,006 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:39,006 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:57:39,006 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:57:39,006 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:57:39,006 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:57:39,006 INFO ]: Start difference. First operand 167 states and 179 transitions. Second operand 11 states. [2018-06-22 00:57:39,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:39,166 INFO ]: Finished difference Result 197 states and 212 transitions. [2018-06-22 00:57:39,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:57:39,166 INFO ]: Start accepts. Automaton has 11 states. Word has length 64 [2018-06-22 00:57:39,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:39,167 INFO ]: With dead ends: 197 [2018-06-22 00:57:39,167 INFO ]: Without dead ends: 193 [2018-06-22 00:57:39,167 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:57:39,167 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-22 00:57:39,170 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 164. [2018-06-22 00:57:39,170 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 00:57:39,171 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-06-22 00:57:39,171 INFO ]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 64 [2018-06-22 00:57:39,172 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:39,172 INFO ]: Abstraction has 164 states and 175 transitions. [2018-06-22 00:57:39,172 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:57:39,172 INFO ]: Start isEmpty. Operand 164 states and 175 transitions. [2018-06-22 00:57:39,172 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-22 00:57:39,172 INFO ]: Found error trace [2018-06-22 00:57:39,172 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:39,172 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:39,173 INFO ]: Analyzing trace with hash -1986168465, now seen corresponding path program 1 times [2018-06-22 00:57:39,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:39,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:39,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,174 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:39,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:39,401 INFO ]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 00:57:39,401 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:39,401 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 00:57:39,401 INFO ]: Interpolant automaton has 13 states [2018-06-22 00:57:39,401 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 00:57:39,401 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:57:39,401 INFO ]: Start difference. First operand 164 states and 175 transitions. Second operand 13 states. [2018-06-22 00:57:39,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:39,586 INFO ]: Finished difference Result 190 states and 201 transitions. [2018-06-22 00:57:39,586 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 00:57:39,586 INFO ]: Start accepts. Automaton has 13 states. Word has length 64 [2018-06-22 00:57:39,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:39,586 INFO ]: With dead ends: 190 [2018-06-22 00:57:39,586 INFO ]: Without dead ends: 178 [2018-06-22 00:57:39,587 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 00:57:39,587 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-22 00:57:39,591 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 172. [2018-06-22 00:57:39,591 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-22 00:57:39,592 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 182 transitions. [2018-06-22 00:57:39,592 INFO ]: Start accepts. Automaton has 172 states and 182 transitions. Word has length 64 [2018-06-22 00:57:39,593 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:39,593 INFO ]: Abstraction has 172 states and 182 transitions. [2018-06-22 00:57:39,593 INFO ]: Interpolant automaton has 13 states. [2018-06-22 00:57:39,593 INFO ]: Start isEmpty. Operand 172 states and 182 transitions. [2018-06-22 00:57:39,593 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-22 00:57:39,593 INFO ]: Found error trace [2018-06-22 00:57:39,593 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:39,593 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:39,593 INFO ]: Analyzing trace with hash -900817, now seen corresponding path program 1 times [2018-06-22 00:57:39,594 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:39,594 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:39,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:39,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:39,751 INFO ]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 00:57:39,751 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:39,751 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:57:39,752 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:57:39,752 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:57:39,752 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:57:39,752 INFO ]: Start difference. First operand 172 states and 182 transitions. Second operand 11 states. [2018-06-22 00:57:39,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:39,937 INFO ]: Finished difference Result 232 states and 252 transitions. [2018-06-22 00:57:39,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 00:57:39,938 INFO ]: Start accepts. Automaton has 11 states. Word has length 64 [2018-06-22 00:57:39,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:39,938 INFO ]: With dead ends: 232 [2018-06-22 00:57:39,938 INFO ]: Without dead ends: 231 [2018-06-22 00:57:39,939 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-06-22 00:57:39,939 INFO ]: Start minimizeSevpa. Operand 231 states. [2018-06-22 00:57:39,943 INFO ]: Finished minimizeSevpa. Reduced states from 231 to 175. [2018-06-22 00:57:39,943 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-22 00:57:39,944 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 185 transitions. [2018-06-22 00:57:39,944 INFO ]: Start accepts. Automaton has 175 states and 185 transitions. Word has length 64 [2018-06-22 00:57:39,944 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:39,944 INFO ]: Abstraction has 175 states and 185 transitions. [2018-06-22 00:57:39,944 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:57:39,944 INFO ]: Start isEmpty. Operand 175 states and 185 transitions. [2018-06-22 00:57:39,945 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-22 00:57:39,945 INFO ]: Found error trace [2018-06-22 00:57:39,945 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:39,945 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:39,945 INFO ]: Analyzing trace with hash -329541393, now seen corresponding path program 1 times [2018-06-22 00:57:39,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:39,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:39,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:39,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,980 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:40,226 INFO ]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 00:57:40,226 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:40,226 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:57:40,226 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:57:40,226 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:57:40,226 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:57:40,227 INFO ]: Start difference. First operand 175 states and 185 transitions. Second operand 11 states. [2018-06-22 00:57:40,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:40,318 INFO ]: Finished difference Result 164 states and 169 transitions. [2018-06-22 00:57:40,320 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:57:40,320 INFO ]: Start accepts. Automaton has 11 states. Word has length 64 [2018-06-22 00:57:40,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:40,321 INFO ]: With dead ends: 164 [2018-06-22 00:57:40,321 INFO ]: Without dead ends: 121 [2018-06-22 00:57:40,321 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:57:40,321 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 00:57:40,323 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 112. [2018-06-22 00:57:40,323 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 00:57:40,324 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-06-22 00:57:40,324 INFO ]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 64 [2018-06-22 00:57:40,324 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:40,324 INFO ]: Abstraction has 112 states and 115 transitions. [2018-06-22 00:57:40,324 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:57:40,324 INFO ]: Start isEmpty. Operand 112 states and 115 transitions. [2018-06-22 00:57:40,324 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-22 00:57:40,324 INFO ]: Found error trace [2018-06-22 00:57:40,325 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2018-06-22 00:57:40,325 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:40,325 INFO ]: Analyzing trace with hash 140874478, now seen corresponding path program 2 times [2018-06-22 00:57:40,325 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:40,325 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:40,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:40,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:40,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:40,357 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:41,637 INFO ]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 00:57:41,637 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:41,637 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-22 00:57:41,644 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 00:57:41,898 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 00:57:41,898 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:41,911 INFO ]: Computing forward predicates... [2018-06-22 00:57:43,064 INFO ]: Checked inductivity of 90 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 00:57:43,085 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:43,085 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 39] total 80 [2018-06-22 00:57:43,085 INFO ]: Interpolant automaton has 80 states [2018-06-22 00:57:43,086 INFO ]: Constructing interpolant automaton starting with 80 interpolants. [2018-06-22 00:57:43,086 INFO ]: CoverageRelationStatistics Valid=222, Invalid=6098, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 00:57:43,086 INFO ]: Start difference. First operand 112 states and 115 transitions. Second operand 80 states. [2018-06-22 00:57:46,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:46,671 INFO ]: Finished difference Result 145 states and 148 transitions. [2018-06-22 00:57:46,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 00:57:46,671 INFO ]: Start accepts. Automaton has 80 states. Word has length 71 [2018-06-22 00:57:46,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:46,672 INFO ]: With dead ends: 145 [2018-06-22 00:57:46,672 INFO ]: Without dead ends: 132 [2018-06-22 00:57:46,673 INFO ]: 0 DeclaredPredicates, 181 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2642 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2162, Invalid=13588, Unknown=0, NotChecked=0, Total=15750 [2018-06-22 00:57:46,673 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-22 00:57:46,675 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 116. [2018-06-22 00:57:46,675 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 00:57:46,676 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-06-22 00:57:46,676 INFO ]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 71 [2018-06-22 00:57:46,676 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:46,676 INFO ]: Abstraction has 116 states and 119 transitions. [2018-06-22 00:57:46,676 INFO ]: Interpolant automaton has 80 states. [2018-06-22 00:57:46,676 INFO ]: Start isEmpty. Operand 116 states and 119 transitions. [2018-06-22 00:57:46,677 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-22 00:57:46,677 INFO ]: Found error trace [2018-06-22 00:57:46,677 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2018-06-22 00:57:46,677 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:46,677 INFO ]: Analyzing trace with hash 853349166, now seen corresponding path program 1 times [2018-06-22 00:57:46,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:46,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:46,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:46,678 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:57:46,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:46,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:48,354 INFO ]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 00:57:48,355 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:48,355 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-22 00:57:48,380 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:48,630 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:48,642 INFO ]: Computing forward predicates... [2018-06-22 00:57:49,782 INFO ]: Checked inductivity of 90 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 00:57:49,803 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:49,803 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 39] total 80 [2018-06-22 00:57:49,804 INFO ]: Interpolant automaton has 80 states [2018-06-22 00:57:49,804 INFO ]: Constructing interpolant automaton starting with 80 interpolants. [2018-06-22 00:57:49,804 INFO ]: CoverageRelationStatistics Valid=222, Invalid=6098, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 00:57:49,804 INFO ]: Start difference. First operand 116 states and 119 transitions. Second operand 80 states. Received shutdown request... [2018-06-22 00:57:51,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 00:57:51,730 WARN ]: Verification canceled [2018-06-22 00:57:51,733 WARN ]: Timeout [2018-06-22 00:57:51,733 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:57:51 BoogieIcfgContainer [2018-06-22 00:57:51,733 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:57:51,734 INFO ]: Toolchain (without parser) took 57649.94 ms. Allocated memory was 308.3 MB in the beginning and 1.2 GB in the end (delta: 855.1 MB). Free memory was 215.0 MB in the beginning and 262.2 MB in the end (delta: -47.2 MB). Peak memory consumption was 807.9 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:51,734 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:57:51,734 INFO ]: ChcToBoogie took 89.45 ms. Allocated memory is still 308.3 MB. Free memory was 215.0 MB in the beginning and 211.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:51,735 INFO ]: Boogie Preprocessor took 88.46 ms. Allocated memory is still 308.3 MB. Free memory was 211.0 MB in the beginning and 209.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:51,735 INFO ]: RCFGBuilder took 1297.13 ms. Allocated memory was 308.3 MB in the beginning and 330.8 MB in the end (delta: 22.5 MB). Free memory was 209.0 MB in the beginning and 231.8 MB in the end (delta: -22.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:51,735 INFO ]: TraceAbstraction took 56158.24 ms. Allocated memory was 330.8 MB in the beginning and 1.2 GB in the end (delta: 832.6 MB). Free memory was 230.3 MB in the beginning and 262.2 MB in the end (delta: -32.0 MB). Peak memory consumption was 800.6 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:51,737 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 89.45 ms. Allocated memory is still 308.3 MB. Free memory was 215.0 MB in the beginning and 211.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 88.46 ms. Allocated memory is still 308.3 MB. Free memory was 211.0 MB in the beginning and 209.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1297.13 ms. Allocated memory was 308.3 MB in the beginning and 330.8 MB in the end (delta: 22.5 MB). Free memory was 209.0 MB in the beginning and 231.8 MB in the end (delta: -22.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56158.24 ms. Allocated memory was 330.8 MB in the beginning and 1.2 GB in the end (delta: 832.6 MB). Free memory was 230.3 MB in the beginning and 262.2 MB in the end (delta: -32.0 MB). Peak memory consumption was 800.6 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 (116states) and interpolant automaton (currently 34 states, 80 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 111 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. TIMEOUT Result, 56.0s OverallTime, 24 OverallIterations, 6 TraceHistogramMax, 31.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1596 SDtfs, 14285 SDslu, 23174 SDs, 0 SdLazy, 10573 SolverSat, 2084 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1714 GetRequests, 438 SyntacticMatches, 2 SemanticMatches, 1273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18121 ImplicationChecksByTransitivity, 41.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 1384 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 1757 NumberOfCodeBlocks, 1757 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1724 ConstructedInterpolants, 52 QuantifiedInterpolants, 281327 SizeOfPredicates, 428 NumberOfNonLiveVariables, 17794 ConjunctsInSsa, 452 ConjunctsInUnsatCore, 33 InterpolantComputations, 17 PerfectInterpolantSequences, 582/958 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/12.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-57-51-746.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/12.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-57-51-746.csv Completed graceful shutdown