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/eldarica-misc/LIA/reve/022b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:07:44,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:07:44,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:07:44,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:07:44,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:07:44,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:07:44,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:07:44,610 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:07:44,612 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:07:44,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:07:44,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:07:44,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:07:44,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:07:44,616 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:07:44,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:07:44,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:07:44,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:07:44,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:07:44,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:07:44,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:07:44,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:07:44,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:07:44,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:07:44,637 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:07:44,641 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:07:44,642 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:07:44,642 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:07:44,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:07:44,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:07:44,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:07:44,648 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:07:44,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:07:44,649 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:07:44,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:07:44,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:07:44,650 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:07:44,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:07:44,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:07:44,672 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:07:44,672 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:07:44,673 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:07:44,673 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:07:44,674 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:07:44,674 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:07:44,674 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:07:44,674 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:07:44,674 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:07:44,675 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:07:44,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:07:44,675 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:07:44,675 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:07:44,675 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:07:44,676 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:07:44,676 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:07:44,676 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:07:44,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:07:44,676 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:07:44,678 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:07:44,679 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:07:44,723 INFO ]: Repository-Root is: /tmp [2018-06-24 21:07:44,741 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:07:44,745 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:07:44,746 INFO ]: Initializing SmtParser... [2018-06-24 21:07:44,746 INFO ]: SmtParser initialized [2018-06-24 21:07:44,746 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/022b-horn.smt2 [2018-06-24 21:07:44,747 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-24 21:07:44,810 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022b-horn.smt2 unknown [2018-06-24 21:07:45,058 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022b-horn.smt2 [2018-06-24 21:07:45,062 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:07:45,066 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:07:45,067 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:07:45,067 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:07:45,067 INFO ]: ChcToBoogie initialized [2018-06-24 21:07:45,070 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:07:45" (1/1) ... [2018-06-24 21:07:45,140 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:07:45 Unit [2018-06-24 21:07:45,140 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:07:45,141 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:07:45,141 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:07:45,141 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:07:45,160 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:07:45" (1/1) ... [2018-06-24 21:07:45,160 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:07:45" (1/1) ... [2018-06-24 21:07:45,166 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:07:45" (1/1) ... [2018-06-24 21:07:45,166 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:07:45" (1/1) ... [2018-06-24 21:07:45,172 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:07:45" (1/1) ... [2018-06-24 21:07:45,175 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:07:45" (1/1) ... [2018-06-24 21:07:45,176 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:07:45" (1/1) ... [2018-06-24 21:07:45,178 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:07:45,179 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:07:45,179 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:07:45,179 INFO ]: RCFGBuilder initialized [2018-06-24 21:07:45,181 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:07:45" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:07:45,195 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:07:45,195 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:07:45,195 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:07:45,196 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:07:45,196 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:07:45,196 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 21:07:45,719 INFO ]: Using library mode [2018-06-24 21:07:45,720 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:07:45 BoogieIcfgContainer [2018-06-24 21:07:45,720 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:07:45,720 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:07:45,720 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:07:45,721 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:07:45,723 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:07:45" (1/1) ... [2018-06-24 21:07:45,752 INFO ]: Initial Icfg 31 locations, 48 edges [2018-06-24 21:07:45,753 INFO ]: Using Remove infeasible edges [2018-06-24 21:07:45,755 INFO ]: Using Maximize final states [2018-06-24 21:07:45,756 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:07:45,756 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:07:45,758 INFO ]: Using Remove sink states [2018-06-24 21:07:45,758 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:07:45,758 INFO ]: Using Use SBE [2018-06-24 21:07:45,772 INFO ]: SBE split 0 edges [2018-06-24 21:07:45,781 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:07:45,783 INFO ]: 0 new accepting states [2018-06-24 21:07:46,025 INFO ]: Removed 18 edges and 6 locations by large block encoding [2018-06-24 21:07:46,027 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:07:46,029 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:07:46,029 INFO ]: 0 new accepting states [2018-06-24 21:07:46,031 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:07:46,032 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:07:46,032 INFO ]: Encoded RCFG 23 locations, 42 edges [2018-06-24 21:07:46,033 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:07:46 BasicIcfg [2018-06-24 21:07:46,033 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:07:46,034 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:07:46,034 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:07:46,037 INFO ]: TraceAbstraction initialized [2018-06-24 21:07:46,037 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:07:45" (1/4) ... [2018-06-24 21:07:46,038 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33efaa93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:07:46, skipping insertion in model container [2018-06-24 21:07:46,038 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:07:45" (2/4) ... [2018-06-24 21:07:46,039 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33efaa93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:07:46, skipping insertion in model container [2018-06-24 21:07:46,039 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:07:45" (3/4) ... [2018-06-24 21:07:46,039 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33efaa93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:07:46, skipping insertion in model container [2018-06-24 21:07:46,039 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:07:46" (4/4) ... [2018-06-24 21:07:46,042 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:07:46,049 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:07:46,066 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:07:46,106 INFO ]: Using default assertion order modulation [2018-06-24 21:07:46,106 INFO ]: Interprodecural is true [2018-06-24 21:07:46,106 INFO ]: Hoare is false [2018-06-24 21:07:46,106 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:07:46,106 INFO ]: Backedges is TWOTRACK [2018-06-24 21:07:46,106 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:07:46,106 INFO ]: Difference is false [2018-06-24 21:07:46,106 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:07:46,106 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:07:46,116 INFO ]: Start isEmpty. Operand 23 states. [2018-06-24 21:07:46,129 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:07:46,129 INFO ]: Found error trace [2018-06-24 21:07:46,130 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:07:46,130 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:46,135 INFO ]: Analyzing trace with hash 42175845, now seen corresponding path program 1 times [2018-06-24 21:07:46,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:46,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:46,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:46,171 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:46,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:46,216 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:46,284 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:07:46,286 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:07:46,286 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:07:46,287 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:07:46,298 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:07:46,298 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:07:46,300 INFO ]: Start difference. First operand 23 states. Second operand 3 states. [2018-06-24 21:07:46,626 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:46,627 INFO ]: Finished difference Result 43 states and 81 transitions. [2018-06-24 21:07:46,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:07:46,628 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:07:46,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:46,642 INFO ]: With dead ends: 43 [2018-06-24 21:07:46,642 INFO ]: Without dead ends: 43 [2018-06-24 21:07:46,644 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-24 21:07:46,659 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 21:07:46,690 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-24 21:07:46,691 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 21:07:46,694 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 81 transitions. [2018-06-24 21:07:46,695 INFO ]: Start accepts. Automaton has 43 states and 81 transitions. Word has length 5 [2018-06-24 21:07:46,697 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:46,697 INFO ]: Abstraction has 43 states and 81 transitions. [2018-06-24 21:07:46,697 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:07:46,697 INFO ]: Start isEmpty. Operand 43 states and 81 transitions. [2018-06-24 21:07:46,700 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:07:46,700 INFO ]: Found error trace [2018-06-24 21:07:46,700 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:07:46,700 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:46,700 INFO ]: Analyzing trace with hash 42265218, now seen corresponding path program 1 times [2018-06-24 21:07:46,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:46,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:46,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:46,701 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:46,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:46,713 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:46,776 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:07:46,776 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:07:46,776 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:07:46,778 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:07:46,778 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:07:46,778 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:07:46,778 INFO ]: Start difference. First operand 43 states and 81 transitions. Second operand 3 states. [2018-06-24 21:07:47,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:47,083 INFO ]: Finished difference Result 79 states and 151 transitions. [2018-06-24 21:07:47,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:07:47,085 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:07:47,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:47,089 INFO ]: With dead ends: 79 [2018-06-24 21:07:47,091 INFO ]: Without dead ends: 79 [2018-06-24 21:07:47,092 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-24 21:07:47,093 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-24 21:07:47,112 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 45. [2018-06-24 21:07:47,112 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 21:07:47,114 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 87 transitions. [2018-06-24 21:07:47,114 INFO ]: Start accepts. Automaton has 45 states and 87 transitions. Word has length 5 [2018-06-24 21:07:47,114 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:47,114 INFO ]: Abstraction has 45 states and 87 transitions. [2018-06-24 21:07:47,114 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:07:47,114 INFO ]: Start isEmpty. Operand 45 states and 87 transitions. [2018-06-24 21:07:47,119 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:07:47,119 INFO ]: Found error trace [2018-06-24 21:07:47,119 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:07:47,119 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:47,119 INFO ]: Analyzing trace with hash -398492364, now seen corresponding path program 1 times [2018-06-24 21:07:47,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:47,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:47,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:47,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:47,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:47,151 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:47,214 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:07:47,214 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:07:47,214 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:07:47,214 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:07:47,214 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:07:47,214 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:07:47,214 INFO ]: Start difference. First operand 45 states and 87 transitions. Second operand 3 states. [2018-06-24 21:07:47,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:47,353 INFO ]: Finished difference Result 81 states and 157 transitions. [2018-06-24 21:07:47,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:07:47,353 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 21:07:47,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:47,358 INFO ]: With dead ends: 81 [2018-06-24 21:07:47,358 INFO ]: Without dead ends: 81 [2018-06-24 21:07:47,358 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-24 21:07:47,359 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-24 21:07:47,371 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 45. [2018-06-24 21:07:47,371 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 21:07:47,372 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 87 transitions. [2018-06-24 21:07:47,372 INFO ]: Start accepts. Automaton has 45 states and 87 transitions. Word has length 11 [2018-06-24 21:07:47,372 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:47,373 INFO ]: Abstraction has 45 states and 87 transitions. [2018-06-24 21:07:47,373 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:07:47,373 INFO ]: Start isEmpty. Operand 45 states and 87 transitions. [2018-06-24 21:07:47,377 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:07:47,377 INFO ]: Found error trace [2018-06-24 21:07:47,377 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:07:47,377 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:47,377 INFO ]: Analyzing trace with hash 408543025, now seen corresponding path program 1 times [2018-06-24 21:07:47,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:47,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:47,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:47,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:47,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:47,407 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:47,613 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:07:47,614 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:07:47,614 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-24 21:07:47,629 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:47,687 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:47,695 INFO ]: Computing forward predicates... [2018-06-24 21:07:48,031 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:07:48,063 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:07:48,063 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:07:48,063 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:07:48,064 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:07:48,064 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:07:48,064 INFO ]: Start difference. First operand 45 states and 87 transitions. Second operand 10 states. [2018-06-24 21:07:48,560 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-06-24 21:07:48,998 WARN ]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-06-24 21:07:50,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:50,969 INFO ]: Finished difference Result 184 states and 626 transitions. [2018-06-24 21:07:50,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:07:50,969 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 21:07:50,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:50,982 INFO ]: With dead ends: 184 [2018-06-24 21:07:50,983 INFO ]: Without dead ends: 131 [2018-06-24 21:07:50,983 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:07:50,983 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-24 21:07:51,052 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 66. [2018-06-24 21:07:51,052 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 21:07:51,055 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 149 transitions. [2018-06-24 21:07:51,056 INFO ]: Start accepts. Automaton has 66 states and 149 transitions. Word has length 11 [2018-06-24 21:07:51,056 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:51,056 INFO ]: Abstraction has 66 states and 149 transitions. [2018-06-24 21:07:51,056 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:07:51,056 INFO ]: Start isEmpty. Operand 66 states and 149 transitions. [2018-06-24 21:07:51,062 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:07:51,062 INFO ]: Found error trace [2018-06-24 21:07:51,062 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:07:51,062 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:51,062 INFO ]: Analyzing trace with hash -263247704, now seen corresponding path program 1 times [2018-06-24 21:07:51,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:51,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:51,063 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:51,063 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:51,063 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:51,096 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:51,147 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:07:51,147 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:07:51,147 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-24 21:07:51,157 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:51,198 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:51,201 INFO ]: Computing forward predicates... [2018-06-24 21:07:51,205 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:07:51,237 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:07:51,237 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:07:51,237 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:07:51,237 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:07:51,237 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:07:51,238 INFO ]: Start difference. First operand 66 states and 149 transitions. Second operand 4 states. [2018-06-24 21:07:51,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:51,367 INFO ]: Finished difference Result 164 states and 444 transitions. [2018-06-24 21:07:51,368 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:07:51,368 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-24 21:07:51,368 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:51,375 INFO ]: With dead ends: 164 [2018-06-24 21:07:51,375 INFO ]: Without dead ends: 164 [2018-06-24 21:07:51,375 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:07:51,376 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-24 21:07:51,399 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 74. [2018-06-24 21:07:51,399 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 21:07:51,401 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 171 transitions. [2018-06-24 21:07:51,401 INFO ]: Start accepts. Automaton has 74 states and 171 transitions. Word has length 12 [2018-06-24 21:07:51,401 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:51,401 INFO ]: Abstraction has 74 states and 171 transitions. [2018-06-24 21:07:51,401 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:07:51,401 INFO ]: Start isEmpty. Operand 74 states and 171 transitions. [2018-06-24 21:07:51,403 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:07:51,403 INFO ]: Found error trace [2018-06-24 21:07:51,403 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:07:51,404 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:51,404 INFO ]: Analyzing trace with hash -1136990989, now seen corresponding path program 1 times [2018-06-24 21:07:51,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:51,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:51,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:51,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:51,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:51,416 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:51,487 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:07:51,488 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:07:51,488 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:07:51,488 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:07:51,488 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:07:51,488 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:07:51,488 INFO ]: Start difference. First operand 74 states and 171 transitions. Second operand 3 states. [2018-06-24 21:07:51,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:51,666 INFO ]: Finished difference Result 99 states and 222 transitions. [2018-06-24 21:07:51,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:07:51,668 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 21:07:51,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:51,670 INFO ]: With dead ends: 99 [2018-06-24 21:07:51,670 INFO ]: Without dead ends: 99 [2018-06-24 21:07:51,670 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-24 21:07:51,671 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-24 21:07:51,691 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-06-24 21:07:51,691 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-24 21:07:51,696 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 222 transitions. [2018-06-24 21:07:51,696 INFO ]: Start accepts. Automaton has 99 states and 222 transitions. Word has length 12 [2018-06-24 21:07:51,696 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:51,696 INFO ]: Abstraction has 99 states and 222 transitions. [2018-06-24 21:07:51,696 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:07:51,696 INFO ]: Start isEmpty. Operand 99 states and 222 transitions. [2018-06-24 21:07:51,702 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:07:51,702 INFO ]: Found error trace [2018-06-24 21:07:51,702 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:07:51,702 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:51,702 INFO ]: Analyzing trace with hash -1417836106, now seen corresponding path program 1 times [2018-06-24 21:07:51,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:51,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:51,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:51,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:51,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:51,757 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:52,187 WARN ]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-24 21:07:52,340 INFO ]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:07:52,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:07:52,340 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) [2018-06-24 21:07:52,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:07:52,413 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:52,417 INFO ]: Computing forward predicates... [2018-06-24 21:07:52,548 INFO ]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:07:52,569 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:07:52,569 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:07:52,569 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:07:52,569 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:07:52,569 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:07:52,569 INFO ]: Start difference. First operand 99 states and 222 transitions. Second operand 10 states. [2018-06-24 21:07:53,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:53,828 INFO ]: Finished difference Result 216 states and 573 transitions. [2018-06-24 21:07:53,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 21:07:53,828 INFO ]: Start accepts. Automaton has 10 states. Word has length 18 [2018-06-24 21:07:53,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:53,833 INFO ]: With dead ends: 216 [2018-06-24 21:07:53,833 INFO ]: Without dead ends: 216 [2018-06-24 21:07:53,834 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:07:53,834 INFO ]: Start minimizeSevpa. Operand 216 states. [2018-06-24 21:07:53,856 INFO ]: Finished minimizeSevpa. Reduced states from 216 to 120. [2018-06-24 21:07:53,856 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-24 21:07:53,859 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 317 transitions. [2018-06-24 21:07:53,859 INFO ]: Start accepts. Automaton has 120 states and 317 transitions. Word has length 18 [2018-06-24 21:07:53,860 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:53,860 INFO ]: Abstraction has 120 states and 317 transitions. [2018-06-24 21:07:53,860 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:07:53,860 INFO ]: Start isEmpty. Operand 120 states and 317 transitions. [2018-06-24 21:07:53,864 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:07:53,864 INFO ]: Found error trace [2018-06-24 21:07:53,864 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:07:53,865 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:53,865 INFO ]: Analyzing trace with hash 1483752045, now seen corresponding path program 1 times [2018-06-24 21:07:53,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:53,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:53,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:53,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:53,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:53,884 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:53,963 INFO ]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:07:53,963 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:07:53,963 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:07:53,963 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:07:53,963 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:07:53,963 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:07:53,963 INFO ]: Start difference. First operand 120 states and 317 transitions. Second operand 3 states. [2018-06-24 21:07:54,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:54,023 INFO ]: Finished difference Result 210 states and 562 transitions. [2018-06-24 21:07:54,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:07:54,023 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-24 21:07:54,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:54,028 INFO ]: With dead ends: 210 [2018-06-24 21:07:54,028 INFO ]: Without dead ends: 210 [2018-06-24 21:07:54,029 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-24 21:07:54,029 INFO ]: Start minimizeSevpa. Operand 210 states. [2018-06-24 21:07:54,048 INFO ]: Finished minimizeSevpa. Reduced states from 210 to 120. [2018-06-24 21:07:54,048 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-24 21:07:54,051 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 317 transitions. [2018-06-24 21:07:54,051 INFO ]: Start accepts. Automaton has 120 states and 317 transitions. Word has length 18 [2018-06-24 21:07:54,051 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:54,051 INFO ]: Abstraction has 120 states and 317 transitions. [2018-06-24 21:07:54,051 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:07:54,051 INFO ]: Start isEmpty. Operand 120 states and 317 transitions. [2018-06-24 21:07:54,056 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:07:54,056 INFO ]: Found error trace [2018-06-24 21:07:54,056 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:07:54,056 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:54,056 INFO ]: Analyzing trace with hash 509088192, now seen corresponding path program 1 times [2018-06-24 21:07:54,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:54,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:54,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:54,057 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:54,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:54,070 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:54,127 INFO ]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:07:54,127 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:07:54,127 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:07:54,127 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:07:54,127 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:07:54,127 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:07:54,127 INFO ]: Start difference. First operand 120 states and 317 transitions. Second operand 5 states. [2018-06-24 21:07:54,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:54,294 INFO ]: Finished difference Result 178 states and 486 transitions. [2018-06-24 21:07:54,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:07:54,294 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-24 21:07:54,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:54,298 INFO ]: With dead ends: 178 [2018-06-24 21:07:54,298 INFO ]: Without dead ends: 138 [2018-06-24 21:07:54,298 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:07:54,298 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-24 21:07:54,312 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 121. [2018-06-24 21:07:54,312 INFO ]: Start removeUnreachable. Operand 121 states. [2018-06-24 21:07:54,315 INFO ]: Finished removeUnreachable. Reduced from 121 states to 121 states and 319 transitions. [2018-06-24 21:07:54,315 INFO ]: Start accepts. Automaton has 121 states and 319 transitions. Word has length 18 [2018-06-24 21:07:54,315 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:54,315 INFO ]: Abstraction has 121 states and 319 transitions. [2018-06-24 21:07:54,315 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:07:54,315 INFO ]: Start isEmpty. Operand 121 states and 319 transitions. [2018-06-24 21:07:54,319 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:07:54,319 INFO ]: Found error trace [2018-06-24 21:07:54,319 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:07:54,319 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:54,319 INFO ]: Analyzing trace with hash -1802205617, now seen corresponding path program 1 times [2018-06-24 21:07:54,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:54,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:54,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:54,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:54,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:54,335 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:54,469 INFO ]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:07:54,469 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:07:54,469 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:07:54,469 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:07:54,469 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:07:54,469 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:07:54,469 INFO ]: Start difference. First operand 121 states and 319 transitions. Second operand 4 states. [2018-06-24 21:07:54,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:54,612 INFO ]: Finished difference Result 211 states and 744 transitions. [2018-06-24 21:07:54,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:07:54,614 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-24 21:07:54,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:54,621 INFO ]: With dead ends: 211 [2018-06-24 21:07:54,621 INFO ]: Without dead ends: 211 [2018-06-24 21:07:54,622 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-24 21:07:54,622 INFO ]: Start minimizeSevpa. Operand 211 states. [2018-06-24 21:07:54,641 INFO ]: Finished minimizeSevpa. Reduced states from 211 to 126. [2018-06-24 21:07:54,641 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-24 21:07:54,643 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 329 transitions. [2018-06-24 21:07:54,643 INFO ]: Start accepts. Automaton has 126 states and 329 transitions. Word has length 18 [2018-06-24 21:07:54,644 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:54,644 INFO ]: Abstraction has 126 states and 329 transitions. [2018-06-24 21:07:54,644 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:07:54,644 INFO ]: Start isEmpty. Operand 126 states and 329 transitions. [2018-06-24 21:07:54,650 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 21:07:54,650 INFO ]: Found error trace [2018-06-24 21:07:54,650 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:07:54,650 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:54,650 INFO ]: Analyzing trace with hash 53822048, now seen corresponding path program 2 times [2018-06-24 21:07:54,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:54,650 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:54,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:54,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:07:54,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:54,668 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:54,873 INFO ]: Checked inductivity of 36 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:07:54,873 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:07:54,873 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-24 21:07:54,889 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:07:54,966 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:07:54,966 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:54,970 INFO ]: Computing forward predicates... [2018-06-24 21:07:55,198 INFO ]: Checked inductivity of 36 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:07:55,218 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:07:55,218 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-06-24 21:07:55,218 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:07:55,218 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:07:55,218 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:07:55,218 INFO ]: Start difference. First operand 126 states and 329 transitions. Second operand 12 states. [2018-06-24 21:07:58,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:07:58,930 INFO ]: Finished difference Result 590 states and 2902 transitions. [2018-06-24 21:07:58,931 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 21:07:58,931 INFO ]: Start accepts. Automaton has 12 states. Word has length 25 [2018-06-24 21:07:58,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:07:58,982 INFO ]: With dead ends: 590 [2018-06-24 21:07:58,982 INFO ]: Without dead ends: 590 [2018-06-24 21:07:58,983 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 21:07:58,983 INFO ]: Start minimizeSevpa. Operand 590 states. [2018-06-24 21:07:59,135 INFO ]: Finished minimizeSevpa. Reduced states from 590 to 130. [2018-06-24 21:07:59,135 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-24 21:07:59,138 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 343 transitions. [2018-06-24 21:07:59,138 INFO ]: Start accepts. Automaton has 130 states and 343 transitions. Word has length 25 [2018-06-24 21:07:59,138 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:07:59,138 INFO ]: Abstraction has 130 states and 343 transitions. [2018-06-24 21:07:59,138 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:07:59,138 INFO ]: Start isEmpty. Operand 130 states and 343 transitions. [2018-06-24 21:07:59,144 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 21:07:59,144 INFO ]: Found error trace [2018-06-24 21:07:59,144 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:07:59,144 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:07:59,144 INFO ]: Analyzing trace with hash 234365533, now seen corresponding path program 2 times [2018-06-24 21:07:59,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:07:59,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:07:59,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:59,145 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:07:59,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:07:59,286 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:59,403 INFO ]: Checked inductivity of 36 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:07:59,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:07:59,403 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-24 21:07:59,409 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:07:59,468 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:07:59,468 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:07:59,471 INFO ]: Computing forward predicates... [2018-06-24 21:07:59,642 INFO ]: Checked inductivity of 36 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:07:59,662 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:07:59,662 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-24 21:07:59,662 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:07:59,662 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:07:59,662 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:07:59,663 INFO ]: Start difference. First operand 130 states and 343 transitions. Second operand 13 states. [2018-06-24 21:08:00,531 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 21:08:01,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:01,122 INFO ]: Finished difference Result 289 states and 650 transitions. [2018-06-24 21:08:01,122 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:08:01,123 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-24 21:08:01,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:01,123 INFO ]: With dead ends: 289 [2018-06-24 21:08:01,123 INFO ]: Without dead ends: 0 [2018-06-24 21:08:01,123 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:08:01,123 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:08:01,123 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:08:01,123 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:08:01,123 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:08:01,123 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-06-24 21:08:01,123 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:01,123 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:08:01,123 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:08:01,123 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:08:01,123 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:08:01,125 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:08:01,126 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:08:01 BasicIcfg [2018-06-24 21:08:01,126 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:08:01,127 INFO ]: Toolchain (without parser) took 16064.49 ms. Allocated memory was 309.3 MB in the beginning and 606.1 MB in the end (delta: 296.7 MB). Free memory was 260.8 MB in the beginning and 565.5 MB in the end (delta: -304.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:08:01,128 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:08:01,128 INFO ]: ChcToBoogie took 73.45 ms. Allocated memory is still 309.3 MB. Free memory was 260.8 MB in the beginning and 258.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:08:01,129 INFO ]: Boogie Preprocessor took 37.24 ms. Allocated memory is still 309.3 MB. Free memory was 258.8 MB in the beginning and 256.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:08:01,129 INFO ]: RCFGBuilder took 541.14 ms. Allocated memory is still 309.3 MB. Free memory was 256.9 MB in the beginning and 236.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:08:01,129 INFO ]: BlockEncodingV2 took 312.67 ms. Allocated memory is still 309.3 MB. Free memory was 236.8 MB in the beginning and 227.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:08:01,131 INFO ]: TraceAbstraction took 15092.60 ms. Allocated memory was 309.3 MB in the beginning and 606.1 MB in the end (delta: 296.7 MB). Free memory was 227.8 MB in the beginning and 565.5 MB in the end (delta: -337.7 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:08:01,134 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 31 locations, 48 edges - StatisticsResult: Encoded RCFG 23 locations, 42 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 73.45 ms. Allocated memory is still 309.3 MB. Free memory was 260.8 MB in the beginning and 258.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.24 ms. Allocated memory is still 309.3 MB. Free memory was 258.8 MB in the beginning and 256.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 541.14 ms. Allocated memory is still 309.3 MB. Free memory was 256.9 MB in the beginning and 236.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 312.67 ms. Allocated memory is still 309.3 MB. Free memory was 236.8 MB in the beginning and 227.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 15092.60 ms. Allocated memory was 309.3 MB in the beginning and 606.1 MB in the end (delta: 296.7 MB). Free memory was 227.8 MB in the beginning and 565.5 MB in the end (delta: -337.7 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. SAFE Result, 15.0s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 934 SDtfs, 888 SDslu, 1269 SDs, 0 SdLazy, 4883 SolverSat, 1919 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 973 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 14798 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1579 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 216/248 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-08-01-146.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-08-01-146.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-08-01-146.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-08-01-146.csv Received shutdown request...