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/llreve/break_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:09:31,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:09:31,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:09:31,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:09:31,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:09:31,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:09:31,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:09:31,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:09:31,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:09:31,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:09:31,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:09:31,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:09:31,077 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:09:31,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:09:31,079 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:09:31,080 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:09:31,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:09:31,092 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:09:31,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:09:31,098 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:09:31,099 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:09:31,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:09:31,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:09:31,104 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:09:31,105 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:09:31,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:09:31,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:09:31,109 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:09:31,110 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:09:31,110 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:09:31,116 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:09:31,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:09:31,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:09:31,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:09:31,118 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:09:31,120 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:09:31,143 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:09:31,144 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:09:31,144 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:09:31,145 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:09:31,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:09:31,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:09:31,146 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:09:31,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:09:31,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:09:31,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:09:31,147 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:09:31,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:09:31,147 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:09:31,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:09:31,148 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:09:31,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:09:31,149 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:09:31,150 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:09:31,150 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:09:31,204 INFO ]: Repository-Root is: /tmp [2018-06-22 01:09:31,222 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:09:31,228 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:09:31,230 INFO ]: Initializing SmtParser... [2018-06-22 01:09:31,230 INFO ]: SmtParser initialized [2018-06-22 01:09:31,231 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 [2018-06-22 01:09:31,232 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 01:09:31,334 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 unknown [2018-06-22 01:09:31,510 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 [2018-06-22 01:09:31,516 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:09:31,522 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:09:31,522 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:09:31,523 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:09:31,523 INFO ]: ChcToBoogie initialized [2018-06-22 01:09:31,526 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:09:31" (1/1) ... [2018-06-22 01:09:31,576 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:31 Unit [2018-06-22 01:09:31,576 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:09:31,577 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:09:31,577 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:09:31,577 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:09:31,600 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:31" (1/1) ... [2018-06-22 01:09:31,600 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:31" (1/1) ... [2018-06-22 01:09:31,607 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:31" (1/1) ... [2018-06-22 01:09:31,607 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:31" (1/1) ... [2018-06-22 01:09:31,610 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:31" (1/1) ... [2018-06-22 01:09:31,612 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:31" (1/1) ... [2018-06-22 01:09:31,613 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:31" (1/1) ... [2018-06-22 01:09:31,615 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:09:31,616 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:09:31,616 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:09:31,616 INFO ]: RCFGBuilder initialized [2018-06-22 01:09:31,617 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:31" (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 01:09:31,634 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:09:31,634 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:09:31,634 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:09:31,634 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:09:31,634 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:09:31,634 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 01:09:31,951 INFO ]: Using library mode [2018-06-22 01:09:31,952 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:09:31 BoogieIcfgContainer [2018-06-22 01:09:31,952 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:09:31,953 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:09:31,953 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:09:31,956 INFO ]: TraceAbstraction initialized [2018-06-22 01:09:31,957 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:09:31" (1/3) ... [2018-06-22 01:09:31,958 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cd2068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:09:31, skipping insertion in model container [2018-06-22 01:09:31,958 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:31" (2/3) ... [2018-06-22 01:09:31,958 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cd2068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:09:31, skipping insertion in model container [2018-06-22 01:09:31,958 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:09:31" (3/3) ... [2018-06-22 01:09:31,960 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:09:31,979 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:09:32,001 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:09:32,071 INFO ]: Using default assertion order modulation [2018-06-22 01:09:32,071 INFO ]: Interprodecural is true [2018-06-22 01:09:32,071 INFO ]: Hoare is false [2018-06-22 01:09:32,071 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:09:32,072 INFO ]: Backedges is TWOTRACK [2018-06-22 01:09:32,072 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:09:32,072 INFO ]: Difference is false [2018-06-22 01:09:32,072 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:09:32,072 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:09:32,096 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:09:32,117 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:09:32,117 INFO ]: Found error trace [2018-06-22 01:09:32,117 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:32,118 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:32,129 INFO ]: Analyzing trace with hash -916453782, now seen corresponding path program 1 times [2018-06-22 01:09:32,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:32,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:32,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:32,168 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:32,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:32,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:32,281 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:32,282 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:09:32,283 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:09:32,284 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:09:32,294 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:09:32,295 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:09:32,297 INFO ]: Start difference. First operand 12 states. Second operand 3 states. [2018-06-22 01:09:32,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:32,348 INFO ]: Finished difference Result 11 states and 14 transitions. [2018-06-22 01:09:32,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:09:32,350 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:09:32,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:32,357 INFO ]: With dead ends: 11 [2018-06-22 01:09:32,357 INFO ]: Without dead ends: 11 [2018-06-22 01:09:32,359 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:09:32,379 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:09:32,404 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:09:32,405 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:09:32,406 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-06-22 01:09:32,407 INFO ]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 9 [2018-06-22 01:09:32,407 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:32,407 INFO ]: Abstraction has 11 states and 14 transitions. [2018-06-22 01:09:32,407 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:09:32,407 INFO ]: Start isEmpty. Operand 11 states and 14 transitions. [2018-06-22 01:09:32,407 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:09:32,407 INFO ]: Found error trace [2018-06-22 01:09:32,407 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:32,407 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:32,408 INFO ]: Analyzing trace with hash -921994908, now seen corresponding path program 1 times [2018-06-22 01:09:32,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:32,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:32,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:32,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:32,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:32,415 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:32,469 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:32,469 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:09:32,469 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:09:32,471 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:09:32,471 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:09:32,471 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:09:32,471 INFO ]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2018-06-22 01:09:32,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:32,598 INFO ]: Finished difference Result 14 states and 19 transitions. [2018-06-22 01:09:32,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:09:32,599 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:09:32,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:32,599 INFO ]: With dead ends: 14 [2018-06-22 01:09:32,599 INFO ]: Without dead ends: 12 [2018-06-22 01:09:32,600 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:32,600 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:09:32,602 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:09:32,602 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:09:32,603 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-06-22 01:09:32,603 INFO ]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 9 [2018-06-22 01:09:32,603 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:32,603 INFO ]: Abstraction has 12 states and 15 transitions. [2018-06-22 01:09:32,603 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:09:32,603 INFO ]: Start isEmpty. Operand 12 states and 15 transitions. [2018-06-22 01:09:32,604 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:09:32,604 INFO ]: Found error trace [2018-06-22 01:09:32,604 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:32,604 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:32,604 INFO ]: Analyzing trace with hash -864736606, now seen corresponding path program 1 times [2018-06-22 01:09:32,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:32,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:32,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:32,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:32,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:32,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:32,679 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:32,680 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:09:32,680 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:09:32,680 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:09:32,680 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:09:32,680 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:09:32,680 INFO ]: Start difference. First operand 12 states and 15 transitions. Second operand 4 states. [2018-06-22 01:09:32,780 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:32,780 INFO ]: Finished difference Result 17 states and 22 transitions. [2018-06-22 01:09:32,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:09:32,782 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:09:32,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:32,785 INFO ]: With dead ends: 17 [2018-06-22 01:09:32,785 INFO ]: Without dead ends: 17 [2018-06-22 01:09:32,785 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:32,785 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:09:32,790 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-22 01:09:32,790 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:09:32,790 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-22 01:09:32,790 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 9 [2018-06-22 01:09:32,791 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:32,792 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-22 01:09:32,792 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:09:32,792 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-22 01:09:32,792 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:09:32,792 INFO ]: Found error trace [2018-06-22 01:09:32,792 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:32,792 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:32,792 INFO ]: Analyzing trace with hash 1588115330, now seen corresponding path program 1 times [2018-06-22 01:09:32,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:32,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:32,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:32,793 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:32,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:32,804 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:32,865 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:32,865 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:32,865 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) [2018-06-22 01:09:32,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:32,921 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:32,930 INFO ]: Computing forward predicates... [2018-06-22 01:09:32,964 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:33,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:33,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:09:33,002 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:09:33,002 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:09:33,002 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:33,002 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 5 states. [2018-06-22 01:09:33,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:33,277 INFO ]: Finished difference Result 16 states and 22 transitions. [2018-06-22 01:09:33,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:09:33,279 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:09:33,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:33,280 INFO ]: With dead ends: 16 [2018-06-22 01:09:33,280 INFO ]: Without dead ends: 14 [2018-06-22 01:09:33,280 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:09:33,280 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:09:33,284 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:09:33,284 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:09:33,284 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-22 01:09:33,284 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 10 [2018-06-22 01:09:33,285 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:33,285 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-22 01:09:33,285 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:09:33,285 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-22 01:09:33,285 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:09:33,285 INFO ]: Found error trace [2018-06-22 01:09:33,285 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:33,285 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:33,285 INFO ]: Analyzing trace with hash -864427571, now seen corresponding path program 1 times [2018-06-22 01:09:33,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:33,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:33,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:33,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:33,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:33,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:33,353 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:33,354 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:33,354 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 01:09:33,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:33,393 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:33,395 INFO ]: Computing forward predicates... [2018-06-22 01:09:33,509 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:33,544 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:33,545 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:09:33,545 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:09:33,545 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:09:33,545 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:33,545 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 5 states. [2018-06-22 01:09:33,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:33,624 INFO ]: Finished difference Result 16 states and 20 transitions. [2018-06-22 01:09:33,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:09:33,624 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:09:33,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:33,625 INFO ]: With dead ends: 16 [2018-06-22 01:09:33,625 INFO ]: Without dead ends: 16 [2018-06-22 01:09:33,625 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:33,625 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:09:33,629 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:09:33,629 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:09:33,630 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-22 01:09:33,630 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2018-06-22 01:09:33,630 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:33,630 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-22 01:09:33,630 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:09:33,630 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-22 01:09:33,631 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:09:33,631 INFO ]: Found error trace [2018-06-22 01:09:33,631 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:33,631 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:33,631 INFO ]: Analyzing trace with hash 2092121380, now seen corresponding path program 2 times [2018-06-22 01:09:33,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:33,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:33,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:33,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:33,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:33,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:33,730 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:33,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:33,730 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 01:09:33,738 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:33,785 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:33,785 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:33,787 INFO ]: Computing forward predicates... [2018-06-22 01:09:33,803 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:33,838 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:33,838 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:09:33,839 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:09:33,839 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:09:33,839 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:09:33,839 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 6 states. [2018-06-22 01:09:33,921 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:33,921 INFO ]: Finished difference Result 21 states and 27 transitions. [2018-06-22 01:09:33,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:09:33,922 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 01:09:33,922 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:33,922 INFO ]: With dead ends: 21 [2018-06-22 01:09:33,922 INFO ]: Without dead ends: 17 [2018-06-22 01:09:33,923 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:09:33,923 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:09:33,925 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:09:33,925 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:09:33,925 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-06-22 01:09:33,925 INFO ]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2018-06-22 01:09:33,925 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:33,925 INFO ]: Abstraction has 17 states and 21 transitions. [2018-06-22 01:09:33,925 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:09:33,925 INFO ]: Start isEmpty. Operand 17 states and 21 transitions. [2018-06-22 01:09:33,926 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:09:33,926 INFO ]: Found error trace [2018-06-22 01:09:33,926 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:33,926 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:33,926 INFO ]: Analyzing trace with hash 536439746, now seen corresponding path program 3 times [2018-06-22 01:09:33,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:33,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:33,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:33,929 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:33,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:33,943 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:34,031 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:34,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:34,031 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 01:09:34,045 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:34,064 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:09:34,064 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:34,065 INFO ]: Computing forward predicates... [2018-06-22 01:09:34,097 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:34,118 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:09:34,118 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-06-22 01:09:34,118 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:09:34,118 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:09:34,118 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:09:34,118 INFO ]: Start difference. First operand 17 states and 21 transitions. Second operand 9 states. [2018-06-22 01:09:34,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:34,721 INFO ]: Finished difference Result 31 states and 39 transitions. [2018-06-22 01:09:34,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:09:34,723 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 01:09:34,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:34,724 INFO ]: With dead ends: 31 [2018-06-22 01:09:34,724 INFO ]: Without dead ends: 26 [2018-06-22 01:09:34,724 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:09:34,724 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:09:34,726 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-06-22 01:09:34,726 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:09:34,727 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-22 01:09:34,727 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2018-06-22 01:09:34,727 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:34,727 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-22 01:09:34,727 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:09:34,727 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-22 01:09:34,728 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:09:34,728 INFO ]: Found error trace [2018-06-22 01:09:34,728 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:34,728 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:34,728 INFO ]: Analyzing trace with hash -1759694547, now seen corresponding path program 2 times [2018-06-22 01:09:34,728 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:34,728 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:34,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:34,729 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:34,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:34,741 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:34,785 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:34,785 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:34,785 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 01:09:34,793 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:34,810 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:34,811 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:34,812 INFO ]: Computing forward predicates... [2018-06-22 01:09:34,828 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:34,849 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:34,849 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 01:09:34,849 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:09:34,849 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:09:34,849 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:09:34,850 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 7 states. [2018-06-22 01:09:34,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:34,864 INFO ]: Finished difference Result 21 states and 25 transitions. [2018-06-22 01:09:34,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:09:34,865 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-22 01:09:34,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:34,865 INFO ]: With dead ends: 21 [2018-06-22 01:09:34,865 INFO ]: Without dead ends: 21 [2018-06-22 01:09:34,866 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:09:34,866 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:09:34,867 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-06-22 01:09:34,867 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:09:34,868 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-06-22 01:09:34,868 INFO ]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2018-06-22 01:09:34,868 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:34,868 INFO ]: Abstraction has 20 states and 24 transitions. [2018-06-22 01:09:34,868 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:09:34,868 INFO ]: Start isEmpty. Operand 20 states and 24 transitions. [2018-06-22 01:09:34,869 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:09:34,869 INFO ]: Found error trace [2018-06-22 01:09:34,869 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:34,869 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:34,869 INFO ]: Analyzing trace with hash -910839791, now seen corresponding path program 1 times [2018-06-22 01:09:34,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:34,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:34,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:34,870 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:34,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:34,890 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:35,226 INFO ]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:35,226 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:35,226 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 01:09:35,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:35,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:35,272 INFO ]: Computing forward predicates... [2018-06-22 01:09:35,459 INFO ]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:09:35,482 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:35,482 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 01:09:35,483 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:09:35,483 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:09:35,483 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:09:35,483 INFO ]: Start difference. First operand 20 states and 24 transitions. Second operand 12 states. [2018-06-22 01:09:36,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:36,049 INFO ]: Finished difference Result 48 states and 58 transitions. [2018-06-22 01:09:36,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:09:36,049 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-22 01:09:36,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:36,049 INFO ]: With dead ends: 48 [2018-06-22 01:09:36,049 INFO ]: Without dead ends: 41 [2018-06-22 01:09:36,050 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:09:36,050 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:09:36,053 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 21. [2018-06-22 01:09:36,053 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:09:36,053 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-06-22 01:09:36,053 INFO ]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-06-22 01:09:36,053 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:36,053 INFO ]: Abstraction has 21 states and 25 transitions. [2018-06-22 01:09:36,053 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:09:36,054 INFO ]: Start isEmpty. Operand 21 states and 25 transitions. [2018-06-22 01:09:36,054 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:09:36,054 INFO ]: Found error trace [2018-06-22 01:09:36,054 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:36,054 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:36,054 INFO ]: Analyzing trace with hash 1177168013, now seen corresponding path program 3 times [2018-06-22 01:09:36,054 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:36,054 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:36,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:36,055 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:36,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:36,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:36,113 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:36,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:36,114 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 01:09:36,120 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:36,136 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:09:36,136 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:36,137 INFO ]: Computing forward predicates... [2018-06-22 01:09:36,159 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:36,181 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:36,181 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 01:09:36,181 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:09:36,181 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:09:36,181 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:09:36,182 INFO ]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2018-06-22 01:09:36,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:36,208 INFO ]: Finished difference Result 25 states and 29 transitions. [2018-06-22 01:09:36,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:09:36,209 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-22 01:09:36,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:36,209 INFO ]: With dead ends: 25 [2018-06-22 01:09:36,209 INFO ]: Without dead ends: 25 [2018-06-22 01:09:36,209 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:09:36,210 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:09:36,211 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 01:09:36,211 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:09:36,212 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-06-22 01:09:36,212 INFO ]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2018-06-22 01:09:36,212 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:36,212 INFO ]: Abstraction has 23 states and 27 transitions. [2018-06-22 01:09:36,212 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:09:36,212 INFO ]: Start isEmpty. Operand 23 states and 27 transitions. [2018-06-22 01:09:36,212 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:09:36,212 INFO ]: Found error trace [2018-06-22 01:09:36,212 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:36,213 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:36,213 INFO ]: Analyzing trace with hash -1908496862, now seen corresponding path program 2 times [2018-06-22 01:09:36,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:36,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:36,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:36,213 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:36,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:36,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:36,319 INFO ]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:36,319 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:36,319 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 01:09:36,326 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:36,341 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:36,341 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:36,343 INFO ]: Computing forward predicates... [2018-06-22 01:09:36,518 INFO ]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:36,544 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:36,544 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 01:09:36,544 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:09:36,544 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:09:36,544 INFO ]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:09:36,544 INFO ]: Start difference. First operand 23 states and 27 transitions. Second operand 15 states. [2018-06-22 01:09:37,160 WARN ]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:09:37,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:37,818 INFO ]: Finished difference Result 70 states and 82 transitions. [2018-06-22 01:09:37,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:09:37,818 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-22 01:09:37,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:37,819 INFO ]: With dead ends: 70 [2018-06-22 01:09:37,819 INFO ]: Without dead ends: 60 [2018-06-22 01:09:37,819 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:09:37,820 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 01:09:37,824 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 24. [2018-06-22 01:09:37,825 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:09:37,825 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-06-22 01:09:37,825 INFO ]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2018-06-22 01:09:37,825 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:37,825 INFO ]: Abstraction has 24 states and 28 transitions. [2018-06-22 01:09:37,825 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:09:37,825 INFO ]: Start isEmpty. Operand 24 states and 28 transitions. [2018-06-22 01:09:37,826 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:09:37,826 INFO ]: Found error trace [2018-06-22 01:09:37,826 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:37,826 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:37,826 INFO ]: Analyzing trace with hash 1708574701, now seen corresponding path program 4 times [2018-06-22 01:09:37,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:37,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:37,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:37,829 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:37,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:37,842 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:37,936 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:37,936 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:37,936 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 01:09:37,944 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:09:37,972 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:09:37,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:37,974 INFO ]: Computing forward predicates... [2018-06-22 01:09:38,188 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:38,209 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:38,209 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:09:38,209 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:09:38,209 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:09:38,209 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:09:38,209 INFO ]: Start difference. First operand 24 states and 28 transitions. Second operand 11 states. [2018-06-22 01:09:38,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:38,239 INFO ]: Finished difference Result 29 states and 33 transitions. [2018-06-22 01:09:38,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:09:38,241 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-22 01:09:38,241 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:38,241 INFO ]: With dead ends: 29 [2018-06-22 01:09:38,241 INFO ]: Without dead ends: 29 [2018-06-22 01:09:38,242 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:09:38,242 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:09:38,243 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-06-22 01:09:38,244 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:09:38,244 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-06-22 01:09:38,244 INFO ]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2018-06-22 01:09:38,244 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:38,244 INFO ]: Abstraction has 26 states and 30 transitions. [2018-06-22 01:09:38,244 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:09:38,245 INFO ]: Start isEmpty. Operand 26 states and 30 transitions. [2018-06-22 01:09:38,249 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:09:38,249 INFO ]: Found error trace [2018-06-22 01:09:38,249 INFO ]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:38,249 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:38,249 INFO ]: Analyzing trace with hash -718863695, now seen corresponding path program 3 times [2018-06-22 01:09:38,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:38,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:38,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:38,250 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:38,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:38,261 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:38,415 INFO ]: Checked inductivity of 27 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:38,415 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:38,415 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:38,433 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:38,462 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:09:38,462 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:38,464 INFO ]: Computing forward predicates... [2018-06-22 01:09:38,569 INFO ]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:09:38,616 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:38,616 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 01:09:38,617 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:09:38,617 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:09:38,617 INFO ]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:09:38,617 INFO ]: Start difference. First operand 26 states and 30 transitions. Second operand 18 states. [2018-06-22 01:09:40,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:40,177 INFO ]: Finished difference Result 96 states and 110 transitions. [2018-06-22 01:09:40,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:09:40,178 INFO ]: Start accepts. Automaton has 18 states. Word has length 18 [2018-06-22 01:09:40,178 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:40,179 INFO ]: With dead ends: 96 [2018-06-22 01:09:40,179 INFO ]: Without dead ends: 83 [2018-06-22 01:09:40,180 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:09:40,180 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 01:09:40,183 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 27. [2018-06-22 01:09:40,184 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:09:40,184 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-06-22 01:09:40,184 INFO ]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2018-06-22 01:09:40,185 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:40,185 INFO ]: Abstraction has 27 states and 31 transitions. [2018-06-22 01:09:40,185 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:09:40,185 INFO ]: Start isEmpty. Operand 27 states and 31 transitions. [2018-06-22 01:09:40,185 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:09:40,185 INFO ]: Found error trace [2018-06-22 01:09:40,185 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:40,185 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:40,185 INFO ]: Analyzing trace with hash 1289293645, now seen corresponding path program 5 times [2018-06-22 01:09:40,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:40,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:40,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:40,188 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:40,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:40,197 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:40,301 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:40,301 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:40,301 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:40,309 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:09:40,328 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:09:40,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:40,330 INFO ]: Computing forward predicates... [2018-06-22 01:09:40,387 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:40,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:40,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 01:09:40,410 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:09:40,410 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:09:40,410 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:09:40,411 INFO ]: Start difference. First operand 27 states and 31 transitions. Second operand 13 states. [2018-06-22 01:09:40,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:40,428 INFO ]: Finished difference Result 33 states and 37 transitions. [2018-06-22 01:09:40,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:09:40,429 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-22 01:09:40,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:40,429 INFO ]: With dead ends: 33 [2018-06-22 01:09:40,429 INFO ]: Without dead ends: 33 [2018-06-22 01:09:40,430 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:09:40,430 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:09:40,432 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-22 01:09:40,432 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:09:40,432 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-06-22 01:09:40,432 INFO ]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2018-06-22 01:09:40,432 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:40,432 INFO ]: Abstraction has 29 states and 33 transitions. [2018-06-22 01:09:40,432 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:09:40,432 INFO ]: Start isEmpty. Operand 29 states and 33 transitions. [2018-06-22 01:09:40,433 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:09:40,433 INFO ]: Found error trace [2018-06-22 01:09:40,433 INFO ]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:40,433 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:40,433 INFO ]: Analyzing trace with hash -1690654590, now seen corresponding path program 4 times [2018-06-22 01:09:40,433 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:40,433 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:40,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:40,434 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:40,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:40,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:40,659 INFO ]: Checked inductivity of 38 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:40,660 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:40,660 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:40,666 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:09:40,682 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:09:40,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:40,684 INFO ]: Computing forward predicates... [2018-06-22 01:09:40,851 INFO ]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:09:40,882 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:40,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-22 01:09:40,882 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:09:40,882 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:09:40,883 INFO ]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:09:40,883 INFO ]: Start difference. First operand 29 states and 33 transitions. Second operand 21 states. [2018-06-22 01:09:41,233 WARN ]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 01:09:41,818 WARN ]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-22 01:09:43,484 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-06-22 01:09:43,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:43,623 INFO ]: Finished difference Result 126 states and 142 transitions. [2018-06-22 01:09:43,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:09:43,664 INFO ]: Start accepts. Automaton has 21 states. Word has length 20 [2018-06-22 01:09:43,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:43,665 INFO ]: With dead ends: 126 [2018-06-22 01:09:43,665 INFO ]: Without dead ends: 110 [2018-06-22 01:09:43,667 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=588, Invalid=2382, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:09:43,667 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 01:09:43,670 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 30. [2018-06-22 01:09:43,670 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:09:43,671 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-06-22 01:09:43,671 INFO ]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-06-22 01:09:43,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:43,671 INFO ]: Abstraction has 30 states and 34 transitions. [2018-06-22 01:09:43,671 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:09:43,671 INFO ]: Start isEmpty. Operand 30 states and 34 transitions. [2018-06-22 01:09:43,671 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:09:43,671 INFO ]: Found error trace [2018-06-22 01:09:43,671 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:43,672 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:43,672 INFO ]: Analyzing trace with hash 2087124653, now seen corresponding path program 6 times [2018-06-22 01:09:43,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:43,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:43,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:43,672 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:43,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:43,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:43,758 INFO ]: Checked inductivity of 66 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:09:43,758 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:43,758 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:43,764 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:09:43,784 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:09:43,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:43,787 INFO ]: Computing forward predicates... [2018-06-22 01:09:43,836 INFO ]: Checked inductivity of 66 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:09:43,857 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:43,857 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-22 01:09:43,857 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:09:43,857 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:09:43,857 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:09:43,858 INFO ]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2018-06-22 01:09:44,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:44,126 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-22 01:09:44,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:09:44,127 INFO ]: Start accepts. Automaton has 6 states. Word has length 20 [2018-06-22 01:09:44,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:44,127 INFO ]: With dead ends: 43 [2018-06-22 01:09:44,127 INFO ]: Without dead ends: 31 [2018-06-22 01:09:44,127 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 12 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:09:44,127 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:09:44,129 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 01:09:44,129 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:09:44,129 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-06-22 01:09:44,130 INFO ]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2018-06-22 01:09:44,130 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:44,130 INFO ]: Abstraction has 31 states and 35 transitions. [2018-06-22 01:09:44,130 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:09:44,130 INFO ]: Start isEmpty. Operand 31 states and 35 transitions. [2018-06-22 01:09:44,130 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:09:44,130 INFO ]: Found error trace [2018-06-22 01:09:44,130 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:44,130 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:44,130 INFO ]: Analyzing trace with hash 123234827, now seen corresponding path program 1 times [2018-06-22 01:09:44,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:44,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:44,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:44,134 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:44,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:44,149 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:44,400 INFO ]: Checked inductivity of 67 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:09:44,400 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:44,400 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:44,421 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:44,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:44,448 INFO ]: Computing forward predicates... [2018-06-22 01:09:45,032 INFO ]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:09:45,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:45,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15] total 18 [2018-06-22 01:09:45,052 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:09:45,053 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:09:45,053 INFO ]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:09:45,053 INFO ]: Start difference. First operand 31 states and 35 transitions. Second operand 18 states. [2018-06-22 01:09:45,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:45,351 INFO ]: Finished difference Result 44 states and 49 transitions. [2018-06-22 01:09:45,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:09:45,351 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-22 01:09:45,351 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:45,351 INFO ]: With dead ends: 44 [2018-06-22 01:09:45,351 INFO ]: Without dead ends: 32 [2018-06-22 01:09:45,352 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:09:45,352 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:09:45,353 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 01:09:45,353 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:09:45,354 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-06-22 01:09:45,354 INFO ]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 21 [2018-06-22 01:09:45,354 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:45,354 INFO ]: Abstraction has 32 states and 36 transitions. [2018-06-22 01:09:45,354 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:09:45,354 INFO ]: Start isEmpty. Operand 32 states and 36 transitions. [2018-06-22 01:09:45,354 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:09:45,354 INFO ]: Found error trace [2018-06-22 01:09:45,355 INFO ]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:45,355 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:45,355 INFO ]: Analyzing trace with hash -1926099631, now seen corresponding path program 5 times [2018-06-22 01:09:45,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:45,355 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:45,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:45,355 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:45,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:45,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:46,306 INFO ]: Checked inductivity of 51 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:09:46,306 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:46,306 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:46,312 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:09:46,336 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:09:46,336 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:46,338 INFO ]: Computing forward predicates... [2018-06-22 01:09:46,481 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:09:46,500 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:46,500 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2018-06-22 01:09:46,501 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:09:46,501 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:09:46,501 INFO ]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:09:46,501 INFO ]: Start difference. First operand 32 states and 36 transitions. Second operand 25 states. [2018-06-22 01:09:48,061 WARN ]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:09:48,107 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:48,107 INFO ]: Finished difference Result 71 states and 78 transitions. [2018-06-22 01:09:48,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:09:48,107 INFO ]: Start accepts. Automaton has 25 states. Word has length 22 [2018-06-22 01:09:48,107 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:48,107 INFO ]: With dead ends: 71 [2018-06-22 01:09:48,107 INFO ]: Without dead ends: 53 [2018-06-22 01:09:48,108 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=551, Invalid=2871, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:09:48,108 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:09:48,110 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 33. [2018-06-22 01:09:48,110 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:09:48,111 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-06-22 01:09:48,111 INFO ]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2018-06-22 01:09:48,111 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:48,111 INFO ]: Abstraction has 33 states and 37 transitions. [2018-06-22 01:09:48,111 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:09:48,111 INFO ]: Start isEmpty. Operand 33 states and 37 transitions. [2018-06-22 01:09:48,111 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:09:48,111 INFO ]: Found error trace [2018-06-22 01:09:48,112 INFO ]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:48,112 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:48,112 INFO ]: Analyzing trace with hash -627807635, now seen corresponding path program 2 times [2018-06-22 01:09:48,112 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:48,112 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:48,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:48,112 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:48,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:48,124 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:48,316 INFO ]: Checked inductivity of 69 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:09:48,316 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:48,316 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:48,323 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:48,354 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:48,354 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:48,358 INFO ]: Computing forward predicates... [2018-06-22 01:09:49,000 INFO ]: Checked inductivity of 69 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:49,034 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:49,034 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 19 [2018-06-22 01:09:49,035 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:09:49,035 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:09:49,035 INFO ]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:09:49,035 INFO ]: Start difference. First operand 33 states and 37 transitions. Second operand 19 states. [2018-06-22 01:09:49,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:49,500 INFO ]: Finished difference Result 46 states and 51 transitions. [2018-06-22 01:09:49,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:09:49,500 INFO ]: Start accepts. Automaton has 19 states. Word has length 22 [2018-06-22 01:09:49,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:49,500 INFO ]: With dead ends: 46 [2018-06-22 01:09:49,500 INFO ]: Without dead ends: 34 [2018-06-22 01:09:49,501 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:09:49,501 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:09:49,502 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 01:09:49,502 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:09:49,502 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-06-22 01:09:49,503 INFO ]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 22 [2018-06-22 01:09:49,503 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:49,503 INFO ]: Abstraction has 34 states and 38 transitions. [2018-06-22 01:09:49,503 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:09:49,503 INFO ]: Start isEmpty. Operand 34 states and 38 transitions. [2018-06-22 01:09:49,503 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:09:49,503 INFO ]: Found error trace [2018-06-22 01:09:49,503 INFO ]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:49,503 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:49,503 INFO ]: Analyzing trace with hash 1859679819, now seen corresponding path program 3 times [2018-06-22 01:09:49,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:49,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:49,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:49,504 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:49,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:49,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:49,708 INFO ]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:09:49,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:49,708 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:49,715 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:49,740 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:09:49,740 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:49,742 INFO ]: Computing forward predicates... [2018-06-22 01:09:49,826 INFO ]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:09:49,852 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:49,852 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-22 01:09:49,853 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:09:49,853 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:09:49,853 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:09:49,853 INFO ]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-06-22 01:09:49,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:49,999 INFO ]: Finished difference Result 47 states and 52 transitions. [2018-06-22 01:09:49,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:09:49,999 INFO ]: Start accepts. Automaton has 12 states. Word has length 23 [2018-06-22 01:09:49,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:50,000 INFO ]: With dead ends: 47 [2018-06-22 01:09:50,000 INFO ]: Without dead ends: 35 [2018-06-22 01:09:50,000 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 10 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:09:50,000 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:09:50,002 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 01:09:50,002 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:09:50,002 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-06-22 01:09:50,003 INFO ]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 23 [2018-06-22 01:09:50,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:50,003 INFO ]: Abstraction has 35 states and 39 transitions. [2018-06-22 01:09:50,003 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:09:50,003 INFO ]: Start isEmpty. Operand 35 states and 39 transitions. [2018-06-22 01:09:50,003 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:09:50,003 INFO ]: Found error trace [2018-06-22 01:09:50,003 INFO ]: trace histogram [9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:50,003 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:50,004 INFO ]: Analyzing trace with hash -1016368414, now seen corresponding path program 6 times [2018-06-22 01:09:50,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:50,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:50,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:50,004 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:50,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:50,017 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:50,210 INFO ]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:09:50,210 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:50,210 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:50,217 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:09:50,260 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:09:50,260 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:50,262 INFO ]: Computing forward predicates... [2018-06-22 01:09:50,412 INFO ]: Checked inductivity of 66 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:09:50,434 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:50,434 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2018-06-22 01:09:50,434 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:09:50,434 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:09:50,434 INFO ]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:09:50,434 INFO ]: Start difference. First operand 35 states and 39 transitions. Second operand 26 states. [2018-06-22 01:09:51,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:51,909 INFO ]: Finished difference Result 76 states and 83 transitions. [2018-06-22 01:09:51,909 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 01:09:51,909 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-22 01:09:51,909 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:51,910 INFO ]: With dead ends: 76 [2018-06-22 01:09:51,910 INFO ]: Without dead ends: 57 [2018-06-22 01:09:51,911 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=697, Invalid=3725, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 01:09:51,911 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 01:09:51,913 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 36. [2018-06-22 01:09:51,913 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:09:51,913 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-22 01:09:51,913 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-06-22 01:09:51,913 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:51,913 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-22 01:09:51,913 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:09:51,913 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-22 01:09:51,914 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:09:51,914 INFO ]: Found error trace [2018-06-22 01:09:51,914 INFO ]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:51,914 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:51,914 INFO ]: Analyzing trace with hash 1662379565, now seen corresponding path program 4 times [2018-06-22 01:09:51,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:51,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:51,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:51,915 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:51,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:51,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:52,234 INFO ]: Checked inductivity of 76 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:09:52,234 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:52,234 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:52,240 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:09:52,260 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:09:52,260 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:52,264 INFO ]: Computing forward predicates... [2018-06-22 01:09:52,431 INFO ]: Checked inductivity of 76 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:09:52,452 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:52,452 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 21 [2018-06-22 01:09:52,452 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:09:52,452 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:09:52,453 INFO ]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:09:52,453 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 21 states. [2018-06-22 01:09:53,039 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:53,039 INFO ]: Finished difference Result 49 states and 54 transitions. [2018-06-22 01:09:53,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:09:53,039 INFO ]: Start accepts. Automaton has 21 states. Word has length 24 [2018-06-22 01:09:53,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:53,040 INFO ]: With dead ends: 49 [2018-06-22 01:09:53,040 INFO ]: Without dead ends: 37 [2018-06-22 01:09:53,040 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:09:53,040 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:09:53,042 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-22 01:09:53,042 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:09:53,043 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-06-22 01:09:53,043 INFO ]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-06-22 01:09:53,043 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:53,043 INFO ]: Abstraction has 37 states and 41 transitions. [2018-06-22 01:09:53,043 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:09:53,043 INFO ]: Start isEmpty. Operand 37 states and 41 transitions. [2018-06-22 01:09:53,044 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:09:53,044 INFO ]: Found error trace [2018-06-22 01:09:53,044 INFO ]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:53,044 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:53,044 INFO ]: Analyzing trace with hash -158961013, now seen corresponding path program 5 times [2018-06-22 01:09:53,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:53,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:53,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:53,045 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:53,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:53,057 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:53,221 INFO ]: Checked inductivity of 81 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:09:53,221 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:53,221 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:53,228 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:09:53,297 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:09:53,297 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:53,301 INFO ]: Computing forward predicates... [2018-06-22 01:09:53,460 INFO ]: Checked inductivity of 81 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:09:53,490 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:53,490 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-22 01:09:53,491 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:09:53,491 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:09:53,491 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:09:53,491 INFO ]: Start difference. First operand 37 states and 41 transitions. Second operand 16 states. [2018-06-22 01:09:53,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:53,946 INFO ]: Finished difference Result 50 states and 55 transitions. [2018-06-22 01:09:53,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:09:53,946 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 01:09:53,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:53,946 INFO ]: With dead ends: 50 [2018-06-22 01:09:53,946 INFO ]: Without dead ends: 38 [2018-06-22 01:09:53,946 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:09:53,947 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:09:53,948 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 01:09:53,948 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:09:53,949 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-22 01:09:53,949 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2018-06-22 01:09:53,949 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:53,949 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-22 01:09:53,949 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:09:53,949 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-22 01:09:53,950 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:09:53,950 INFO ]: Found error trace [2018-06-22 01:09:53,950 INFO ]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:53,950 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:53,950 INFO ]: Analyzing trace with hash -44511247, now seen corresponding path program 7 times [2018-06-22 01:09:53,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:53,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:53,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:53,950 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:53,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:53,961 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:54,714 INFO ]: Checked inductivity of 83 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:09:54,715 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:54,715 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:54,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:54,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:54,762 INFO ]: Computing forward predicates... [2018-06-22 01:09:54,934 INFO ]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:09:54,955 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:54,955 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-06-22 01:09:54,955 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:09:54,956 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:09:54,956 INFO ]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:09:54,956 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 27 states. [2018-06-22 01:09:56,094 WARN ]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-06-22 01:09:57,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:57,655 INFO ]: Finished difference Result 81 states and 88 transitions. [2018-06-22 01:09:57,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 01:09:57,655 INFO ]: Start accepts. Automaton has 27 states. Word has length 26 [2018-06-22 01:09:57,655 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:57,655 INFO ]: With dead ends: 81 [2018-06-22 01:09:57,655 INFO ]: Without dead ends: 61 [2018-06-22 01:09:57,656 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=861, Invalid=4689, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 01:09:57,656 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 01:09:57,658 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 39. [2018-06-22 01:09:57,658 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:09:57,659 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-06-22 01:09:57,659 INFO ]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2018-06-22 01:09:57,659 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:57,659 INFO ]: Abstraction has 39 states and 43 transitions. [2018-06-22 01:09:57,659 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:09:57,659 INFO ]: Start isEmpty. Operand 39 states and 43 transitions. [2018-06-22 01:09:57,660 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:09:57,660 INFO ]: Found error trace [2018-06-22 01:09:57,660 INFO ]: trace histogram [11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:57,660 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:57,660 INFO ]: Analyzing trace with hash -785944083, now seen corresponding path program 6 times [2018-06-22 01:09:57,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:57,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:57,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:57,661 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:57,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:57,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:58,592 INFO ]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:58,592 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:58,592 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:58,598 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:09:58,628 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:09:58,628 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:58,631 INFO ]: Computing forward predicates... [2018-06-22 01:09:58,985 INFO ]: Checked inductivity of 87 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:09:59,005 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:59,017 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 29 [2018-06-22 01:09:59,018 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:09:59,018 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:09:59,018 INFO ]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:09:59,018 INFO ]: Start difference. First operand 39 states and 43 transitions. Second operand 29 states. [2018-06-22 01:09:59,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:59,579 INFO ]: Finished difference Result 60 states and 65 transitions. [2018-06-22 01:09:59,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:09:59,579 INFO ]: Start accepts. Automaton has 29 states. Word has length 26 [2018-06-22 01:09:59,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:59,579 INFO ]: With dead ends: 60 [2018-06-22 01:09:59,579 INFO ]: Without dead ends: 48 [2018-06-22 01:09:59,580 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=266, Invalid=1140, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:09:59,580 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:09:59,581 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-06-22 01:09:59,582 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:09:59,582 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-06-22 01:09:59,582 INFO ]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2018-06-22 01:09:59,582 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:59,582 INFO ]: Abstraction has 40 states and 44 transitions. [2018-06-22 01:09:59,582 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:09:59,582 INFO ]: Start isEmpty. Operand 40 states and 44 transitions. [2018-06-22 01:09:59,583 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:09:59,583 INFO ]: Found error trace [2018-06-22 01:09:59,583 INFO ]: trace histogram [11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:59,583 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:59,583 INFO ]: Analyzing trace with hash 1252417227, now seen corresponding path program 7 times [2018-06-22 01:09:59,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:59,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:59,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:59,584 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:59,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:59,595 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:00,134 INFO ]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:00,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:00,134 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:00,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:00,164 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:00,167 INFO ]: Computing forward predicates... [2018-06-22 01:10:00,251 INFO ]: Checked inductivity of 94 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:10:00,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:00,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 27 [2018-06-22 01:10:00,274 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:10:00,274 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:10:00,274 INFO ]: CoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:10:00,275 INFO ]: Start difference. First operand 40 states and 44 transitions. Second operand 27 states. [2018-06-22 01:10:00,634 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:00,634 INFO ]: Finished difference Result 61 states and 66 transitions. [2018-06-22 01:10:00,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:10:00,636 INFO ]: Start accepts. Automaton has 27 states. Word has length 27 [2018-06-22 01:10:00,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:00,637 INFO ]: With dead ends: 61 [2018-06-22 01:10:00,637 INFO ]: Without dead ends: 49 [2018-06-22 01:10:00,637 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=314, Invalid=1168, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:10:00,637 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 01:10:00,639 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-06-22 01:10:00,639 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:10:00,639 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-06-22 01:10:00,639 INFO ]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 27 [2018-06-22 01:10:00,640 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:00,640 INFO ]: Abstraction has 41 states and 45 transitions. [2018-06-22 01:10:00,640 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:10:00,640 INFO ]: Start isEmpty. Operand 41 states and 45 transitions. [2018-06-22 01:10:00,640 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:10:00,640 INFO ]: Found error trace [2018-06-22 01:10:00,640 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:00,640 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:00,640 INFO ]: Analyzing trace with hash 1406076226, now seen corresponding path program 8 times [2018-06-22 01:10:00,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:00,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:00,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:00,641 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:00,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:00,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:00,895 INFO ]: Checked inductivity of 102 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:10:00,896 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:00,896 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:00,901 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:10:00,934 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:10:00,934 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:00,936 INFO ]: Computing forward predicates... [2018-06-22 01:10:00,953 INFO ]: Checked inductivity of 102 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:10:00,992 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:00,992 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 16 [2018-06-22 01:10:00,992 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:10:00,992 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:10:00,992 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:10:00,992 INFO ]: Start difference. First operand 41 states and 45 transitions. Second operand 16 states. [2018-06-22 01:10:02,031 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 01:10:02,106 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:02,107 INFO ]: Finished difference Result 64 states and 69 transitions. [2018-06-22 01:10:02,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:10:02,107 INFO ]: Start accepts. Automaton has 16 states. Word has length 28 [2018-06-22 01:10:02,107 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:02,107 INFO ]: With dead ends: 64 [2018-06-22 01:10:02,107 INFO ]: Without dead ends: 64 [2018-06-22 01:10:02,108 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=411, Invalid=1481, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:10:02,108 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 01:10:02,114 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 41. [2018-06-22 01:10:02,114 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:10:02,114 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-06-22 01:10:02,115 INFO ]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2018-06-22 01:10:02,115 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:02,115 INFO ]: Abstraction has 41 states and 45 transitions. [2018-06-22 01:10:02,115 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:10:02,115 INFO ]: Start isEmpty. Operand 41 states and 45 transitions. [2018-06-22 01:10:02,115 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:10:02,115 INFO ]: Found error trace [2018-06-22 01:10:02,115 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:02,116 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:02,116 INFO ]: Analyzing trace with hash 17108397, now seen corresponding path program 8 times [2018-06-22 01:10:02,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:02,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:02,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:02,116 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:02,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:02,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:02,703 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:10:03,112 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:10:03,844 INFO ]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:03,844 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:03,844 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:03,856 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:10:03,881 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:10:03,881 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:03,884 INFO ]: Computing forward predicates... [2018-06-22 01:10:04,124 INFO ]: Checked inductivity of 102 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:10:04,149 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:04,159 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 27 [2018-06-22 01:10:04,160 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:10:04,160 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:10:04,160 INFO ]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:10:04,160 INFO ]: Start difference. First operand 41 states and 45 transitions. Second operand 27 states. [2018-06-22 01:10:04,574 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:04,574 INFO ]: Finished difference Result 63 states and 68 transitions. [2018-06-22 01:10:04,574 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:10:04,574 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-22 01:10:04,574 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:04,574 INFO ]: With dead ends: 63 [2018-06-22 01:10:04,574 INFO ]: Without dead ends: 51 [2018-06-22 01:10:04,575 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=313, Invalid=1169, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:10:04,575 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:10:04,576 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 42. [2018-06-22 01:10:04,576 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:10:04,576 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-06-22 01:10:04,576 INFO ]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 28 [2018-06-22 01:10:04,576 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:04,576 INFO ]: Abstraction has 42 states and 46 transitions. [2018-06-22 01:10:04,576 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:10:04,576 INFO ]: Start isEmpty. Operand 42 states and 46 transitions. [2018-06-22 01:10:04,577 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:10:04,577 INFO ]: Found error trace [2018-06-22 01:10:04,577 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:04,577 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:04,577 INFO ]: Analyzing trace with hash 639518579, now seen corresponding path program 9 times [2018-06-22 01:10:04,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:04,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:04,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:04,577 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:04,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:04,587 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:04,785 INFO ]: Checked inductivity of 111 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:10:04,785 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:04,785 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:04,792 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:10:04,835 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:10:04,835 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:04,837 INFO ]: Computing forward predicates... [2018-06-22 01:10:04,863 INFO ]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:10:04,886 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:04,886 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 16 [2018-06-22 01:10:04,886 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:10:04,887 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:10:04,887 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:10:04,887 INFO ]: Start difference. First operand 42 states and 46 transitions. Second operand 16 states. [2018-06-22 01:10:05,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:05,787 INFO ]: Finished difference Result 66 states and 71 transitions. [2018-06-22 01:10:05,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:10:05,787 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 01:10:05,787 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:05,788 INFO ]: With dead ends: 66 [2018-06-22 01:10:05,788 INFO ]: Without dead ends: 66 [2018-06-22 01:10:05,789 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=483, Invalid=1679, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:10:05,789 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 01:10:05,791 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 42. [2018-06-22 01:10:05,791 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:10:05,791 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-06-22 01:10:05,791 INFO ]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 29 [2018-06-22 01:10:05,791 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:05,791 INFO ]: Abstraction has 42 states and 46 transitions. [2018-06-22 01:10:05,791 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:10:05,791 INFO ]: Start isEmpty. Operand 42 states and 46 transitions. [2018-06-22 01:10:05,792 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:10:05,792 INFO ]: Found error trace [2018-06-22 01:10:05,792 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:05,792 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:05,792 INFO ]: Analyzing trace with hash 377240331, now seen corresponding path program 9 times [2018-06-22 01:10:05,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:05,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:05,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:05,793 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:05,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:05,803 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:06,635 INFO ]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:06,636 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:06,636 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:06,646 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:10:06,686 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:10:06,686 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:06,690 INFO ]: Computing forward predicates... [2018-06-22 01:10:07,541 INFO ]: Checked inductivity of 111 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:10:07,574 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:07,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 37 [2018-06-22 01:10:07,574 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:10:07,574 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:10:07,574 INFO ]: CoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:10:07,575 INFO ]: Start difference. First operand 42 states and 46 transitions. Second operand 37 states. [2018-06-22 01:10:08,172 WARN ]: Spent 139.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-06-22 01:10:09,235 WARN ]: Spent 189.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-22 01:10:10,054 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:10,054 INFO ]: Finished difference Result 77 states and 82 transitions. [2018-06-22 01:10:10,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 01:10:10,055 INFO ]: Start accepts. Automaton has 37 states. Word has length 29 [2018-06-22 01:10:10,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:10,055 INFO ]: With dead ends: 77 [2018-06-22 01:10:10,055 INFO ]: Without dead ends: 42 [2018-06-22 01:10:10,056 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=926, Invalid=4044, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 01:10:10,056 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:10:10,057 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-22 01:10:10,057 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:10:10,058 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-22 01:10:10,058 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-06-22 01:10:10,058 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:10,058 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-22 01:10:10,058 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:10:10,058 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-22 01:10:10,058 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:10:10,058 INFO ]: Found error trace [2018-06-22 01:10:10,058 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:10,058 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:10,058 INFO ]: Analyzing trace with hash -1648931998, now seen corresponding path program 10 times [2018-06-22 01:10:10,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:10,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:10,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:10,059 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:10,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:10,071 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:10,372 INFO ]: Checked inductivity of 121 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:10:10,372 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:10,372 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:10:10,382 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:10,409 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:10:10,409 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:10,412 INFO ]: Computing forward predicates... [2018-06-22 01:10:10,455 INFO ]: Checked inductivity of 121 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:10:10,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:10,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 16 [2018-06-22 01:10:10,491 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:10:10,492 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:10:10,492 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:10:10,492 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 16 states. [2018-06-22 01:10:11,307 WARN ]: Spent 757.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-06-22 01:10:11,801 WARN ]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 01:10:12,236 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-22 01:10:12,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:12,482 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-22 01:10:12,482 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:10:12,482 INFO ]: Start accepts. Automaton has 16 states. Word has length 30 [2018-06-22 01:10:12,482 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:12,482 INFO ]: With dead ends: 43 [2018-06-22 01:10:12,482 INFO ]: Without dead ends: 43 [2018-06-22 01:10:12,483 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:10:12,483 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:10:12,484 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-06-22 01:10:12,484 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:10:12,484 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-22 01:10:12,484 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-06-22 01:10:12,484 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:12,484 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-22 01:10:12,484 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:10:12,484 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-22 01:10:12,484 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:10:12,484 INFO ]: Found error trace [2018-06-22 01:10:12,484 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:12,484 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:12,484 INFO ]: Analyzing trace with hash 1655306381, now seen corresponding path program 1 times [2018-06-22 01:10:12,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:12,485 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:12,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:12,486 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:12,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:12,497 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:12,689 INFO ]: Checked inductivity of 132 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-22 01:10:12,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:12,689 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:12,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:12,722 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:12,724 INFO ]: Computing forward predicates... [2018-06-22 01:10:12,797 INFO ]: Checked inductivity of 132 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-22 01:10:12,817 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:12,817 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 01:10:12,817 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:10:12,817 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:10:12,817 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:10:12,817 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-06-22 01:10:12,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:12,878 INFO ]: Finished difference Result 33 states and 34 transitions. [2018-06-22 01:10:12,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:10:12,878 INFO ]: Start accepts. Automaton has 7 states. Word has length 31 [2018-06-22 01:10:12,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:12,878 INFO ]: With dead ends: 33 [2018-06-22 01:10:12,878 INFO ]: Without dead ends: 32 [2018-06-22 01:10:12,878 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:10:12,878 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:10:12,879 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 01:10:12,879 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:10:12,879 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-22 01:10:12,880 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 31 [2018-06-22 01:10:12,880 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:12,880 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-22 01:10:12,880 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:10:12,880 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-22 01:10:12,880 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:10:12,880 INFO ]: Found error trace [2018-06-22 01:10:12,880 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:12,880 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:12,880 INFO ]: Analyzing trace with hash 423544147, now seen corresponding path program 11 times [2018-06-22 01:10:12,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:12,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:12,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:12,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:12,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:12,890 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:13,427 INFO ]: Checked inductivity of 132 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:10:13,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:13,427 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:13,433 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:10:13,466 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:10:13,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:13,468 INFO ]: Computing forward predicates... [2018-06-22 01:10:13,482 INFO ]: Checked inductivity of 132 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:10:13,503 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:10:13,503 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 15 [2018-06-22 01:10:13,503 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:10:13,503 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:10:13,503 INFO ]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:10:13,503 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 15 states. [2018-06-22 01:10:13,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:13,523 INFO ]: Finished difference Result 28 states and 29 transitions. [2018-06-22 01:10:13,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:10:13,524 INFO ]: Start accepts. Automaton has 15 states. Word has length 31 [2018-06-22 01:10:13,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:13,524 INFO ]: With dead ends: 28 [2018-06-22 01:10:13,524 INFO ]: Without dead ends: 0 [2018-06-22 01:10:13,524 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:10:13,524 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:10:13,524 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:10:13,524 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:10:13,524 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:10:13,524 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-06-22 01:10:13,524 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:13,524 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:10:13,524 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:10:13,524 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:10:13,524 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:10:13,533 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:10:13 BoogieIcfgContainer [2018-06-22 01:10:13,533 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:10:13,534 INFO ]: Toolchain (without parser) took 42017.25 ms. Allocated memory was 307.8 MB in the beginning and 539.5 MB in the end (delta: 231.7 MB). Free memory was 264.1 MB in the beginning and 323.6 MB in the end (delta: -59.5 MB). Peak memory consumption was 172.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:10:13,535 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:10:13,535 INFO ]: ChcToBoogie took 54.31 ms. Allocated memory is still 307.8 MB. Free memory was 264.1 MB in the beginning and 262.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:10:13,535 INFO ]: Boogie Preprocessor took 37.99 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 261.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:10:13,536 INFO ]: RCFGBuilder took 336.50 ms. Allocated memory is still 307.8 MB. Free memory was 261.1 MB in the beginning and 253.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:10:13,537 INFO ]: TraceAbstraction took 41579.60 ms. Allocated memory was 307.8 MB in the beginning and 539.5 MB in the end (delta: 231.7 MB). Free memory was 253.1 MB in the beginning and 323.6 MB in the end (delta: -70.5 MB). Peak memory consumption was 161.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:10:13,539 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 54.31 ms. Allocated memory is still 307.8 MB. Free memory was 264.1 MB in the beginning and 262.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.99 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 261.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 336.50 ms. Allocated memory is still 307.8 MB. Free memory was 261.1 MB in the beginning and 253.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 41579.60 ms. Allocated memory was 307.8 MB in the beginning and 539.5 MB in the end (delta: 231.7 MB). Free memory was 253.1 MB in the beginning and 323.6 MB in the end (delta: -70.5 MB). Peak memory consumption was 161.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. SAFE Result, 41.4s OverallTime, 33 OverallIterations, 11 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 388 SDtfs, 427 SDslu, 2830 SDs, 0 SdLazy, 4390 SolverSat, 845 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1516 GetRequests, 609 SyntacticMatches, 42 SemanticMatches, 865 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6189 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 370 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 1301 NumberOfCodeBlocks, 1300 NumberOfCodeBlocksAsserted, 132 NumberOfCheckSat, 1238 ConstructedInterpolants, 0 QuantifiedInterpolants, 126328 SizeOfPredicates, 120 NumberOfNonLiveVariables, 4978 ConjunctsInSsa, 1459 ConjunctsInUnsatCore, 63 InterpolantComputations, 5 PerfectInterpolantSequences, 1382/3644 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-10-13-552.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-10-13-552.csv Received shutdown request...