java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.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/file.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:21:41,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:21:41,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:21:41,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:21:41,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:21:41,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:21:41,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:21:41,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:21:41,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:21:41,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:21:41,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:21:41,618 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:21:41,619 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:21:41,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:21:41,620 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:21:41,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:21:41,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:21:41,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:21:41,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:21:41,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:21:41,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:21:41,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:21:41,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:21:41,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:21:41,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:21:41,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:21:41,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:21:41,647 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:21:41,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:21:41,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:21:41,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:21:41,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:21:41,650 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:21:41,650 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:21:41,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:21:41,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:21:41,652 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:21:41,670 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:21:41,670 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:21:41,673 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:21:41,673 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:21:41,674 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:21:41,674 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:21:41,674 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:21:41,674 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:21:41,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:21:41,675 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:21:41,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:21:41,675 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:21:41,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:21:41,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:21:41,676 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:21:41,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:21:41,676 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:21:41,676 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:21:41,676 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:21:41,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:21:41,677 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:21:41,679 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:21:41,679 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:21:41,723 INFO ]: Repository-Root is: /tmp [2018-06-26 18:21:41,739 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:21:41,744 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:21:41,746 INFO ]: Initializing SmtParser... [2018-06-26 18:21:41,747 INFO ]: SmtParser initialized [2018-06-26 18:21:41,748 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/file.smt2 [2018-06-26 18:21:41,749 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-26 18:21:41,835 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/file.smt2 unknown [2018-06-26 18:21:42,190 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/file.smt2 [2018-06-26 18:21:42,204 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:21:42,211 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:21:42,212 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:21:42,212 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:21:42,218 INFO ]: ChcToBoogie initialized [2018-06-26 18:21:42,222 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:21:42" (1/1) ... [2018-06-26 18:21:42,284 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:21:42 Unit [2018-06-26 18:21:42,285 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:21:42,285 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:21:42,285 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:21:42,285 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:21:42,311 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:21:42" (1/1) ... [2018-06-26 18:21:42,311 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:21:42" (1/1) ... [2018-06-26 18:21:42,318 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:21:42" (1/1) ... [2018-06-26 18:21:42,319 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:21:42" (1/1) ... [2018-06-26 18:21:42,325 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:21:42" (1/1) ... [2018-06-26 18:21:42,328 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:21:42" (1/1) ... [2018-06-26 18:21:42,329 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:21:42" (1/1) ... [2018-06-26 18:21:42,331 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:21:42,332 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:21:42,332 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:21:42,332 INFO ]: RCFGBuilder initialized [2018-06-26 18:21:42,333 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:21:42" (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-26 18:21:42,353 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:21:42,353 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:21:42,353 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:21:42,353 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:21:42,353 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:21:42,353 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-26 18:21:42,806 INFO ]: Using library mode [2018-06-26 18:21:42,807 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:21:42 BoogieIcfgContainer [2018-06-26 18:21:42,807 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:21:42,807 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:21:42,807 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:21:42,808 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:21:42,809 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:21:42" (1/1) ... [2018-06-26 18:21:42,834 INFO ]: Initial Icfg 40 locations, 66 edges [2018-06-26 18:21:42,835 INFO ]: Using Remove infeasible edges [2018-06-26 18:21:42,835 INFO ]: Using Maximize final states [2018-06-26 18:21:42,836 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:21:42,836 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:21:42,838 INFO ]: Using Remove sink states [2018-06-26 18:21:42,838 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:21:42,838 INFO ]: Using Use SBE [2018-06-26 18:21:42,848 INFO ]: SBE split 0 edges [2018-06-26 18:21:42,854 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 18:21:42,856 INFO ]: 0 new accepting states [2018-06-26 18:21:43,251 INFO ]: Removed 48 edges and 13 locations by large block encoding [2018-06-26 18:21:43,253 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:21:43,257 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:21:43,257 INFO ]: 0 new accepting states [2018-06-26 18:21:43,257 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:21:43,258 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:21:43,258 INFO ]: Encoded RCFG 25 locations, 51 edges [2018-06-26 18:21:43,258 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:21:43 BasicIcfg [2018-06-26 18:21:43,258 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:21:43,259 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:21:43,259 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:21:43,265 INFO ]: TraceAbstraction initialized [2018-06-26 18:21:43,265 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:21:42" (1/4) ... [2018-06-26 18:21:43,266 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713617c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:21:43, skipping insertion in model container [2018-06-26 18:21:43,267 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:21:42" (2/4) ... [2018-06-26 18:21:43,267 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713617c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:21:43, skipping insertion in model container [2018-06-26 18:21:43,267 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:21:42" (3/4) ... [2018-06-26 18:21:43,267 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713617c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:21:43, skipping insertion in model container [2018-06-26 18:21:43,267 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:21:43" (4/4) ... [2018-06-26 18:21:43,269 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:21:43,281 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:21:43,295 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:21:43,337 INFO ]: Using default assertion order modulation [2018-06-26 18:21:43,337 INFO ]: Interprodecural is true [2018-06-26 18:21:43,337 INFO ]: Hoare is false [2018-06-26 18:21:43,337 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:21:43,337 INFO ]: Backedges is TWOTRACK [2018-06-26 18:21:43,337 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:21:43,337 INFO ]: Difference is false [2018-06-26 18:21:43,337 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:21:43,338 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:21:43,350 INFO ]: Start isEmpty. Operand 25 states. [2018-06-26 18:21:43,361 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 18:21:43,361 INFO ]: Found error trace [2018-06-26 18:21:43,362 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 18:21:43,362 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:43,367 INFO ]: Analyzing trace with hash 1272226, now seen corresponding path program 1 times [2018-06-26 18:21:43,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:43,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:43,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:43,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:43,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:43,437 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:43,495 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:21:43,497 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:21:43,497 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:21:43,498 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:21:43,510 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:21:43,511 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:21:43,512 INFO ]: Start difference. First operand 25 states. Second operand 3 states. [2018-06-26 18:21:44,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:44,121 INFO ]: Finished difference Result 46 states and 92 transitions. [2018-06-26 18:21:44,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:21:44,122 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 18:21:44,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:44,136 INFO ]: With dead ends: 46 [2018-06-26 18:21:44,136 INFO ]: Without dead ends: 45 [2018-06-26 18:21:44,138 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:21:44,153 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 18:21:44,185 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-26 18:21:44,186 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 18:21:44,192 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 89 transitions. [2018-06-26 18:21:44,194 INFO ]: Start accepts. Automaton has 45 states and 89 transitions. Word has length 4 [2018-06-26 18:21:44,195 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:44,195 INFO ]: Abstraction has 45 states and 89 transitions. [2018-06-26 18:21:44,195 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:21:44,195 INFO ]: Start isEmpty. Operand 45 states and 89 transitions. [2018-06-26 18:21:44,199 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 18:21:44,199 INFO ]: Found error trace [2018-06-26 18:21:44,199 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 18:21:44,199 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:44,200 INFO ]: Analyzing trace with hash 1273187, now seen corresponding path program 1 times [2018-06-26 18:21:44,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:44,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:44,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:44,200 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:44,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:44,210 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:44,270 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:21:44,270 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:21:44,270 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:21:44,272 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:21:44,272 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:21:44,272 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:21:44,272 INFO ]: Start difference. First operand 45 states and 89 transitions. Second operand 3 states. [2018-06-26 18:21:44,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:44,725 INFO ]: Finished difference Result 66 states and 158 transitions. [2018-06-26 18:21:44,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:21:44,725 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 18:21:44,725 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:44,734 INFO ]: With dead ends: 66 [2018-06-26 18:21:44,734 INFO ]: Without dead ends: 66 [2018-06-26 18:21:44,735 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:21:44,735 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-26 18:21:44,752 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-06-26 18:21:44,752 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-26 18:21:44,756 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 140 transitions. [2018-06-26 18:21:44,756 INFO ]: Start accepts. Automaton has 65 states and 140 transitions. Word has length 4 [2018-06-26 18:21:44,756 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:44,756 INFO ]: Abstraction has 65 states and 140 transitions. [2018-06-26 18:21:44,756 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:21:44,756 INFO ]: Start isEmpty. Operand 65 states and 140 transitions. [2018-06-26 18:21:44,757 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 18:21:44,757 INFO ]: Found error trace [2018-06-26 18:21:44,757 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 18:21:44,757 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:44,757 INFO ]: Analyzing trace with hash 1277992, now seen corresponding path program 1 times [2018-06-26 18:21:44,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:44,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:44,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:44,758 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:44,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:44,766 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:44,829 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:21:44,830 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:21:44,830 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:21:44,830 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:21:44,830 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:21:44,830 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:21:44,830 INFO ]: Start difference. First operand 65 states and 140 transitions. Second operand 3 states. [2018-06-26 18:21:45,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:45,272 INFO ]: Finished difference Result 87 states and 187 transitions. [2018-06-26 18:21:45,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:21:45,273 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 18:21:45,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:45,278 INFO ]: With dead ends: 87 [2018-06-26 18:21:45,278 INFO ]: Without dead ends: 87 [2018-06-26 18:21:45,278 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:21:45,278 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-26 18:21:45,294 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-06-26 18:21:45,294 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-26 18:21:45,297 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 183 transitions. [2018-06-26 18:21:45,298 INFO ]: Start accepts. Automaton has 86 states and 183 transitions. Word has length 4 [2018-06-26 18:21:45,298 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:45,298 INFO ]: Abstraction has 86 states and 183 transitions. [2018-06-26 18:21:45,298 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:21:45,298 INFO ]: Start isEmpty. Operand 86 states and 183 transitions. [2018-06-26 18:21:45,299 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:21:45,299 INFO ]: Found error trace [2018-06-26 18:21:45,299 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:21:45,299 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:45,299 INFO ]: Analyzing trace with hash 39195208, now seen corresponding path program 1 times [2018-06-26 18:21:45,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:45,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:45,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:45,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:45,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:45,306 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:45,360 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:21:45,361 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:21:45,361 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:21:45,361 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:21:45,361 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:21:45,361 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:21:45,361 INFO ]: Start difference. First operand 86 states and 183 transitions. Second operand 3 states. [2018-06-26 18:21:45,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:45,658 INFO ]: Finished difference Result 107 states and 220 transitions. [2018-06-26 18:21:45,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:21:45,658 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:21:45,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:45,662 INFO ]: With dead ends: 107 [2018-06-26 18:21:45,662 INFO ]: Without dead ends: 107 [2018-06-26 18:21:45,662 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:21:45,662 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-26 18:21:45,679 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-06-26 18:21:45,679 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-26 18:21:45,683 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 220 transitions. [2018-06-26 18:21:45,683 INFO ]: Start accepts. Automaton has 107 states and 220 transitions. Word has length 5 [2018-06-26 18:21:45,684 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:45,684 INFO ]: Abstraction has 107 states and 220 transitions. [2018-06-26 18:21:45,684 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:21:45,684 INFO ]: Start isEmpty. Operand 107 states and 220 transitions. [2018-06-26 18:21:45,689 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:21:45,689 INFO ]: Found error trace [2018-06-26 18:21:45,689 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:45,689 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:45,689 INFO ]: Analyzing trace with hash -552321911, now seen corresponding path program 1 times [2018-06-26 18:21:45,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:45,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:45,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:45,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:45,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:45,702 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:45,842 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:21:45,842 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:21:45,842 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:21:45,843 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:21:45,843 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:21:45,843 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:21:45,843 INFO ]: Start difference. First operand 107 states and 220 transitions. Second operand 4 states. [2018-06-26 18:21:46,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:46,504 INFO ]: Finished difference Result 310 states and 880 transitions. [2018-06-26 18:21:46,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:21:46,504 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-26 18:21:46,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:46,519 INFO ]: With dead ends: 310 [2018-06-26 18:21:46,519 INFO ]: Without dead ends: 289 [2018-06-26 18:21:46,519 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-26 18:21:46,520 INFO ]: Start minimizeSevpa. Operand 289 states. [2018-06-26 18:21:46,581 INFO ]: Finished minimizeSevpa. Reduced states from 289 to 153. [2018-06-26 18:21:46,581 INFO ]: Start removeUnreachable. Operand 153 states. [2018-06-26 18:21:46,585 INFO ]: Finished removeUnreachable. Reduced from 153 states to 153 states and 347 transitions. [2018-06-26 18:21:46,585 INFO ]: Start accepts. Automaton has 153 states and 347 transitions. Word has length 13 [2018-06-26 18:21:46,585 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:46,585 INFO ]: Abstraction has 153 states and 347 transitions. [2018-06-26 18:21:46,585 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:21:46,585 INFO ]: Start isEmpty. Operand 153 states and 347 transitions. [2018-06-26 18:21:46,588 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:21:46,588 INFO ]: Found error trace [2018-06-26 18:21:46,588 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:46,588 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:46,588 INFO ]: Analyzing trace with hash -466434458, now seen corresponding path program 1 times [2018-06-26 18:21:46,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:46,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:46,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:46,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:46,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:46,600 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:46,657 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:21:46,657 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:21:46,657 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:21:46,657 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:21:46,658 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:21:46,658 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:21:46,658 INFO ]: Start difference. First operand 153 states and 347 transitions. Second operand 4 states. [2018-06-26 18:21:47,043 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:47,043 INFO ]: Finished difference Result 299 states and 944 transitions. [2018-06-26 18:21:47,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:21:47,044 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-26 18:21:47,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:47,058 INFO ]: With dead ends: 299 [2018-06-26 18:21:47,058 INFO ]: Without dead ends: 299 [2018-06-26 18:21:47,058 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:21:47,058 INFO ]: Start minimizeSevpa. Operand 299 states. [2018-06-26 18:21:47,118 INFO ]: Finished minimizeSevpa. Reduced states from 299 to 160. [2018-06-26 18:21:47,118 INFO ]: Start removeUnreachable. Operand 160 states. [2018-06-26 18:21:47,126 INFO ]: Finished removeUnreachable. Reduced from 160 states to 160 states and 413 transitions. [2018-06-26 18:21:47,126 INFO ]: Start accepts. Automaton has 160 states and 413 transitions. Word has length 13 [2018-06-26 18:21:47,126 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:47,126 INFO ]: Abstraction has 160 states and 413 transitions. [2018-06-26 18:21:47,126 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:21:47,126 INFO ]: Start isEmpty. Operand 160 states and 413 transitions. [2018-06-26 18:21:47,129 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:21:47,130 INFO ]: Found error trace [2018-06-26 18:21:47,131 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:47,131 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:47,131 INFO ]: Analyzing trace with hash -351917854, now seen corresponding path program 1 times [2018-06-26 18:21:47,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:47,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:47,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:47,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:47,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:47,156 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:47,300 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:21:47,300 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:21:47,519 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:21:47,519 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:21:47,520 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:21:47,520 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:21:47,520 INFO ]: Start difference. First operand 160 states and 413 transitions. Second operand 4 states. [2018-06-26 18:21:48,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:48,155 INFO ]: Finished difference Result 302 states and 1025 transitions. [2018-06-26 18:21:48,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:21:48,156 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-26 18:21:48,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:48,170 INFO ]: With dead ends: 302 [2018-06-26 18:21:48,170 INFO ]: Without dead ends: 302 [2018-06-26 18:21:48,170 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:21:48,171 INFO ]: Start minimizeSevpa. Operand 302 states. [2018-06-26 18:21:48,216 INFO ]: Finished minimizeSevpa. Reduced states from 302 to 164. [2018-06-26 18:21:48,216 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-26 18:21:48,220 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 474 transitions. [2018-06-26 18:21:48,220 INFO ]: Start accepts. Automaton has 164 states and 474 transitions. Word has length 13 [2018-06-26 18:21:48,220 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:48,220 INFO ]: Abstraction has 164 states and 474 transitions. [2018-06-26 18:21:48,220 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:21:48,220 INFO ]: Start isEmpty. Operand 164 states and 474 transitions. [2018-06-26 18:21:48,222 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:21:48,222 INFO ]: Found error trace [2018-06-26 18:21:48,222 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:48,222 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:48,223 INFO ]: Analyzing trace with hash -1355111888, now seen corresponding path program 1 times [2018-06-26 18:21:48,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:48,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:48,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:48,223 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:48,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:48,229 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:48,295 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:21:48,295 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:21:48,295 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:21:48,296 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:21:48,296 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:21:48,296 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:21:48,296 INFO ]: Start difference. First operand 164 states and 474 transitions. Second operand 3 states. [2018-06-26 18:21:48,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:48,432 INFO ]: Finished difference Result 189 states and 547 transitions. [2018-06-26 18:21:48,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:21:48,432 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 18:21:48,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:48,438 INFO ]: With dead ends: 189 [2018-06-26 18:21:48,438 INFO ]: Without dead ends: 189 [2018-06-26 18:21:48,438 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:21:48,438 INFO ]: Start minimizeSevpa. Operand 189 states. [2018-06-26 18:21:48,458 INFO ]: Finished minimizeSevpa. Reduced states from 189 to 168. [2018-06-26 18:21:48,458 INFO ]: Start removeUnreachable. Operand 168 states. [2018-06-26 18:21:48,461 INFO ]: Finished removeUnreachable. Reduced from 168 states to 168 states and 482 transitions. [2018-06-26 18:21:48,461 INFO ]: Start accepts. Automaton has 168 states and 482 transitions. Word has length 14 [2018-06-26 18:21:48,461 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:48,461 INFO ]: Abstraction has 168 states and 482 transitions. [2018-06-26 18:21:48,461 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:21:48,461 INFO ]: Start isEmpty. Operand 168 states and 482 transitions. [2018-06-26 18:21:48,466 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:21:48,466 INFO ]: Found error trace [2018-06-26 18:21:48,466 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:48,466 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:48,466 INFO ]: Analyzing trace with hash -538287360, now seen corresponding path program 1 times [2018-06-26 18:21:48,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:48,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:48,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:48,467 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:48,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:48,480 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:48,665 INFO ]: Checked inductivity of 32 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:21:48,666 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:48,666 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-26 18:21:48,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:48,724 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:48,733 INFO ]: Computing forward predicates... [2018-06-26 18:21:48,931 INFO ]: Checked inductivity of 32 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:21:48,956 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:48,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-26 18:21:48,957 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:21:48,957 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:21:48,957 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:21:48,957 INFO ]: Start difference. First operand 168 states and 482 transitions. Second operand 9 states. [2018-06-26 18:21:53,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:53,506 INFO ]: Finished difference Result 658 states and 2427 transitions. [2018-06-26 18:21:53,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 18:21:53,506 INFO ]: Start accepts. Automaton has 9 states. Word has length 26 [2018-06-26 18:21:53,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:53,545 INFO ]: With dead ends: 658 [2018-06-26 18:21:53,545 INFO ]: Without dead ends: 618 [2018-06-26 18:21:53,545 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 18:21:53,546 INFO ]: Start minimizeSevpa. Operand 618 states. [2018-06-26 18:21:53,671 INFO ]: Finished minimizeSevpa. Reduced states from 618 to 302. [2018-06-26 18:21:53,671 INFO ]: Start removeUnreachable. Operand 302 states. [2018-06-26 18:21:53,677 INFO ]: Finished removeUnreachable. Reduced from 302 states to 302 states and 886 transitions. [2018-06-26 18:21:53,677 INFO ]: Start accepts. Automaton has 302 states and 886 transitions. Word has length 26 [2018-06-26 18:21:53,677 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:53,677 INFO ]: Abstraction has 302 states and 886 transitions. [2018-06-26 18:21:53,677 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:21:53,678 INFO ]: Start isEmpty. Operand 302 states and 886 transitions. [2018-06-26 18:21:53,685 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:21:53,685 INFO ]: Found error trace [2018-06-26 18:21:53,685 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:53,685 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:53,685 INFO ]: Analyzing trace with hash -1715182053, now seen corresponding path program 1 times [2018-06-26 18:21:53,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:53,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:53,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:53,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:53,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:53,720 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:53,822 INFO ]: Checked inductivity of 44 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 18:21:53,823 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:53,823 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:21:53,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:53,861 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:53,863 INFO ]: Computing forward predicates... [2018-06-26 18:21:53,949 INFO ]: Checked inductivity of 44 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 18:21:53,982 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:53,982 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-06-26 18:21:53,982 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:21:53,982 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:21:53,982 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:21:53,983 INFO ]: Start difference. First operand 302 states and 886 transitions. Second operand 14 states. [2018-06-26 18:22:04,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:22:04,220 INFO ]: Finished difference Result 2199 states and 11679 transitions. [2018-06-26 18:22:04,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-06-26 18:22:04,221 INFO ]: Start accepts. Automaton has 14 states. Word has length 30 [2018-06-26 18:22:04,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:22:04,483 INFO ]: With dead ends: 2199 [2018-06-26 18:22:04,483 INFO ]: Without dead ends: 2194 [2018-06-26 18:22:04,486 INFO ]: 0 DeclaredPredicates, 165 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4652 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1599, Invalid=11283, Unknown=0, NotChecked=0, Total=12882 [2018-06-26 18:22:04,487 INFO ]: Start minimizeSevpa. Operand 2194 states. [2018-06-26 18:22:05,109 INFO ]: Finished minimizeSevpa. Reduced states from 2194 to 714. [2018-06-26 18:22:05,109 INFO ]: Start removeUnreachable. Operand 714 states. [2018-06-26 18:22:05,126 INFO ]: Finished removeUnreachable. Reduced from 714 states to 714 states and 2365 transitions. [2018-06-26 18:22:05,126 INFO ]: Start accepts. Automaton has 714 states and 2365 transitions. Word has length 30 [2018-06-26 18:22:05,126 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:22:05,126 INFO ]: Abstraction has 714 states and 2365 transitions. [2018-06-26 18:22:05,126 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:22:05,126 INFO ]: Start isEmpty. Operand 714 states and 2365 transitions. [2018-06-26 18:22:05,132 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:22:05,132 INFO ]: Found error trace [2018-06-26 18:22:05,132 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:22:05,132 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:22:05,134 INFO ]: Analyzing trace with hash 756399136, now seen corresponding path program 1 times [2018-06-26 18:22:05,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:22:05,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:22:05,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:22:05,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:22:05,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:22:05,148 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:22:05,719 INFO ]: Checked inductivity of 44 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-26 18:22:05,719 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:22:05,719 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-26 18:22:05,730 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:22:05,777 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:22:05,780 INFO ]: Computing forward predicates... [2018-06-26 18:22:06,053 INFO ]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:22:06,073 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:22:06,073 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-26 18:22:06,073 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:22:06,073 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:22:06,073 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:22:06,073 INFO ]: Start difference. First operand 714 states and 2365 transitions. Second operand 10 states. [2018-06-26 18:22:09,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:22:09,367 INFO ]: Finished difference Result 3019 states and 26124 transitions. [2018-06-26 18:22:09,367 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 18:22:09,367 INFO ]: Start accepts. Automaton has 10 states. Word has length 30 [2018-06-26 18:22:09,367 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:22:09,694 INFO ]: With dead ends: 3019 [2018-06-26 18:22:09,694 INFO ]: Without dead ends: 3019 [2018-06-26 18:22:09,694 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:22:09,696 INFO ]: Start minimizeSevpa. Operand 3019 states. [2018-06-26 18:22:11,051 INFO ]: Finished minimizeSevpa. Reduced states from 3019 to 949. [2018-06-26 18:22:11,051 INFO ]: Start removeUnreachable. Operand 949 states. [2018-06-26 18:22:11,075 INFO ]: Finished removeUnreachable. Reduced from 949 states to 949 states and 3077 transitions. [2018-06-26 18:22:11,075 INFO ]: Start accepts. Automaton has 949 states and 3077 transitions. Word has length 30 [2018-06-26 18:22:11,075 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:22:11,075 INFO ]: Abstraction has 949 states and 3077 transitions. [2018-06-26 18:22:11,075 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:22:11,075 INFO ]: Start isEmpty. Operand 949 states and 3077 transitions. [2018-06-26 18:22:11,091 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:22:11,091 INFO ]: Found error trace [2018-06-26 18:22:11,091 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:22:11,091 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:22:11,091 INFO ]: Analyzing trace with hash 880484130, now seen corresponding path program 1 times [2018-06-26 18:22:11,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:22:11,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:22:11,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:22:11,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:22:11,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:22:11,107 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:22:11,463 INFO ]: Checked inductivity of 44 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 18:22:11,463 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:22:11,463 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-26 18:22:11,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:22:11,496 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:22:11,499 INFO ]: Computing forward predicates... [2018-06-26 18:22:11,657 INFO ]: Checked inductivity of 44 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 18:22:11,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:22:11,676 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-26 18:22:11,677 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:22:11,677 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:22:11,677 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:22:11,677 INFO ]: Start difference. First operand 949 states and 3077 transitions. Second operand 14 states. [2018-06-26 18:22:14,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:22:14,441 INFO ]: Finished difference Result 3038 states and 17422 transitions. [2018-06-26 18:22:14,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 18:22:14,442 INFO ]: Start accepts. Automaton has 14 states. Word has length 30 [2018-06-26 18:22:14,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:22:14,807 INFO ]: With dead ends: 3038 [2018-06-26 18:22:14,807 INFO ]: Without dead ends: 3038 [2018-06-26 18:22:14,807 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=382, Invalid=1510, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 18:22:14,810 INFO ]: Start minimizeSevpa. Operand 3038 states. [2018-06-26 18:22:15,865 INFO ]: Finished minimizeSevpa. Reduced states from 3038 to 1421. [2018-06-26 18:22:15,865 INFO ]: Start removeUnreachable. Operand 1421 states. [2018-06-26 18:22:15,927 INFO ]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 5704 transitions. [2018-06-26 18:22:15,927 INFO ]: Start accepts. Automaton has 1421 states and 5704 transitions. Word has length 30 [2018-06-26 18:22:15,927 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:22:15,927 INFO ]: Abstraction has 1421 states and 5704 transitions. [2018-06-26 18:22:15,927 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:22:15,927 INFO ]: Start isEmpty. Operand 1421 states and 5704 transitions. [2018-06-26 18:22:15,942 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:22:15,942 INFO ]: Found error trace [2018-06-26 18:22:15,943 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:22:15,943 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:22:15,944 INFO ]: Analyzing trace with hash -1906931357, now seen corresponding path program 1 times [2018-06-26 18:22:15,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:22:15,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:22:15,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:22:15,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:22:15,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:22:15,955 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:22:16,424 INFO ]: Checked inductivity of 44 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-26 18:22:16,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:22:16,425 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:22:16,432 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:22:16,463 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:22:16,465 INFO ]: Computing forward predicates... [2018-06-26 18:22:16,538 INFO ]: Checked inductivity of 44 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-26 18:22:16,567 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:22:16,567 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-26 18:22:16,567 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:22:16,568 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:22:16,568 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:22:16,568 INFO ]: Start difference. First operand 1421 states and 5704 transitions. Second operand 15 states. [2018-06-26 18:22:21,473 WARN ]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-26 18:22:26,260 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 18:22:31,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:22:31,110 INFO ]: Finished difference Result 7964 states and 87249 transitions. [2018-06-26 18:22:31,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-06-26 18:22:31,110 INFO ]: Start accepts. Automaton has 15 states. Word has length 30 [2018-06-26 18:22:31,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:22:33,715 INFO ]: With dead ends: 7964 [2018-06-26 18:22:33,715 INFO ]: Without dead ends: 7964 [2018-06-26 18:22:33,717 INFO ]: 0 DeclaredPredicates, 164 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4510 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1437, Invalid=11445, Unknown=0, NotChecked=0, Total=12882 [2018-06-26 18:22:33,720 INFO ]: Start minimizeSevpa. Operand 7964 states. [2018-06-26 18:22:36,654 INFO ]: Finished minimizeSevpa. Reduced states from 7964 to 2305. [2018-06-26 18:22:36,654 INFO ]: Start removeUnreachable. Operand 2305 states. [2018-06-26 18:22:36,721 INFO ]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8231 transitions. [2018-06-26 18:22:36,721 INFO ]: Start accepts. Automaton has 2305 states and 8231 transitions. Word has length 30 [2018-06-26 18:22:36,721 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:22:36,721 INFO ]: Abstraction has 2305 states and 8231 transitions. [2018-06-26 18:22:36,721 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:22:36,721 INFO ]: Start isEmpty. Operand 2305 states and 8231 transitions. [2018-06-26 18:22:36,791 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-26 18:22:36,791 INFO ]: Found error trace [2018-06-26 18:22:36,791 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:22:36,791 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:22:36,791 INFO ]: Analyzing trace with hash -118996974, now seen corresponding path program 1 times [2018-06-26 18:22:36,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:22:36,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:22:36,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:22:36,792 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:22:36,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:22:36,806 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:22:37,070 INFO ]: Checked inductivity of 99 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-06-26 18:22:37,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:22:37,070 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-26 18:22:37,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:22:37,148 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:22:37,152 INFO ]: Computing forward predicates... [2018-06-26 18:22:37,370 INFO ]: Checked inductivity of 99 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-06-26 18:22:37,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:22:37,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-26 18:22:37,392 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:22:37,393 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:22:37,393 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:22:37,393 INFO ]: Start difference. First operand 2305 states and 8231 transitions. Second operand 10 states. [2018-06-26 18:22:39,000 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 Received shutdown request... [2018-06-26 18:22:39,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-26 18:22:39,099 WARN ]: Verification canceled [2018-06-26 18:22:39,303 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:22:39,305 WARN ]: Timeout [2018-06-26 18:22:39,305 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:22:39 BasicIcfg [2018-06-26 18:22:39,305 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:22:39,306 INFO ]: Toolchain (without parser) took 57101.88 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 256.6 MB in the beginning and 1.2 GB in the end (delta: -989.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 18:22:39,307 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:22:39,307 INFO ]: ChcToBoogie took 72.59 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 252.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:22:39,308 INFO ]: Boogie Preprocessor took 45.92 ms. Allocated memory is still 306.2 MB. Free memory is still 252.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:22:39,308 INFO ]: RCFGBuilder took 475.32 ms. Allocated memory is still 306.2 MB. Free memory was 252.6 MB in the beginning and 236.6 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:22:39,309 INFO ]: BlockEncodingV2 took 451.09 ms. Allocated memory is still 306.2 MB. Free memory was 234.6 MB in the beginning and 220.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:22:39,309 INFO ]: TraceAbstraction took 56045.94 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 220.6 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-26 18:22:39,311 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 40 locations, 66 edges - StatisticsResult: Encoded RCFG 25 locations, 51 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 72.59 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 252.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.92 ms. Allocated memory is still 306.2 MB. Free memory is still 252.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 475.32 ms. Allocated memory is still 306.2 MB. Free memory was 252.6 MB in the beginning and 236.6 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 451.09 ms. Allocated memory is still 306.2 MB. Free memory was 234.6 MB in the beginning and 220.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56045.94 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 220.6 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. 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 Cancelled while BasicCegarLoop was constructing difference of abstraction (2305states) and interpolant automaton (currently 49 states, 10 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 51 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. TIMEOUT Result, 55.9s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 44.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4337 SDtfs, 1739 SDslu, 16846 SDs, 0 SdLazy, 36008 SolverSat, 11347 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 394 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11003 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2305occurred in iteration=13, 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: 6.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 11578 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 19175 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1687 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 566/638 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/file.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-22-39-321.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/file.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-22-39-321.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/file.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-22-39-321.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/file.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-22-39-321.csv Completed graceful shutdown