java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:28:02,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:28:02,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:28:02,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:28:02,045 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:28:02,046 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:28:02,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:28:02,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:28:02,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:28:02,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:28:02,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:28:02,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:28:02,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:28:02,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:28:02,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:28:02,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:28:02,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:28:02,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:28:02,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:28:02,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:28:02,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:28:02,074 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:28:02,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:28:02,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:28:02,075 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:28:02,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:28:02,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:28:02,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:28:02,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:28:02,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:28:02,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:28:02,080 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:28:02,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:28:02,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:28:02,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:28:02,081 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:28:02,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:28:02,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:28:02,097 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:28:02,097 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:28:02,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:28:02,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:28:02,098 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:28:02,098 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:28:02,100 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:28:02,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:28:02,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:28:02,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:28:02,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:28:02,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:28:02,101 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:28:02,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:28:02,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:28:02,102 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:28:02,102 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:28:02,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:28:02,102 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:28:02,103 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:28:02,104 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:28:02,156 INFO ]: Repository-Root is: /tmp [2018-06-25 09:28:02,174 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:28:02,179 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:28:02,180 INFO ]: Initializing SmtParser... [2018-06-25 09:28:02,181 INFO ]: SmtParser initialized [2018-06-25 09:28:02,181 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 [2018-06-25 09:28:02,182 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:28:02,274 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 unknown [2018-06-25 09:28:02,563 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 [2018-06-25 09:28:02,568 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:28:02,579 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:28:02,579 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:28:02,579 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:28:02,580 INFO ]: ChcToBoogie initialized [2018-06-25 09:28:02,587 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:28:02" (1/1) ... [2018-06-25 09:28:02,642 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:28:02 Unit [2018-06-25 09:28:02,642 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:28:02,643 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:28:02,643 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:28:02,643 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:28:02,663 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:28:02" (1/1) ... [2018-06-25 09:28:02,663 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:28:02" (1/1) ... [2018-06-25 09:28:02,668 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:28:02" (1/1) ... [2018-06-25 09:28:02,669 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:28:02" (1/1) ... [2018-06-25 09:28:02,671 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:28:02" (1/1) ... [2018-06-25 09:28:02,675 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:28:02" (1/1) ... [2018-06-25 09:28:02,676 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:28:02" (1/1) ... [2018-06-25 09:28:02,679 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:28:02,679 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:28:02,679 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:28:02,679 INFO ]: RCFGBuilder initialized [2018-06-25 09:28:02,680 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:28:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:28:02,693 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:28:02,694 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:28:02,694 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:28:02,694 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:28:02,694 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:28:02,694 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:28:03,001 INFO ]: Using library mode [2018-06-25 09:28:03,001 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:28:03 BoogieIcfgContainer [2018-06-25 09:28:03,001 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:28:03,003 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:28:03,004 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:28:03,007 INFO ]: TraceAbstraction initialized [2018-06-25 09:28:03,007 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:28:02" (1/3) ... [2018-06-25 09:28:03,008 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b49706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:28:03, skipping insertion in model container [2018-06-25 09:28:03,009 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:28:02" (2/3) ... [2018-06-25 09:28:03,009 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b49706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:28:03, skipping insertion in model container [2018-06-25 09:28:03,009 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:28:03" (3/3) ... [2018-06-25 09:28:03,012 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:28:03,021 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:28:03,029 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:28:03,065 INFO ]: Using default assertion order modulation [2018-06-25 09:28:03,065 INFO ]: Interprodecural is true [2018-06-25 09:28:03,065 INFO ]: Hoare is false [2018-06-25 09:28:03,065 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:28:03,065 INFO ]: Backedges is TWOTRACK [2018-06-25 09:28:03,065 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:28:03,065 INFO ]: Difference is false [2018-06-25 09:28:03,065 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:28:03,065 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:28:03,077 INFO ]: Start isEmpty. Operand 20 states. [2018-06-25 09:28:03,088 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:28:03,088 INFO ]: Found error trace [2018-06-25 09:28:03,089 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:03,089 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:03,094 INFO ]: Analyzing trace with hash -289322521, now seen corresponding path program 1 times [2018-06-25 09:28:03,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:03,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:03,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:03,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:03,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:03,162 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:03,199 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:28:03,201 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:28:03,201 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-25 09:28:03,202 INFO ]: Interpolant automaton has 2 states [2018-06-25 09:28:03,213 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-25 09:28:03,214 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:28:03,216 INFO ]: Start difference. First operand 20 states. Second operand 2 states. [2018-06-25 09:28:03,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:03,234 INFO ]: Finished difference Result 18 states and 25 transitions. [2018-06-25 09:28:03,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 09:28:03,235 INFO ]: Start accepts. Automaton has 2 states. Word has length 8 [2018-06-25 09:28:03,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:03,245 INFO ]: With dead ends: 18 [2018-06-25 09:28:03,245 INFO ]: Without dead ends: 18 [2018-06-25 09:28:03,247 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:28:03,266 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:28:03,284 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:28:03,285 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:28:03,286 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-06-25 09:28:03,287 INFO ]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 8 [2018-06-25 09:28:03,287 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:03,287 INFO ]: Abstraction has 18 states and 25 transitions. [2018-06-25 09:28:03,287 INFO ]: Interpolant automaton has 2 states. [2018-06-25 09:28:03,287 INFO ]: Start isEmpty. Operand 18 states and 25 transitions. [2018-06-25 09:28:03,289 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:28:03,289 INFO ]: Found error trace [2018-06-25 09:28:03,289 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:03,289 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:03,289 INFO ]: Analyzing trace with hash -422686897, now seen corresponding path program 1 times [2018-06-25 09:28:03,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:03,289 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:03,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:03,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:03,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:03,298 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:03,420 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:28:03,420 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:28:03,420 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:28:03,422 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:28:03,422 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:28:03,422 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:28:03,422 INFO ]: Start difference. First operand 18 states and 25 transitions. Second operand 4 states. [2018-06-25 09:28:03,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:03,581 INFO ]: Finished difference Result 29 states and 42 transitions. [2018-06-25 09:28:03,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:28:03,581 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:28:03,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:03,582 INFO ]: With dead ends: 29 [2018-06-25 09:28:03,582 INFO ]: Without dead ends: 29 [2018-06-25 09:28:03,583 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:28:03,583 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:28:03,590 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-25 09:28:03,590 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:28:03,592 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2018-06-25 09:28:03,592 INFO ]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 9 [2018-06-25 09:28:03,592 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:03,592 INFO ]: Abstraction has 29 states and 42 transitions. [2018-06-25 09:28:03,592 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:28:03,592 INFO ]: Start isEmpty. Operand 29 states and 42 transitions. [2018-06-25 09:28:03,593 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:28:03,593 INFO ]: Found error trace [2018-06-25 09:28:03,593 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:03,593 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:03,593 INFO ]: Analyzing trace with hash -1466685659, now seen corresponding path program 1 times [2018-06-25 09:28:03,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:03,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:03,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:03,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:03,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:03,605 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:03,706 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:28:03,706 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:28:03,706 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:28:03,706 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:28:03,706 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:28:03,706 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:28:03,706 INFO ]: Start difference. First operand 29 states and 42 transitions. Second operand 4 states. [2018-06-25 09:28:03,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:03,802 INFO ]: Finished difference Result 43 states and 66 transitions. [2018-06-25 09:28:03,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:28:03,803 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:28:03,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:03,807 INFO ]: With dead ends: 43 [2018-06-25 09:28:03,807 INFO ]: Without dead ends: 43 [2018-06-25 09:28:03,809 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:28:03,809 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:28:03,819 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-06-25 09:28:03,819 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:28:03,820 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2018-06-25 09:28:03,821 INFO ]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 11 [2018-06-25 09:28:03,821 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:03,821 INFO ]: Abstraction has 33 states and 48 transitions. [2018-06-25 09:28:03,821 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:28:03,821 INFO ]: Start isEmpty. Operand 33 states and 48 transitions. [2018-06-25 09:28:03,822 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:28:03,822 INFO ]: Found error trace [2018-06-25 09:28:03,822 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:03,822 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:03,822 INFO ]: Analyzing trace with hash 308321703, now seen corresponding path program 1 times [2018-06-25 09:28:03,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:03,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:03,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:03,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:03,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:03,845 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:03,940 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:28:03,940 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:28:03,941 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:28:03,941 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:28:03,941 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:28:03,941 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:28:03,941 INFO ]: Start difference. First operand 33 states and 48 transitions. Second operand 4 states. [2018-06-25 09:28:04,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:04,005 INFO ]: Finished difference Result 48 states and 72 transitions. [2018-06-25 09:28:04,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:28:04,006 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:28:04,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:04,007 INFO ]: With dead ends: 48 [2018-06-25 09:28:04,008 INFO ]: Without dead ends: 48 [2018-06-25 09:28:04,008 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:28:04,008 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 09:28:04,015 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 30. [2018-06-25 09:28:04,015 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:28:04,016 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-06-25 09:28:04,016 INFO ]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 11 [2018-06-25 09:28:04,016 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:04,016 INFO ]: Abstraction has 30 states and 42 transitions. [2018-06-25 09:28:04,016 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:28:04,016 INFO ]: Start isEmpty. Operand 30 states and 42 transitions. [2018-06-25 09:28:04,017 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:28:04,017 INFO ]: Found error trace [2018-06-25 09:28:04,017 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:04,018 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:04,018 INFO ]: Analyzing trace with hash 1924954168, now seen corresponding path program 1 times [2018-06-25 09:28:04,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:04,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:04,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:04,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:04,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:04,028 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:04,096 INFO ]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:28:04,096 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:28:04,096 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:28:04,097 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:28:04,097 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:28:04,097 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:28:04,097 INFO ]: Start difference. First operand 30 states and 42 transitions. Second operand 4 states. [2018-06-25 09:28:04,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:04,211 INFO ]: Finished difference Result 45 states and 63 transitions. [2018-06-25 09:28:04,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:28:04,212 INFO ]: Start accepts. Automaton has 4 states. Word has length 20 [2018-06-25 09:28:04,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:04,213 INFO ]: With dead ends: 45 [2018-06-25 09:28:04,213 INFO ]: Without dead ends: 45 [2018-06-25 09:28:04,213 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:28:04,213 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:28:04,223 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-25 09:28:04,223 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:28:04,224 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2018-06-25 09:28:04,224 INFO ]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 20 [2018-06-25 09:28:04,224 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:04,224 INFO ]: Abstraction has 45 states and 63 transitions. [2018-06-25 09:28:04,224 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:28:04,225 INFO ]: Start isEmpty. Operand 45 states and 63 transitions. [2018-06-25 09:28:04,229 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:28:04,230 INFO ]: Found error trace [2018-06-25 09:28:04,230 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:04,230 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:04,230 INFO ]: Analyzing trace with hash 2135837615, now seen corresponding path program 1 times [2018-06-25 09:28:04,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:04,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:04,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:04,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:04,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:04,266 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:04,404 INFO ]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:28:04,404 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:04,404 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:04,412 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:04,457 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:04,463 INFO ]: Computing forward predicates... [2018-06-25 09:28:04,550 INFO ]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:28:04,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:04,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 09:28:04,571 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:28:04,572 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:28:04,572 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:28:04,572 INFO ]: Start difference. First operand 45 states and 63 transitions. Second operand 12 states. [2018-06-25 09:28:04,883 WARN ]: Spent 150.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-06-25 09:28:05,246 WARN ]: Spent 203.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-25 09:28:06,020 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:06,020 INFO ]: Finished difference Result 127 states and 207 transitions. [2018-06-25 09:28:06,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:28:06,022 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-25 09:28:06,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:06,024 INFO ]: With dead ends: 127 [2018-06-25 09:28:06,024 INFO ]: Without dead ends: 92 [2018-06-25 09:28:06,025 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:28:06,025 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-25 09:28:06,045 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-06-25 09:28:06,045 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 09:28:06,047 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2018-06-25 09:28:06,047 INFO ]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 29 [2018-06-25 09:28:06,048 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:06,048 INFO ]: Abstraction has 64 states and 93 transitions. [2018-06-25 09:28:06,048 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:28:06,048 INFO ]: Start isEmpty. Operand 64 states and 93 transitions. [2018-06-25 09:28:06,050 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:28:06,050 INFO ]: Found error trace [2018-06-25 09:28:06,050 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:06,051 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:06,051 INFO ]: Analyzing trace with hash -2018581071, now seen corresponding path program 1 times [2018-06-25 09:28:06,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:06,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:06,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:06,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:06,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:06,064 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:06,177 INFO ]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:28:06,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:06,177 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) [2018-06-25 09:28:06,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:06,220 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:06,223 INFO ]: Computing forward predicates... [2018-06-25 09:28:06,274 INFO ]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:28:06,293 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:06,293 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 09:28:06,293 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:28:06,294 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:28:06,294 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:28:06,294 INFO ]: Start difference. First operand 64 states and 93 transitions. Second operand 12 states. [2018-06-25 09:28:06,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:06,577 INFO ]: Finished difference Result 101 states and 167 transitions. [2018-06-25 09:28:06,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:28:06,578 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-25 09:28:06,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:06,580 INFO ]: With dead ends: 101 [2018-06-25 09:28:06,580 INFO ]: Without dead ends: 101 [2018-06-25 09:28:06,580 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:28:06,580 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-25 09:28:06,599 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 64. [2018-06-25 09:28:06,599 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 09:28:06,600 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2018-06-25 09:28:06,600 INFO ]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 29 [2018-06-25 09:28:06,601 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:06,601 INFO ]: Abstraction has 64 states and 93 transitions. [2018-06-25 09:28:06,601 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:28:06,601 INFO ]: Start isEmpty. Operand 64 states and 93 transitions. [2018-06-25 09:28:06,603 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:28:06,603 INFO ]: Found error trace [2018-06-25 09:28:06,603 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:06,603 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:06,604 INFO ]: Analyzing trace with hash -784942014, now seen corresponding path program 1 times [2018-06-25 09:28:06,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:06,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:06,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:06,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:06,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:06,618 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:06,726 INFO ]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:28:06,726 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:06,726 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:06,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:06,750 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:06,752 INFO ]: Computing forward predicates... [2018-06-25 09:28:06,792 INFO ]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:28:06,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:06,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-25 09:28:06,824 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:28:06,824 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:28:06,824 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:28:06,825 INFO ]: Start difference. First operand 64 states and 93 transitions. Second operand 11 states. [2018-06-25 09:28:07,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:07,374 INFO ]: Finished difference Result 134 states and 239 transitions. [2018-06-25 09:28:07,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:28:07,375 INFO ]: Start accepts. Automaton has 11 states. Word has length 30 [2018-06-25 09:28:07,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:07,377 INFO ]: With dead ends: 134 [2018-06-25 09:28:07,377 INFO ]: Without dead ends: 134 [2018-06-25 09:28:07,377 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:28:07,378 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-25 09:28:07,398 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 83. [2018-06-25 09:28:07,398 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-25 09:28:07,400 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2018-06-25 09:28:07,400 INFO ]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 30 [2018-06-25 09:28:07,400 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:07,400 INFO ]: Abstraction has 83 states and 130 transitions. [2018-06-25 09:28:07,400 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:28:07,400 INFO ]: Start isEmpty. Operand 83 states and 130 transitions. [2018-06-25 09:28:07,403 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:28:07,403 INFO ]: Found error trace [2018-06-25 09:28:07,403 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:07,403 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:07,403 INFO ]: Analyzing trace with hash -722902400, now seen corresponding path program 1 times [2018-06-25 09:28:07,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:07,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:07,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:07,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:07,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:07,415 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:07,504 INFO ]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:28:07,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:07,505 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:07,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:07,526 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:07,529 INFO ]: Computing forward predicates... [2018-06-25 09:28:07,659 INFO ]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:28:07,678 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:07,678 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-25 09:28:07,678 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:28:07,678 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:28:07,679 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:28:07,679 INFO ]: Start difference. First operand 83 states and 130 transitions. Second operand 11 states. [2018-06-25 09:28:08,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:08,217 INFO ]: Finished difference Result 143 states and 263 transitions. [2018-06-25 09:28:08,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:28:08,218 INFO ]: Start accepts. Automaton has 11 states. Word has length 30 [2018-06-25 09:28:08,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:08,220 INFO ]: With dead ends: 143 [2018-06-25 09:28:08,220 INFO ]: Without dead ends: 143 [2018-06-25 09:28:08,220 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:28:08,221 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-25 09:28:08,237 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 71. [2018-06-25 09:28:08,237 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-25 09:28:08,238 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2018-06-25 09:28:08,238 INFO ]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 30 [2018-06-25 09:28:08,238 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:08,238 INFO ]: Abstraction has 71 states and 103 transitions. [2018-06-25 09:28:08,238 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:28:08,238 INFO ]: Start isEmpty. Operand 71 states and 103 transitions. [2018-06-25 09:28:08,240 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:28:08,241 INFO ]: Found error trace [2018-06-25 09:28:08,241 INFO ]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:08,241 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:08,241 INFO ]: Analyzing trace with hash -391613569, now seen corresponding path program 2 times [2018-06-25 09:28:08,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:08,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:08,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:08,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:08,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:08,252 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:08,280 INFO ]: Checked inductivity of 37 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:28:08,280 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:08,280 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) [2018-06-25 09:28:08,298 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:08,336 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:28:08,336 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:08,338 INFO ]: Computing forward predicates... [2018-06-25 09:28:08,343 INFO ]: Checked inductivity of 37 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:28:08,363 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:08,363 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:28:08,363 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:28:08,363 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:28:08,363 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:28:08,364 INFO ]: Start difference. First operand 71 states and 103 transitions. Second operand 4 states. [2018-06-25 09:28:08,397 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:08,397 INFO ]: Finished difference Result 84 states and 120 transitions. [2018-06-25 09:28:08,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:28:08,398 INFO ]: Start accepts. Automaton has 4 states. Word has length 39 [2018-06-25 09:28:08,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:08,399 INFO ]: With dead ends: 84 [2018-06-25 09:28:08,399 INFO ]: Without dead ends: 66 [2018-06-25 09:28:08,399 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:28:08,399 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-25 09:28:08,405 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-25 09:28:08,405 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-25 09:28:08,406 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2018-06-25 09:28:08,406 INFO ]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 39 [2018-06-25 09:28:08,406 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:08,406 INFO ]: Abstraction has 66 states and 93 transitions. [2018-06-25 09:28:08,406 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:28:08,406 INFO ]: Start isEmpty. Operand 66 states and 93 transitions. [2018-06-25 09:28:08,408 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-25 09:28:08,408 INFO ]: Found error trace [2018-06-25 09:28:08,408 INFO ]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:08,408 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:08,408 INFO ]: Analyzing trace with hash -1979128884, now seen corresponding path program 3 times [2018-06-25 09:28:08,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:08,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:08,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:08,409 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:08,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:08,422 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:08,539 INFO ]: Checked inductivity of 63 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:28:08,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:08,539 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) [2018-06-25 09:28:08,554 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:08,646 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:28:08,646 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:08,649 INFO ]: Computing forward predicates... [2018-06-25 09:28:08,951 INFO ]: Checked inductivity of 63 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-25 09:28:08,970 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:08,970 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-06-25 09:28:08,970 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:28:08,971 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:28:08,971 INFO ]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:28:08,971 INFO ]: Start difference. First operand 66 states and 93 transitions. Second operand 15 states. [2018-06-25 09:28:09,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:09,827 INFO ]: Finished difference Result 119 states and 203 transitions. [2018-06-25 09:28:09,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:28:09,827 INFO ]: Start accepts. Automaton has 15 states. Word has length 48 [2018-06-25 09:28:09,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:09,829 INFO ]: With dead ends: 119 [2018-06-25 09:28:09,829 INFO ]: Without dead ends: 119 [2018-06-25 09:28:09,829 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:28:09,830 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-25 09:28:09,841 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 69. [2018-06-25 09:28:09,841 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-25 09:28:09,842 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2018-06-25 09:28:09,843 INFO ]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 48 [2018-06-25 09:28:09,843 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:09,843 INFO ]: Abstraction has 69 states and 99 transitions. [2018-06-25 09:28:09,843 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:28:09,843 INFO ]: Start isEmpty. Operand 69 states and 99 transitions. [2018-06-25 09:28:09,844 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-25 09:28:09,844 INFO ]: Found error trace [2018-06-25 09:28:09,844 INFO ]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:09,844 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:09,845 INFO ]: Analyzing trace with hash 266450570, now seen corresponding path program 2 times [2018-06-25 09:28:09,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:09,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:09,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:09,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:09,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:09,859 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:10,042 INFO ]: Checked inductivity of 63 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-25 09:28:10,043 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:10,043 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:10,049 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:28:10,073 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:28:10,073 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:10,076 INFO ]: Computing forward predicates... [2018-06-25 09:28:10,134 INFO ]: Checked inductivity of 63 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-25 09:28:10,152 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:10,153 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2018-06-25 09:28:10,153 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:28:10,153 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:28:10,153 INFO ]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:28:10,153 INFO ]: Start difference. First operand 69 states and 99 transitions. Second operand 15 states. [2018-06-25 09:28:10,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:10,466 INFO ]: Finished difference Result 122 states and 209 transitions. [2018-06-25 09:28:10,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:28:10,485 INFO ]: Start accepts. Automaton has 15 states. Word has length 48 [2018-06-25 09:28:10,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:10,486 INFO ]: With dead ends: 122 [2018-06-25 09:28:10,486 INFO ]: Without dead ends: 122 [2018-06-25 09:28:10,487 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:28:10,487 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-25 09:28:10,495 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 69. [2018-06-25 09:28:10,495 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-25 09:28:10,496 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2018-06-25 09:28:10,496 INFO ]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 48 [2018-06-25 09:28:10,497 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:10,497 INFO ]: Abstraction has 69 states and 99 transitions. [2018-06-25 09:28:10,497 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:28:10,497 INFO ]: Start isEmpty. Operand 69 states and 99 transitions. [2018-06-25 09:28:10,498 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-25 09:28:10,498 INFO ]: Found error trace [2018-06-25 09:28:10,498 INFO ]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:10,498 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:10,498 INFO ]: Analyzing trace with hash -1361540007, now seen corresponding path program 4 times [2018-06-25 09:28:10,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:10,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:10,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:10,499 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:10,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:10,515 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:10,747 INFO ]: Checked inductivity of 65 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:28:10,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:10,747 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:10,753 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:28:10,789 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:28:10,789 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:10,793 INFO ]: Computing forward predicates... [2018-06-25 09:28:10,970 INFO ]: Checked inductivity of 65 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-25 09:28:10,989 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:10,989 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2018-06-25 09:28:10,989 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:28:10,989 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:28:10,989 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:28:10,989 INFO ]: Start difference. First operand 69 states and 99 transitions. Second operand 13 states. [2018-06-25 09:28:11,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:11,698 INFO ]: Finished difference Result 169 states and 333 transitions. [2018-06-25 09:28:11,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:28:11,698 INFO ]: Start accepts. Automaton has 13 states. Word has length 49 [2018-06-25 09:28:11,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:11,700 INFO ]: With dead ends: 169 [2018-06-25 09:28:11,700 INFO ]: Without dead ends: 169 [2018-06-25 09:28:11,700 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:28:11,701 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-25 09:28:11,718 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 92. [2018-06-25 09:28:11,718 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-25 09:28:11,719 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 142 transitions. [2018-06-25 09:28:11,720 INFO ]: Start accepts. Automaton has 92 states and 142 transitions. Word has length 49 [2018-06-25 09:28:11,720 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:11,720 INFO ]: Abstraction has 92 states and 142 transitions. [2018-06-25 09:28:11,720 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:28:11,720 INFO ]: Start isEmpty. Operand 92 states and 142 transitions. [2018-06-25 09:28:11,721 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-25 09:28:11,721 INFO ]: Found error trace [2018-06-25 09:28:11,721 INFO ]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:11,721 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:11,722 INFO ]: Analyzing trace with hash -468053669, now seen corresponding path program 3 times [2018-06-25 09:28:11,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:11,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:11,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:11,722 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:11,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:11,737 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:11,884 INFO ]: Checked inductivity of 65 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:28:11,884 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:11,884 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:11,893 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:28:11,965 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:28:11,965 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:11,968 INFO ]: Computing forward predicates... [2018-06-25 09:28:12,391 INFO ]: Checked inductivity of 65 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-25 09:28:12,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:12,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2018-06-25 09:28:12,410 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:28:12,410 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:28:12,410 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:28:12,410 INFO ]: Start difference. First operand 92 states and 142 transitions. Second operand 13 states. [2018-06-25 09:28:12,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:12,952 INFO ]: Finished difference Result 178 states and 363 transitions. [2018-06-25 09:28:12,953 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:28:12,953 INFO ]: Start accepts. Automaton has 13 states. Word has length 49 [2018-06-25 09:28:12,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:12,955 INFO ]: With dead ends: 178 [2018-06-25 09:28:12,955 INFO ]: Without dead ends: 178 [2018-06-25 09:28:12,956 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:28:12,956 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-25 09:28:12,975 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 77. [2018-06-25 09:28:12,975 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-25 09:28:12,976 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2018-06-25 09:28:12,976 INFO ]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 49 [2018-06-25 09:28:12,976 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:12,976 INFO ]: Abstraction has 77 states and 109 transitions. [2018-06-25 09:28:12,976 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:28:12,976 INFO ]: Start isEmpty. Operand 77 states and 109 transitions. [2018-06-25 09:28:12,977 INFO ]: Finished isEmpty. Found accepting run of length 68 [2018-06-25 09:28:12,977 INFO ]: Found error trace [2018-06-25 09:28:12,977 INFO ]: trace histogram [7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:12,978 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:12,978 INFO ]: Analyzing trace with hash 980905059, now seen corresponding path program 5 times [2018-06-25 09:28:12,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:12,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:12,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:12,978 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:12,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:12,993 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:13,256 INFO ]: Checked inductivity of 138 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-25 09:28:13,256 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:13,256 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:13,261 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:28:13,294 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:28:13,294 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:13,298 INFO ]: Computing forward predicates... [2018-06-25 09:28:13,387 INFO ]: Checked inductivity of 138 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-25 09:28:13,417 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:13,417 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2018-06-25 09:28:13,417 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:28:13,417 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:28:13,417 INFO ]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:28:13,417 INFO ]: Start difference. First operand 77 states and 109 transitions. Second operand 17 states. [2018-06-25 09:28:13,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:13,742 INFO ]: Finished difference Result 151 states and 273 transitions. [2018-06-25 09:28:13,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:28:13,742 INFO ]: Start accepts. Automaton has 17 states. Word has length 67 [2018-06-25 09:28:13,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:13,744 INFO ]: With dead ends: 151 [2018-06-25 09:28:13,744 INFO ]: Without dead ends: 151 [2018-06-25 09:28:13,744 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:28:13,744 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-25 09:28:13,754 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 80. [2018-06-25 09:28:13,754 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-25 09:28:13,754 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2018-06-25 09:28:13,755 INFO ]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 67 [2018-06-25 09:28:13,755 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:13,755 INFO ]: Abstraction has 80 states and 115 transitions. [2018-06-25 09:28:13,755 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:28:13,755 INFO ]: Start isEmpty. Operand 80 states and 115 transitions. [2018-06-25 09:28:13,756 INFO ]: Finished isEmpty. Found accepting run of length 68 [2018-06-25 09:28:13,756 INFO ]: Found error trace [2018-06-25 09:28:13,756 INFO ]: trace histogram [7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:13,756 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:13,756 INFO ]: Analyzing trace with hash 563508453, now seen corresponding path program 4 times [2018-06-25 09:28:13,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:13,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:13,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:13,757 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:13,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:13,769 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:13,939 INFO ]: Checked inductivity of 138 backedges. 50 proven. 27 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-25 09:28:13,940 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:13,940 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:13,945 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:28:13,983 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:28:13,983 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:13,987 INFO ]: Computing forward predicates... [2018-06-25 09:28:14,062 INFO ]: Checked inductivity of 138 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-25 09:28:14,093 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:14,093 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2018-06-25 09:28:14,094 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:28:14,094 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:28:14,094 INFO ]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:28:14,094 INFO ]: Start difference. First operand 80 states and 115 transitions. Second operand 17 states. [2018-06-25 09:28:15,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:15,114 INFO ]: Finished difference Result 154 states and 279 transitions. [2018-06-25 09:28:15,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:28:15,115 INFO ]: Start accepts. Automaton has 17 states. Word has length 67 [2018-06-25 09:28:15,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:15,116 INFO ]: With dead ends: 154 [2018-06-25 09:28:15,116 INFO ]: Without dead ends: 154 [2018-06-25 09:28:15,117 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:28:15,117 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-25 09:28:15,126 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 80. [2018-06-25 09:28:15,126 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-25 09:28:15,127 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2018-06-25 09:28:15,127 INFO ]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 67 [2018-06-25 09:28:15,127 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:15,127 INFO ]: Abstraction has 80 states and 115 transitions. [2018-06-25 09:28:15,127 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:28:15,127 INFO ]: Start isEmpty. Operand 80 states and 115 transitions. [2018-06-25 09:28:15,128 INFO ]: Finished isEmpty. Found accepting run of length 69 [2018-06-25 09:28:15,128 INFO ]: Found error trace [2018-06-25 09:28:15,128 INFO ]: trace histogram [7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:15,128 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:15,129 INFO ]: Analyzing trace with hash -1239820618, now seen corresponding path program 6 times [2018-06-25 09:28:15,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:15,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:15,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:15,129 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:15,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:15,144 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:15,342 INFO ]: Checked inductivity of 141 backedges. 20 proven. 58 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-25 09:28:15,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:15,342 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:15,352 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:28:15,384 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-25 09:28:15,384 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:15,388 INFO ]: Computing forward predicates... [2018-06-25 09:28:15,559 INFO ]: Checked inductivity of 141 backedges. 20 proven. 54 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-25 09:28:15,579 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:15,587 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 15 [2018-06-25 09:28:15,587 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:28:15,588 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:28:15,588 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:28:15,588 INFO ]: Start difference. First operand 80 states and 115 transitions. Second operand 15 states. [2018-06-25 09:28:16,607 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:16,607 INFO ]: Finished difference Result 219 states and 481 transitions. [2018-06-25 09:28:16,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 09:28:16,608 INFO ]: Start accepts. Automaton has 15 states. Word has length 68 [2018-06-25 09:28:16,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:16,611 INFO ]: With dead ends: 219 [2018-06-25 09:28:16,611 INFO ]: Without dead ends: 219 [2018-06-25 09:28:16,611 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1615, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 09:28:16,612 INFO ]: Start minimizeSevpa. Operand 219 states. [2018-06-25 09:28:16,636 INFO ]: Finished minimizeSevpa. Reduced states from 219 to 106. [2018-06-25 09:28:16,636 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-25 09:28:16,637 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 164 transitions. [2018-06-25 09:28:16,637 INFO ]: Start accepts. Automaton has 106 states and 164 transitions. Word has length 68 [2018-06-25 09:28:16,638 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:16,638 INFO ]: Abstraction has 106 states and 164 transitions. [2018-06-25 09:28:16,638 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:28:16,638 INFO ]: Start isEmpty. Operand 106 states and 164 transitions. [2018-06-25 09:28:16,639 INFO ]: Finished isEmpty. Found accepting run of length 69 [2018-06-25 09:28:16,639 INFO ]: Found error trace [2018-06-25 09:28:16,639 INFO ]: trace histogram [7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:16,639 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:16,639 INFO ]: Analyzing trace with hash -1294213516, now seen corresponding path program 5 times [2018-06-25 09:28:16,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:16,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:16,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:16,642 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:16,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:16,660 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:16,963 INFO ]: Checked inductivity of 141 backedges. 20 proven. 58 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-25 09:28:16,963 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:16,963 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:16,975 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:28:17,021 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:28:17,021 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:17,024 INFO ]: Computing forward predicates... [2018-06-25 09:28:17,113 INFO ]: Checked inductivity of 141 backedges. 20 proven. 54 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-25 09:28:17,132 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:17,132 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 15 [2018-06-25 09:28:17,133 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:28:17,133 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:28:17,133 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:28:17,133 INFO ]: Start difference. First operand 106 states and 164 transitions. Second operand 15 states. [2018-06-25 09:28:18,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:18,391 INFO ]: Finished difference Result 228 states and 517 transitions. [2018-06-25 09:28:18,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 09:28:18,391 INFO ]: Start accepts. Automaton has 15 states. Word has length 68 [2018-06-25 09:28:18,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:18,394 INFO ]: With dead ends: 228 [2018-06-25 09:28:18,394 INFO ]: Without dead ends: 228 [2018-06-25 09:28:18,395 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1615, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 09:28:18,395 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-25 09:28:18,425 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 88. [2018-06-25 09:28:18,425 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-25 09:28:18,426 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2018-06-25 09:28:18,426 INFO ]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 68 [2018-06-25 09:28:18,427 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:18,427 INFO ]: Abstraction has 88 states and 125 transitions. [2018-06-25 09:28:18,427 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:28:18,427 INFO ]: Start isEmpty. Operand 88 states and 125 transitions. [2018-06-25 09:28:18,428 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-25 09:28:18,428 INFO ]: Found error trace [2018-06-25 09:28:18,428 INFO ]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:18,428 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:18,428 INFO ]: Analyzing trace with hash 1377659328, now seen corresponding path program 7 times [2018-06-25 09:28:18,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:18,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:18,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:18,430 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:18,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:18,444 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:18,782 INFO ]: Checked inductivity of 242 backedges. 90 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-25 09:28:18,782 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:18,782 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:18,788 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:18,820 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:18,823 INFO ]: Computing forward predicates... [2018-06-25 09:28:18,895 INFO ]: Checked inductivity of 242 backedges. 111 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-25 09:28:18,923 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:18,923 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 19 [2018-06-25 09:28:18,923 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:28:18,923 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:28:18,923 INFO ]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:28:18,923 INFO ]: Start difference. First operand 88 states and 125 transitions. Second operand 19 states. [2018-06-25 09:28:19,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:19,393 INFO ]: Finished difference Result 183 states and 349 transitions. [2018-06-25 09:28:19,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:28:19,393 INFO ]: Start accepts. Automaton has 19 states. Word has length 86 [2018-06-25 09:28:19,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:19,394 INFO ]: With dead ends: 183 [2018-06-25 09:28:19,394 INFO ]: Without dead ends: 183 [2018-06-25 09:28:19,395 INFO ]: 0 DeclaredPredicates, 134 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:28:19,395 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-25 09:28:19,407 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 91. [2018-06-25 09:28:19,407 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-25 09:28:19,407 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2018-06-25 09:28:19,407 INFO ]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 86 [2018-06-25 09:28:19,410 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:19,410 INFO ]: Abstraction has 91 states and 131 transitions. [2018-06-25 09:28:19,410 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:28:19,410 INFO ]: Start isEmpty. Operand 91 states and 131 transitions. [2018-06-25 09:28:19,411 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-25 09:28:19,411 INFO ]: Found error trace [2018-06-25 09:28:19,411 INFO ]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:19,411 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:19,411 INFO ]: Analyzing trace with hash -1350550018, now seen corresponding path program 6 times [2018-06-25 09:28:19,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:19,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:19,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:19,412 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:19,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:19,425 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:19,599 INFO ]: Checked inductivity of 242 backedges. 93 proven. 40 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-06-25 09:28:19,599 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:19,599 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:19,605 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:28:19,641 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-25 09:28:19,641 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:19,644 INFO ]: Computing forward predicates... [2018-06-25 09:28:19,711 INFO ]: Checked inductivity of 242 backedges. 111 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-25 09:28:19,730 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:19,730 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 19 [2018-06-25 09:28:19,730 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:28:19,730 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:28:19,730 INFO ]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:28:19,730 INFO ]: Start difference. First operand 91 states and 131 transitions. Second operand 19 states. [2018-06-25 09:28:20,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:20,159 INFO ]: Finished difference Result 186 states and 355 transitions. [2018-06-25 09:28:20,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:28:20,159 INFO ]: Start accepts. Automaton has 19 states. Word has length 86 [2018-06-25 09:28:20,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:20,160 INFO ]: With dead ends: 186 [2018-06-25 09:28:20,160 INFO ]: Without dead ends: 186 [2018-06-25 09:28:20,160 INFO ]: 0 DeclaredPredicates, 134 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:28:20,161 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-25 09:28:20,173 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 91. [2018-06-25 09:28:20,173 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-25 09:28:20,174 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2018-06-25 09:28:20,174 INFO ]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 86 [2018-06-25 09:28:20,174 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:20,174 INFO ]: Abstraction has 91 states and 131 transitions. [2018-06-25 09:28:20,174 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:28:20,174 INFO ]: Start isEmpty. Operand 91 states and 131 transitions. [2018-06-25 09:28:20,175 INFO ]: Finished isEmpty. Found accepting run of length 88 [2018-06-25 09:28:20,175 INFO ]: Found error trace [2018-06-25 09:28:20,175 INFO ]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:20,175 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:20,175 INFO ]: Analyzing trace with hash -1149812595, now seen corresponding path program 8 times [2018-06-25 09:28:20,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:20,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:20,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:20,177 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:20,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:20,195 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:21,036 INFO ]: Checked inductivity of 246 backedges. 27 proven. 107 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-25 09:28:21,036 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:21,036 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:21,041 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:28:21,077 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:28:21,077 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:21,080 INFO ]: Computing forward predicates... [2018-06-25 09:28:21,302 INFO ]: Checked inductivity of 246 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-25 09:28:21,321 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:21,321 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-06-25 09:28:21,321 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:28:21,321 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:28:21,321 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:28:21,322 INFO ]: Start difference. First operand 91 states and 131 transitions. Second operand 17 states. [2018-06-25 09:28:23,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:23,033 INFO ]: Finished difference Result 269 states and 653 transitions. [2018-06-25 09:28:23,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-25 09:28:23,033 INFO ]: Start accepts. Automaton has 17 states. Word has length 87 [2018-06-25 09:28:23,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:23,036 INFO ]: With dead ends: 269 [2018-06-25 09:28:23,036 INFO ]: Without dead ends: 269 [2018-06-25 09:28:23,037 INFO ]: 0 DeclaredPredicates, 151 GetRequests, 85 SyntacticMatches, 14 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=392, Invalid=2470, Unknown=0, NotChecked=0, Total=2862 [2018-06-25 09:28:23,037 INFO ]: Start minimizeSevpa. Operand 269 states. [2018-06-25 09:28:23,081 INFO ]: Finished minimizeSevpa. Reduced states from 269 to 120. [2018-06-25 09:28:23,081 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-25 09:28:23,084 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2018-06-25 09:28:23,084 INFO ]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 87 [2018-06-25 09:28:23,084 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:23,084 INFO ]: Abstraction has 120 states and 186 transitions. [2018-06-25 09:28:23,084 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:28:23,084 INFO ]: Start isEmpty. Operand 120 states and 186 transitions. [2018-06-25 09:28:23,086 INFO ]: Finished isEmpty. Found accepting run of length 88 [2018-06-25 09:28:23,086 INFO ]: Found error trace [2018-06-25 09:28:23,086 INFO ]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:23,086 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:23,086 INFO ]: Analyzing trace with hash 175043599, now seen corresponding path program 7 times [2018-06-25 09:28:23,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:23,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:23,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:23,086 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:23,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:23,100 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:23,314 INFO ]: Checked inductivity of 246 backedges. 27 proven. 107 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-25 09:28:23,314 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:23,314 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:23,319 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:23,351 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:23,354 INFO ]: Computing forward predicates... [2018-06-25 09:28:23,458 INFO ]: Checked inductivity of 246 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-25 09:28:23,476 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:23,476 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-06-25 09:28:23,476 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:28:23,477 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:28:23,477 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:28:23,477 INFO ]: Start difference. First operand 120 states and 186 transitions. Second operand 17 states. [2018-06-25 09:28:24,886 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-06-25 09:28:25,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:25,863 INFO ]: Finished difference Result 278 states and 695 transitions. [2018-06-25 09:28:25,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-25 09:28:25,865 INFO ]: Start accepts. Automaton has 17 states. Word has length 87 [2018-06-25 09:28:25,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:25,867 INFO ]: With dead ends: 278 [2018-06-25 09:28:25,867 INFO ]: Without dead ends: 278 [2018-06-25 09:28:25,868 INFO ]: 0 DeclaredPredicates, 151 GetRequests, 85 SyntacticMatches, 14 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=392, Invalid=2470, Unknown=0, NotChecked=0, Total=2862 [2018-06-25 09:28:25,869 INFO ]: Start minimizeSevpa. Operand 278 states. [2018-06-25 09:28:25,919 INFO ]: Finished minimizeSevpa. Reduced states from 278 to 99. [2018-06-25 09:28:25,919 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-25 09:28:25,920 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2018-06-25 09:28:25,920 INFO ]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 87 [2018-06-25 09:28:25,920 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:25,920 INFO ]: Abstraction has 99 states and 141 transitions. [2018-06-25 09:28:25,920 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:28:25,920 INFO ]: Start isEmpty. Operand 99 states and 141 transitions. [2018-06-25 09:28:25,921 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-25 09:28:25,921 INFO ]: Found error trace [2018-06-25 09:28:25,921 INFO ]: trace histogram [11, 11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:25,921 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:25,921 INFO ]: Analyzing trace with hash -1907090409, now seen corresponding path program 9 times [2018-06-25 09:28:25,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:25,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:25,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:25,922 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:25,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:25,936 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:26,248 INFO ]: Checked inductivity of 375 backedges. 146 proven. 54 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-25 09:28:26,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:26,248 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:26,256 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:28:26,305 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-25 09:28:26,305 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:26,309 INFO ]: Computing forward predicates... [2018-06-25 09:28:26,449 INFO ]: Checked inductivity of 375 backedges. 173 proven. 19 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-25 09:28:26,471 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:26,471 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 21 [2018-06-25 09:28:26,471 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:28:26,471 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:28:26,471 INFO ]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:28:26,471 INFO ]: Start difference. First operand 99 states and 141 transitions. Second operand 21 states. [2018-06-25 09:28:26,929 WARN ]: Spent 182.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-06-25 09:28:27,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:27,371 INFO ]: Finished difference Result 215 states and 431 transitions. [2018-06-25 09:28:27,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-25 09:28:27,371 INFO ]: Start accepts. Automaton has 21 states. Word has length 105 [2018-06-25 09:28:27,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:27,372 INFO ]: With dead ends: 215 [2018-06-25 09:28:27,372 INFO ]: Without dead ends: 215 [2018-06-25 09:28:27,373 INFO ]: 0 DeclaredPredicates, 164 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=372, Invalid=1884, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 09:28:27,373 INFO ]: Start minimizeSevpa. Operand 215 states. [2018-06-25 09:28:27,390 INFO ]: Finished minimizeSevpa. Reduced states from 215 to 102. [2018-06-25 09:28:27,390 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-25 09:28:27,391 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2018-06-25 09:28:27,391 INFO ]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 105 [2018-06-25 09:28:27,392 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:27,392 INFO ]: Abstraction has 102 states and 147 transitions. [2018-06-25 09:28:27,392 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:28:27,392 INFO ]: Start isEmpty. Operand 102 states and 147 transitions. [2018-06-25 09:28:27,397 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-25 09:28:27,397 INFO ]: Found error trace [2018-06-25 09:28:27,397 INFO ]: trace histogram [11, 11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:27,397 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:27,397 INFO ]: Analyzing trace with hash 1080734489, now seen corresponding path program 8 times [2018-06-25 09:28:27,397 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:27,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:27,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:27,398 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:27,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:27,422 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:27,600 INFO ]: Checked inductivity of 375 backedges. 150 proven. 54 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-06-25 09:28:27,600 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:27,600 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:27,606 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:28:27,647 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:28:27,647 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:27,651 INFO ]: Computing forward predicates... [2018-06-25 09:28:27,722 INFO ]: Checked inductivity of 375 backedges. 173 proven. 19 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-25 09:28:27,745 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:27,745 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2018-06-25 09:28:27,745 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:28:27,745 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:28:27,745 INFO ]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:28:27,745 INFO ]: Start difference. First operand 102 states and 147 transitions. Second operand 21 states. [2018-06-25 09:28:29,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:29,219 INFO ]: Finished difference Result 218 states and 437 transitions. [2018-06-25 09:28:29,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-25 09:28:29,219 INFO ]: Start accepts. Automaton has 21 states. Word has length 105 [2018-06-25 09:28:29,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:29,221 INFO ]: With dead ends: 218 [2018-06-25 09:28:29,221 INFO ]: Without dead ends: 218 [2018-06-25 09:28:29,222 INFO ]: 0 DeclaredPredicates, 164 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=372, Invalid=1884, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 09:28:29,222 INFO ]: Start minimizeSevpa. Operand 218 states. [2018-06-25 09:28:29,238 INFO ]: Finished minimizeSevpa. Reduced states from 218 to 102. [2018-06-25 09:28:29,238 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-25 09:28:29,239 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2018-06-25 09:28:29,239 INFO ]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 105 [2018-06-25 09:28:29,239 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:29,239 INFO ]: Abstraction has 102 states and 147 transitions. [2018-06-25 09:28:29,239 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:28:29,239 INFO ]: Start isEmpty. Operand 102 states and 147 transitions. [2018-06-25 09:28:29,241 INFO ]: Finished isEmpty. Found accepting run of length 107 [2018-06-25 09:28:29,241 INFO ]: Found error trace [2018-06-25 09:28:29,241 INFO ]: trace histogram [11, 11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:29,241 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:29,241 INFO ]: Analyzing trace with hash -769183702, now seen corresponding path program 10 times [2018-06-25 09:28:29,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:29,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:29,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:29,242 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:29,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:29,260 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:29,780 INFO ]: Checked inductivity of 380 backedges. 34 proven. 171 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-25 09:28:29,780 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:29,780 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:29,786 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:28:29,828 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:28:29,828 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:29,832 INFO ]: Computing forward predicates... [2018-06-25 09:28:29,997 INFO ]: Checked inductivity of 380 backedges. 34 proven. 163 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-25 09:28:30,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:30,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 19 [2018-06-25 09:28:30,029 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:28:30,029 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:28:30,029 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:28:30,029 INFO ]: Start difference. First operand 102 states and 147 transitions. Second operand 19 states. [2018-06-25 09:28:31,556 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 09:28:33,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:33,136 INFO ]: Finished difference Result 319 states and 849 transitions. [2018-06-25 09:28:33,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-25 09:28:33,137 INFO ]: Start accepts. Automaton has 19 states. Word has length 106 [2018-06-25 09:28:33,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:33,139 INFO ]: With dead ends: 319 [2018-06-25 09:28:33,139 INFO ]: Without dead ends: 319 [2018-06-25 09:28:33,140 INFO ]: 0 DeclaredPredicates, 184 GetRequests, 105 SyntacticMatches, 17 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=526, Invalid=3506, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 09:28:33,140 INFO ]: Start minimizeSevpa. Operand 319 states. [2018-06-25 09:28:33,224 INFO ]: Finished minimizeSevpa. Reduced states from 319 to 134. [2018-06-25 09:28:33,224 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-25 09:28:33,225 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 208 transitions. [2018-06-25 09:28:33,225 INFO ]: Start accepts. Automaton has 134 states and 208 transitions. Word has length 106 [2018-06-25 09:28:33,225 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:33,225 INFO ]: Abstraction has 134 states and 208 transitions. [2018-06-25 09:28:33,225 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:28:33,225 INFO ]: Start isEmpty. Operand 134 states and 208 transitions. [2018-06-25 09:28:33,227 INFO ]: Finished isEmpty. Found accepting run of length 107 [2018-06-25 09:28:33,227 INFO ]: Found error trace [2018-06-25 09:28:33,227 INFO ]: trace histogram [11, 11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:33,227 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:33,227 INFO ]: Analyzing trace with hash 1659074920, now seen corresponding path program 9 times [2018-06-25 09:28:33,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:33,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:33,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:33,228 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:33,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:33,247 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:34,187 INFO ]: Checked inductivity of 380 backedges. 34 proven. 171 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-25 09:28:34,187 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:34,187 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:34,192 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:28:34,359 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-25 09:28:34,359 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:34,364 INFO ]: Computing forward predicates... [2018-06-25 09:28:34,714 INFO ]: Checked inductivity of 380 backedges. 34 proven. 163 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-25 09:28:34,733 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:34,733 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 19 [2018-06-25 09:28:34,733 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:28:34,733 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:28:34,734 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:28:34,734 INFO ]: Start difference. First operand 134 states and 208 transitions. Second operand 19 states. [2018-06-25 09:28:36,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:36,974 INFO ]: Finished difference Result 328 states and 897 transitions. [2018-06-25 09:28:36,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-25 09:28:36,974 INFO ]: Start accepts. Automaton has 19 states. Word has length 106 [2018-06-25 09:28:36,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:36,977 INFO ]: With dead ends: 328 [2018-06-25 09:28:36,977 INFO ]: Without dead ends: 328 [2018-06-25 09:28:36,978 INFO ]: 0 DeclaredPredicates, 184 GetRequests, 105 SyntacticMatches, 17 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=526, Invalid=3506, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 09:28:36,978 INFO ]: Start minimizeSevpa. Operand 328 states. [2018-06-25 09:28:37,069 INFO ]: Finished minimizeSevpa. Reduced states from 328 to 110. [2018-06-25 09:28:37,069 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-25 09:28:37,069 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2018-06-25 09:28:37,069 INFO ]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 106 [2018-06-25 09:28:37,070 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:37,070 INFO ]: Abstraction has 110 states and 157 transitions. [2018-06-25 09:28:37,070 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:28:37,070 INFO ]: Start isEmpty. Operand 110 states and 157 transitions. [2018-06-25 09:28:37,071 INFO ]: Finished isEmpty. Found accepting run of length 125 [2018-06-25 09:28:37,071 INFO ]: Found error trace [2018-06-25 09:28:37,071 INFO ]: trace histogram [13, 13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:37,071 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:37,071 INFO ]: Analyzing trace with hash -1969656140, now seen corresponding path program 11 times [2018-06-25 09:28:37,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:37,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:37,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:37,072 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:37,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:37,088 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:38,313 INFO ]: Checked inductivity of 537 backedges. 216 proven. 69 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-06-25 09:28:38,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:38,313 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:38,319 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:28:38,377 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-25 09:28:38,377 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:38,380 INFO ]: Computing forward predicates... [2018-06-25 09:28:38,506 INFO ]: Checked inductivity of 537 backedges. 249 proven. 26 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-25 09:28:38,525 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:38,525 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 23 [2018-06-25 09:28:38,525 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:28:38,525 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:28:38,525 INFO ]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:28:38,525 INFO ]: Start difference. First operand 110 states and 157 transitions. Second operand 23 states. [2018-06-25 09:28:39,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:39,136 INFO ]: Finished difference Result 247 states and 519 transitions. [2018-06-25 09:28:39,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-25 09:28:39,136 INFO ]: Start accepts. Automaton has 23 states. Word has length 124 [2018-06-25 09:28:39,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:39,137 INFO ]: With dead ends: 247 [2018-06-25 09:28:39,138 INFO ]: Without dead ends: 247 [2018-06-25 09:28:39,138 INFO ]: 0 DeclaredPredicates, 194 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=481, Invalid=2489, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 09:28:39,138 INFO ]: Start minimizeSevpa. Operand 247 states. [2018-06-25 09:28:39,161 INFO ]: Finished minimizeSevpa. Reduced states from 247 to 113. [2018-06-25 09:28:39,161 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-25 09:28:39,162 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2018-06-25 09:28:39,162 INFO ]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 124 [2018-06-25 09:28:39,162 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:39,162 INFO ]: Abstraction has 113 states and 163 transitions. [2018-06-25 09:28:39,162 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:28:39,162 INFO ]: Start isEmpty. Operand 113 states and 163 transitions. [2018-06-25 09:28:39,168 INFO ]: Finished isEmpty. Found accepting run of length 125 [2018-06-25 09:28:39,168 INFO ]: Found error trace [2018-06-25 09:28:39,168 INFO ]: trace histogram [13, 13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:39,168 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:39,168 INFO ]: Analyzing trace with hash 1232675954, now seen corresponding path program 10 times [2018-06-25 09:28:39,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:39,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:39,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:39,169 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:39,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:39,186 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:39,851 INFO ]: Checked inductivity of 537 backedges. 221 proven. 69 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-06-25 09:28:39,851 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:39,851 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:39,857 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:28:39,907 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:28:39,907 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:39,910 INFO ]: Computing forward predicates... [2018-06-25 09:28:40,316 INFO ]: Checked inductivity of 537 backedges. 249 proven. 26 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-25 09:28:40,348 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:40,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 23 [2018-06-25 09:28:40,348 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:28:40,348 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:28:40,348 INFO ]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:28:40,348 INFO ]: Start difference. First operand 113 states and 163 transitions. Second operand 23 states. [2018-06-25 09:28:40,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:40,990 INFO ]: Finished difference Result 250 states and 525 transitions. [2018-06-25 09:28:40,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-25 09:28:40,990 INFO ]: Start accepts. Automaton has 23 states. Word has length 124 [2018-06-25 09:28:40,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:40,992 INFO ]: With dead ends: 250 [2018-06-25 09:28:40,992 INFO ]: Without dead ends: 250 [2018-06-25 09:28:40,993 INFO ]: 0 DeclaredPredicates, 194 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=481, Invalid=2489, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 09:28:40,993 INFO ]: Start minimizeSevpa. Operand 250 states. [2018-06-25 09:28:41,016 INFO ]: Finished minimizeSevpa. Reduced states from 250 to 113. [2018-06-25 09:28:41,016 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-25 09:28:41,016 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2018-06-25 09:28:41,016 INFO ]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 124 [2018-06-25 09:28:41,019 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:41,019 INFO ]: Abstraction has 113 states and 163 transitions. [2018-06-25 09:28:41,019 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:28:41,019 INFO ]: Start isEmpty. Operand 113 states and 163 transitions. [2018-06-25 09:28:41,020 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-25 09:28:41,021 INFO ]: Found error trace [2018-06-25 09:28:41,021 INFO ]: trace histogram [13, 13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:41,021 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:41,021 INFO ]: Analyzing trace with hash -307706943, now seen corresponding path program 12 times [2018-06-25 09:28:41,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:41,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:41,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:41,021 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:41,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:41,043 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:41,359 INFO ]: Checked inductivity of 543 backedges. 41 proven. 250 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-06-25 09:28:41,359 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:41,359 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:41,364 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:28:41,426 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-25 09:28:41,426 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:41,430 INFO ]: Computing forward predicates... [2018-06-25 09:28:41,549 INFO ]: Checked inductivity of 543 backedges. 41 proven. 240 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-25 09:28:41,568 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:41,568 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-06-25 09:28:41,568 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:28:41,568 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:28:41,568 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:28:41,568 INFO ]: Start difference. First operand 113 states and 163 transitions. Second operand 21 states. [2018-06-25 09:28:44,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:44,985 INFO ]: Finished difference Result 369 states and 1069 transitions. [2018-06-25 09:28:44,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-25 09:28:44,985 INFO ]: Start accepts. Automaton has 21 states. Word has length 125 [2018-06-25 09:28:44,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:44,988 INFO ]: With dead ends: 369 [2018-06-25 09:28:44,988 INFO ]: Without dead ends: 369 [2018-06-25 09:28:44,989 INFO ]: 0 DeclaredPredicates, 217 GetRequests, 125 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=679, Invalid=4723, Unknown=0, NotChecked=0, Total=5402 [2018-06-25 09:28:44,989 INFO ]: Start minimizeSevpa. Operand 369 states. [2018-06-25 09:28:45,101 INFO ]: Finished minimizeSevpa. Reduced states from 369 to 148. [2018-06-25 09:28:45,101 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-25 09:28:45,102 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2018-06-25 09:28:45,102 INFO ]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 125 [2018-06-25 09:28:45,102 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:45,102 INFO ]: Abstraction has 148 states and 230 transitions. [2018-06-25 09:28:45,102 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:28:45,102 INFO ]: Start isEmpty. Operand 148 states and 230 transitions. [2018-06-25 09:28:45,105 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-25 09:28:45,105 INFO ]: Found error trace [2018-06-25 09:28:45,105 INFO ]: trace histogram [13, 13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:45,105 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:45,105 INFO ]: Analyzing trace with hash 180340163, now seen corresponding path program 11 times [2018-06-25 09:28:45,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:45,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:45,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:45,106 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:45,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:45,130 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:46,451 INFO ]: Checked inductivity of 543 backedges. 41 proven. 250 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-06-25 09:28:46,451 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:46,451 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:46,458 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:28:46,518 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-25 09:28:46,518 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:46,522 INFO ]: Computing forward predicates... [2018-06-25 09:28:46,698 INFO ]: Checked inductivity of 543 backedges. 41 proven. 240 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-25 09:28:46,719 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:46,719 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-06-25 09:28:46,719 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:28:46,719 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:28:46,719 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:28:46,719 INFO ]: Start difference. First operand 148 states and 230 transitions. Second operand 21 states. [2018-06-25 09:28:49,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:49,636 INFO ]: Finished difference Result 378 states and 1123 transitions. [2018-06-25 09:28:49,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-25 09:28:49,636 INFO ]: Start accepts. Automaton has 21 states. Word has length 125 [2018-06-25 09:28:49,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:49,640 INFO ]: With dead ends: 378 [2018-06-25 09:28:49,640 INFO ]: Without dead ends: 378 [2018-06-25 09:28:49,642 INFO ]: 0 DeclaredPredicates, 217 GetRequests, 125 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=679, Invalid=4723, Unknown=0, NotChecked=0, Total=5402 [2018-06-25 09:28:49,643 INFO ]: Start minimizeSevpa. Operand 378 states. [2018-06-25 09:28:49,854 INFO ]: Finished minimizeSevpa. Reduced states from 378 to 121. [2018-06-25 09:28:49,854 INFO ]: Start removeUnreachable. Operand 121 states. [2018-06-25 09:28:49,855 INFO ]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2018-06-25 09:28:49,855 INFO ]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 125 [2018-06-25 09:28:49,855 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:49,855 INFO ]: Abstraction has 121 states and 173 transitions. [2018-06-25 09:28:49,855 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:28:49,855 INFO ]: Start isEmpty. Operand 121 states and 173 transitions. [2018-06-25 09:28:49,856 INFO ]: Finished isEmpty. Found accepting run of length 144 [2018-06-25 09:28:49,856 INFO ]: Found error trace [2018-06-25 09:28:49,856 INFO ]: trace histogram [15, 15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:49,856 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:49,858 INFO ]: Analyzing trace with hash 788323019, now seen corresponding path program 13 times [2018-06-25 09:28:49,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:49,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:49,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:49,858 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:49,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:49,875 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:50,861 INFO ]: Checked inductivity of 728 backedges. 300 proven. 85 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-06-25 09:28:50,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:50,862 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:50,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:50,924 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:50,930 INFO ]: Computing forward predicates... [2018-06-25 09:28:51,977 INFO ]: Checked inductivity of 728 backedges. 339 proven. 34 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-06-25 09:28:52,002 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:52,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 25 [2018-06-25 09:28:52,002 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:28:52,002 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:28:52,002 INFO ]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:28:52,002 INFO ]: Start difference. First operand 121 states and 173 transitions. Second operand 25 states. [2018-06-25 09:28:52,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:52,682 INFO ]: Finished difference Result 279 states and 613 transitions. [2018-06-25 09:28:52,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-25 09:28:52,683 INFO ]: Start accepts. Automaton has 25 states. Word has length 143 [2018-06-25 09:28:52,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:52,684 INFO ]: With dead ends: 279 [2018-06-25 09:28:52,684 INFO ]: Without dead ends: 279 [2018-06-25 09:28:52,685 INFO ]: 0 DeclaredPredicates, 224 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=604, Invalid=3178, Unknown=0, NotChecked=0, Total=3782 [2018-06-25 09:28:52,685 INFO ]: Start minimizeSevpa. Operand 279 states. [2018-06-25 09:28:52,718 INFO ]: Finished minimizeSevpa. Reduced states from 279 to 124. [2018-06-25 09:28:52,718 INFO ]: Start removeUnreachable. Operand 124 states. [2018-06-25 09:28:52,718 INFO ]: Finished removeUnreachable. Reduced from 124 states to 124 states and 179 transitions. [2018-06-25 09:28:52,718 INFO ]: Start accepts. Automaton has 124 states and 179 transitions. Word has length 143 [2018-06-25 09:28:52,719 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:52,719 INFO ]: Abstraction has 124 states and 179 transitions. [2018-06-25 09:28:52,719 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:28:52,719 INFO ]: Start isEmpty. Operand 124 states and 179 transitions. [2018-06-25 09:28:52,720 INFO ]: Finished isEmpty. Found accepting run of length 144 [2018-06-25 09:28:52,720 INFO ]: Found error trace [2018-06-25 09:28:52,720 INFO ]: trace histogram [15, 15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:52,720 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:52,720 INFO ]: Analyzing trace with hash -999546803, now seen corresponding path program 12 times [2018-06-25 09:28:52,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:52,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:52,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:52,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:28:52,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:52,739 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:53,298 INFO ]: Checked inductivity of 728 backedges. 306 proven. 85 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-06-25 09:28:53,298 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:53,298 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:53,304 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:28:53,368 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-25 09:28:53,368 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:53,373 INFO ]: Computing forward predicates... [2018-06-25 09:28:53,778 INFO ]: Checked inductivity of 728 backedges. 339 proven. 34 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-06-25 09:28:53,810 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:53,810 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 25 [2018-06-25 09:28:53,810 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:28:53,811 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:28:53,811 INFO ]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:28:53,811 INFO ]: Start difference. First operand 124 states and 179 transitions. Second operand 25 states. [2018-06-25 09:28:54,559 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:28:54,559 INFO ]: Finished difference Result 282 states and 619 transitions. [2018-06-25 09:28:54,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-25 09:28:54,559 INFO ]: Start accepts. Automaton has 25 states. Word has length 143 [2018-06-25 09:28:54,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:28:54,561 INFO ]: With dead ends: 282 [2018-06-25 09:28:54,561 INFO ]: Without dead ends: 282 [2018-06-25 09:28:54,561 INFO ]: 0 DeclaredPredicates, 224 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=604, Invalid=3178, Unknown=0, NotChecked=0, Total=3782 [2018-06-25 09:28:54,562 INFO ]: Start minimizeSevpa. Operand 282 states. [2018-06-25 09:28:54,581 INFO ]: Finished minimizeSevpa. Reduced states from 282 to 124. [2018-06-25 09:28:54,581 INFO ]: Start removeUnreachable. Operand 124 states. [2018-06-25 09:28:54,582 INFO ]: Finished removeUnreachable. Reduced from 124 states to 124 states and 179 transitions. [2018-06-25 09:28:54,582 INFO ]: Start accepts. Automaton has 124 states and 179 transitions. Word has length 143 [2018-06-25 09:28:54,582 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:28:54,582 INFO ]: Abstraction has 124 states and 179 transitions. [2018-06-25 09:28:54,582 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:28:54,582 INFO ]: Start isEmpty. Operand 124 states and 179 transitions. [2018-06-25 09:28:54,583 INFO ]: Finished isEmpty. Found accepting run of length 145 [2018-06-25 09:28:54,583 INFO ]: Found error trace [2018-06-25 09:28:54,583 INFO ]: trace histogram [15, 15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:28:54,583 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:28:54,584 INFO ]: Analyzing trace with hash -84719458, now seen corresponding path program 14 times [2018-06-25 09:28:54,584 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:28:54,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:28:54,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:54,584 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:28:54,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:28:54,607 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:55,559 INFO ]: Checked inductivity of 735 backedges. 48 proven. 344 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-06-25 09:28:55,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:28:55,559 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:28:55,565 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:28:55,658 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:28:55,658 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:28:55,665 INFO ]: Computing forward predicates... [2018-06-25 09:28:55,887 INFO ]: Checked inductivity of 735 backedges. 48 proven. 332 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-06-25 09:28:55,919 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:28:55,919 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 23 [2018-06-25 09:28:55,920 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:28:55,920 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:28:55,920 INFO ]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:28:55,920 INFO ]: Start difference. First operand 124 states and 179 transitions. Second operand 23 states. Received shutdown request... [2018-06-25 09:28:57,385 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-25 09:28:57,385 WARN ]: Verification canceled [2018-06-25 09:28:57,390 WARN ]: Timeout [2018-06-25 09:28:57,390 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:28:57 BoogieIcfgContainer [2018-06-25 09:28:57,390 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:28:57,391 INFO ]: Toolchain (without parser) took 54822.38 ms. Allocated memory was 297.8 MB in the beginning and 873.5 MB in the end (delta: 575.7 MB). Free memory was 250.3 MB in the beginning and 708.2 MB in the end (delta: -457.9 MB). Peak memory consumption was 117.8 MB. Max. memory is 3.6 GB. [2018-06-25 09:28:57,391 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 297.8 MB. Free memory is still 263.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:28:57,392 INFO ]: ChcToBoogie took 63.03 ms. Allocated memory is still 297.8 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:28:57,392 INFO ]: Boogie Preprocessor took 36.13 ms. Allocated memory is still 297.8 MB. Free memory was 248.3 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:28:57,392 INFO ]: RCFGBuilder took 322.01 ms. Allocated memory is still 297.8 MB. Free memory was 246.3 MB in the beginning and 237.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:28:57,392 INFO ]: TraceAbstraction took 54386.62 ms. Allocated memory was 297.8 MB in the beginning and 873.5 MB in the end (delta: 575.7 MB). Free memory was 237.3 MB in the beginning and 708.2 MB in the end (delta: -470.9 MB). Peak memory consumption was 104.8 MB. Max. memory is 3.6 GB. [2018-06-25 09:28:57,395 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 297.8 MB. Free memory is still 263.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.03 ms. Allocated memory is still 297.8 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 36.13 ms. Allocated memory is still 297.8 MB. Free memory was 248.3 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 322.01 ms. Allocated memory is still 297.8 MB. Free memory was 246.3 MB in the beginning and 237.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54386.62 ms. Allocated memory was 297.8 MB in the beginning and 873.5 MB in the end (delta: 575.7 MB). Free memory was 237.3 MB in the beginning and 708.2 MB in the end (delta: -470.9 MB). Peak memory consumption was 104.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (124states) and interpolant automaton (currently 44 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. TIMEOUT Result, 54.3s OverallTime, 33 OverallIterations, 15 TraceHistogramMax, 32.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3783 SDtfs, 5912 SDslu, 25384 SDs, 0 SdLazy, 23508 SolverSat, 5663 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3785 GetRequests, 2421 SyntacticMatches, 181 SemanticMatches, 1182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14020 ImplicationChecksByTransitivity, 27.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 32 MinimizatonAttempts, 3104 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 4693 NumberOfCodeBlocks, 4685 NumberOfCodeBlocksAsserted, 158 NumberOfCheckSat, 4632 ConstructedInterpolants, 0 QuantifiedInterpolants, 1629776 SizeOfPredicates, 370 NumberOfNonLiveVariables, 9408 ConjunctsInSsa, 1394 ConjunctsInUnsatCore, 61 InterpolantComputations, 5 PerfectInterpolantSequences, 11647/15523 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-28-57-404.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-28-57-404.csv Completed graceful shutdown