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/011-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:03:11,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:03:11,476 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:03:11,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:03:11,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:03:11,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:03:11,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:03:11,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:03:11,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:03:11,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:03:11,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:03:11,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:03:11,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:03:11,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:03:11,506 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:03:11,507 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:03:11,508 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:03:11,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:03:11,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:03:11,524 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:03:11,525 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:03:11,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:03:11,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:03:11,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:03:11,528 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:03:11,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:03:11,534 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:03:11,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:03:11,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:03:11,536 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:03:11,537 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:03:11,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:03:11,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:03:11,542 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:03:11,543 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:03:11,543 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:03:11,567 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:03:11,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:03:11,568 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:03:11,568 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:03:11,569 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:03:11,569 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:03:11,569 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:03:11,570 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:03:11,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:03:11,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:03:11,570 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:03:11,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:03:11,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:03:11,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:03:11,572 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:03:11,572 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:03:11,572 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:03:11,572 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:03:11,572 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:03:11,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:03:11,573 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:03:11,574 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:03:11,574 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:03:11,624 INFO ]: Repository-Root is: /tmp [2018-06-24 21:03:11,641 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:03:11,644 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:03:11,647 INFO ]: Initializing SmtParser... [2018-06-24 21:03:11,647 INFO ]: SmtParser initialized [2018-06-24 21:03:11,647 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/011-horn.smt2 [2018-06-24 21:03:11,649 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:03:11,737 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011-horn.smt2 unknown [2018-06-24 21:03:12,033 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011-horn.smt2 [2018-06-24 21:03:12,037 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:03:12,043 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:03:12,043 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:03:12,043 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:03:12,043 INFO ]: ChcToBoogie initialized [2018-06-24 21:03:12,048 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:03:12" (1/1) ... [2018-06-24 21:03:12,111 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:12 Unit [2018-06-24 21:03:12,111 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:03:12,111 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:03:12,111 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:03:12,111 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:03:12,133 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:12" (1/1) ... [2018-06-24 21:03:12,133 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:12" (1/1) ... [2018-06-24 21:03:12,140 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:12" (1/1) ... [2018-06-24 21:03:12,140 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:12" (1/1) ... [2018-06-24 21:03:12,156 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:12" (1/1) ... [2018-06-24 21:03:12,159 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:12" (1/1) ... [2018-06-24 21:03:12,169 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:12" (1/1) ... [2018-06-24 21:03:12,171 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:03:12,172 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:03:12,172 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:03:12,172 INFO ]: RCFGBuilder initialized [2018-06-24 21:03:12,173 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:12" (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-24 21:03:12,194 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:03:12,194 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:03:12,194 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:03:12,194 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:03:12,194 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:03:12,194 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-24 21:03:12,760 INFO ]: Using library mode [2018-06-24 21:03:12,760 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:03:12 BoogieIcfgContainer [2018-06-24 21:03:12,760 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:03:12,761 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:03:12,761 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:03:12,761 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:03:12,764 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:03:12" (1/1) ... [2018-06-24 21:03:12,781 INFO ]: Initial Icfg 12 locations, 43 edges [2018-06-24 21:03:12,782 INFO ]: Using Remove infeasible edges [2018-06-24 21:03:12,783 INFO ]: Using Maximize final states [2018-06-24 21:03:12,783 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:03:12,783 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:03:12,788 INFO ]: Using Remove sink states [2018-06-24 21:03:12,789 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:03:12,789 INFO ]: Using Use SBE [2018-06-24 21:03:12,803 INFO ]: SBE split 0 edges [2018-06-24 21:03:12,809 INFO ]: Removed 9 edges and 2 locations because of local infeasibility [2018-06-24 21:03:12,810 INFO ]: 0 new accepting states [2018-06-24 21:03:12,874 INFO ]: Removed 15 edges and 2 locations by large block encoding [2018-06-24 21:03:12,875 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:03:12,877 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:03:12,877 INFO ]: 0 new accepting states [2018-06-24 21:03:12,877 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:03:12,877 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:03:12,877 INFO ]: Encoded RCFG 8 locations, 32 edges [2018-06-24 21:03:12,877 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:03:12 BasicIcfg [2018-06-24 21:03:12,878 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:03:12,878 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:03:12,878 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:03:12,881 INFO ]: TraceAbstraction initialized [2018-06-24 21:03:12,882 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:03:12" (1/4) ... [2018-06-24 21:03:12,882 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be4a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:03:12, skipping insertion in model container [2018-06-24 21:03:12,883 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:12" (2/4) ... [2018-06-24 21:03:12,883 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be4a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:03:12, skipping insertion in model container [2018-06-24 21:03:12,883 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:03:12" (3/4) ... [2018-06-24 21:03:12,883 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be4a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:03:12, skipping insertion in model container [2018-06-24 21:03:12,883 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:03:12" (4/4) ... [2018-06-24 21:03:12,885 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:03:12,894 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:03:12,912 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:03:12,959 INFO ]: Using default assertion order modulation [2018-06-24 21:03:12,959 INFO ]: Interprodecural is true [2018-06-24 21:03:12,959 INFO ]: Hoare is false [2018-06-24 21:03:12,959 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:03:12,959 INFO ]: Backedges is TWOTRACK [2018-06-24 21:03:12,959 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:03:12,959 INFO ]: Difference is false [2018-06-24 21:03:12,959 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:03:12,960 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:03:12,971 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:03:12,994 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:03:12,994 INFO ]: Found error trace [2018-06-24 21:03:12,995 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:03:12,995 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:12,998 INFO ]: Analyzing trace with hash 53045641, now seen corresponding path program 1 times [2018-06-24 21:03:13,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:13,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:13,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:13,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:13,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:13,071 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:13,146 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:03:13,148 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:13,149 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:13,150 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:13,160 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:13,160 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:13,162 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-24 21:03:13,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:13,453 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-24 21:03:13,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:13,455 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:03:13,455 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:13,465 INFO ]: With dead ends: 9 [2018-06-24 21:03:13,465 INFO ]: Without dead ends: 8 [2018-06-24 21:03:13,467 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:03:13,483 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:03:13,500 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:03:13,502 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:03:13,502 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-06-24 21:03:13,503 INFO ]: Start accepts. Automaton has 8 states and 29 transitions. Word has length 5 [2018-06-24 21:03:13,504 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:13,504 INFO ]: Abstraction has 8 states and 29 transitions. [2018-06-24 21:03:13,504 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:13,504 INFO ]: Start isEmpty. Operand 8 states and 29 transitions. [2018-06-24 21:03:13,505 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:03:13,505 INFO ]: Found error trace [2018-06-24 21:03:13,505 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:03:13,505 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:13,505 INFO ]: Analyzing trace with hash 53075432, now seen corresponding path program 1 times [2018-06-24 21:03:13,505 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:13,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:13,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:13,506 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:13,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:13,515 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:13,581 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:03:13,581 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:13,581 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:13,582 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:13,582 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:13,582 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:13,583 INFO ]: Start difference. First operand 8 states and 29 transitions. Second operand 3 states. [2018-06-24 21:03:13,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:13,791 INFO ]: Finished difference Result 10 states and 30 transitions. [2018-06-24 21:03:13,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:13,792 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:03:13,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:13,794 INFO ]: With dead ends: 10 [2018-06-24 21:03:13,795 INFO ]: Without dead ends: 10 [2018-06-24 21:03:13,795 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:03:13,795 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:03:13,799 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-24 21:03:13,799 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:03:13,799 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-24 21:03:13,800 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 5 [2018-06-24 21:03:13,800 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:13,800 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-24 21:03:13,800 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:13,800 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-24 21:03:13,800 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:03:13,800 INFO ]: Found error trace [2018-06-24 21:03:13,800 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:03:13,800 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:13,800 INFO ]: Analyzing trace with hash 53076393, now seen corresponding path program 1 times [2018-06-24 21:03:13,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:13,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:13,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:13,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:13,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:13,814 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:13,890 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:03:13,890 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:13,890 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:13,890 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:13,890 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:13,890 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:13,890 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 3 states. [2018-06-24 21:03:13,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:13,966 INFO ]: Finished difference Result 11 states and 36 transitions. [2018-06-24 21:03:13,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:13,966 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:03:13,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:13,967 INFO ]: With dead ends: 11 [2018-06-24 21:03:13,967 INFO ]: Without dead ends: 11 [2018-06-24 21:03:13,967 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:03:13,967 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:03:13,970 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 21:03:13,970 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:03:13,970 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-06-24 21:03:13,970 INFO ]: Start accepts. Automaton has 9 states and 31 transitions. Word has length 5 [2018-06-24 21:03:13,970 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:13,970 INFO ]: Abstraction has 9 states and 31 transitions. [2018-06-24 21:03:13,971 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:13,971 INFO ]: Start isEmpty. Operand 9 states and 31 transitions. [2018-06-24 21:03:13,971 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:03:13,971 INFO ]: Found error trace [2018-06-24 21:03:13,971 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:03:13,971 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:13,971 INFO ]: Analyzing trace with hash 53107145, now seen corresponding path program 1 times [2018-06-24 21:03:13,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:13,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:13,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:13,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:13,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:13,981 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:14,073 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:03:14,073 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:14,073 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:14,074 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:14,074 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:14,074 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:14,074 INFO ]: Start difference. First operand 9 states and 31 transitions. Second operand 3 states. [2018-06-24 21:03:14,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:14,130 INFO ]: Finished difference Result 11 states and 35 transitions. [2018-06-24 21:03:14,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:14,132 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:03:14,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:14,133 INFO ]: With dead ends: 11 [2018-06-24 21:03:14,133 INFO ]: Without dead ends: 11 [2018-06-24 21:03:14,133 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:03:14,133 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:03:14,135 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:03:14,135 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:03:14,136 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2018-06-24 21:03:14,136 INFO ]: Start accepts. Automaton has 10 states and 34 transitions. Word has length 5 [2018-06-24 21:03:14,136 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:14,136 INFO ]: Abstraction has 10 states and 34 transitions. [2018-06-24 21:03:14,136 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:14,136 INFO ]: Start isEmpty. Operand 10 states and 34 transitions. [2018-06-24 21:03:14,136 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:03:14,136 INFO ]: Found error trace [2018-06-24 21:03:14,136 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:03:14,137 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:14,138 INFO ]: Analyzing trace with hash 53110028, now seen corresponding path program 1 times [2018-06-24 21:03:14,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:14,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:14,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:14,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,149 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:14,209 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:03:14,210 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:14,210 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:14,210 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:14,210 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:14,210 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:14,210 INFO ]: Start difference. First operand 10 states and 34 transitions. Second operand 3 states. [2018-06-24 21:03:14,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:14,236 INFO ]: Finished difference Result 11 states and 33 transitions. [2018-06-24 21:03:14,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:14,236 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:03:14,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:14,237 INFO ]: With dead ends: 11 [2018-06-24 21:03:14,237 INFO ]: Without dead ends: 11 [2018-06-24 21:03:14,237 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:03:14,237 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:03:14,239 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:03:14,239 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:03:14,239 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2018-06-24 21:03:14,239 INFO ]: Start accepts. Automaton has 10 states and 32 transitions. Word has length 5 [2018-06-24 21:03:14,239 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:14,239 INFO ]: Abstraction has 10 states and 32 transitions. [2018-06-24 21:03:14,239 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:14,239 INFO ]: Start isEmpty. Operand 10 states and 32 transitions. [2018-06-24 21:03:14,240 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:03:14,240 INFO ]: Found error trace [2018-06-24 21:03:14,240 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:03:14,240 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:14,240 INFO ]: Analyzing trace with hash 1644035918, now seen corresponding path program 1 times [2018-06-24 21:03:14,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:14,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:14,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,241 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:14,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,257 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:14,334 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:03:14,335 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:14,335 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:03:14,335 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:03:14,335 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:03:14,335 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:03:14,335 INFO ]: Start difference. First operand 10 states and 32 transitions. Second operand 4 states. [2018-06-24 21:03:14,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:14,466 INFO ]: Finished difference Result 17 states and 55 transitions. [2018-06-24 21:03:14,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:03:14,466 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:03:14,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:14,466 INFO ]: With dead ends: 17 [2018-06-24 21:03:14,467 INFO ]: Without dead ends: 13 [2018-06-24 21:03:14,467 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:03:14,467 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:03:14,468 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 21:03:14,468 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:03:14,469 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2018-06-24 21:03:14,469 INFO ]: Start accepts. Automaton has 10 states and 28 transitions. Word has length 6 [2018-06-24 21:03:14,469 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:14,469 INFO ]: Abstraction has 10 states and 28 transitions. [2018-06-24 21:03:14,469 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:03:14,469 INFO ]: Start isEmpty. Operand 10 states and 28 transitions. [2018-06-24 21:03:14,469 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:03:14,469 INFO ]: Found error trace [2018-06-24 21:03:14,469 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:03:14,469 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:14,470 INFO ]: Analyzing trace with hash 1644095500, now seen corresponding path program 1 times [2018-06-24 21:03:14,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:14,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:14,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,470 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:14,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,478 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:14,521 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:03:14,521 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:14,521 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:14,521 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:14,521 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:14,521 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:14,521 INFO ]: Start difference. First operand 10 states and 28 transitions. Second operand 3 states. [2018-06-24 21:03:14,545 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:14,545 INFO ]: Finished difference Result 10 states and 23 transitions. [2018-06-24 21:03:14,546 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:14,546 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:03:14,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:14,546 INFO ]: With dead ends: 10 [2018-06-24 21:03:14,546 INFO ]: Without dead ends: 10 [2018-06-24 21:03:14,546 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:03:14,546 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:03:14,548 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:03:14,548 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:03:14,548 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-06-24 21:03:14,548 INFO ]: Start accepts. Automaton has 10 states and 23 transitions. Word has length 6 [2018-06-24 21:03:14,548 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:14,548 INFO ]: Abstraction has 10 states and 23 transitions. [2018-06-24 21:03:14,548 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:14,548 INFO ]: Start isEmpty. Operand 10 states and 23 transitions. [2018-06-24 21:03:14,548 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:03:14,548 INFO ]: Found error trace [2018-06-24 21:03:14,548 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:03:14,549 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:14,549 INFO ]: Analyzing trace with hash 1644334789, now seen corresponding path program 1 times [2018-06-24 21:03:14,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:14,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:14,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,549 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:14,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,557 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:14,620 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:14,620 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:14,620 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:14,620 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:14,620 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:14,621 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:14,621 INFO ]: Start difference. First operand 10 states and 23 transitions. Second operand 3 states. [2018-06-24 21:03:14,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:14,676 INFO ]: Finished difference Result 13 states and 30 transitions. [2018-06-24 21:03:14,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:14,676 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:03:14,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:14,677 INFO ]: With dead ends: 13 [2018-06-24 21:03:14,677 INFO ]: Without dead ends: 13 [2018-06-24 21:03:14,677 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:03:14,677 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:03:14,679 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 8. [2018-06-24 21:03:14,679 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:03:14,679 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-06-24 21:03:14,679 INFO ]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 6 [2018-06-24 21:03:14,679 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:14,679 INFO ]: Abstraction has 8 states and 15 transitions. [2018-06-24 21:03:14,679 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:14,679 INFO ]: Start isEmpty. Operand 8 states and 15 transitions. [2018-06-24 21:03:14,679 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:03:14,679 INFO ]: Found error trace [2018-06-24 21:03:14,679 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:03:14,680 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:14,680 INFO ]: Analyzing trace with hash -566738182, now seen corresponding path program 1 times [2018-06-24 21:03:14,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:14,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:14,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:14,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,688 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:14,713 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:14,713 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:14,713 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:14,713 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:14,713 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:14,713 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:14,713 INFO ]: Start difference. First operand 8 states and 15 transitions. Second operand 3 states. [2018-06-24 21:03:14,786 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:14,786 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-24 21:03:14,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:14,787 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:03:14,787 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:14,787 INFO ]: With dead ends: 10 [2018-06-24 21:03:14,787 INFO ]: Without dead ends: 8 [2018-06-24 21:03:14,787 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:03:14,787 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:03:14,788 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:03:14,788 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:03:14,789 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-24 21:03:14,789 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-24 21:03:14,789 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:14,789 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-24 21:03:14,789 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:14,789 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-24 21:03:14,789 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:03:14,789 INFO ]: Found error trace [2018-06-24 21:03:14,789 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:03:14,789 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:14,789 INFO ]: Analyzing trace with hash -565814661, now seen corresponding path program 1 times [2018-06-24 21:03:14,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:14,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:14,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:14,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:14,810 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:14,961 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:14,961 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:14,961 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:03:14,961 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:03:14,961 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:03:14,961 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:03:14,962 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 4 states. [2018-06-24 21:03:15,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:15,027 INFO ]: Finished difference Result 4 states and 4 transitions. [2018-06-24 21:03:15,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:03:15,027 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:03:15,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:15,027 INFO ]: With dead ends: 4 [2018-06-24 21:03:15,027 INFO ]: Without dead ends: 0 [2018-06-24 21:03:15,027 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:03:15,027 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:03:15,028 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:03:15,028 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:03:15,028 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:03:15,028 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-24 21:03:15,028 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:15,028 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:03:15,028 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:03:15,028 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:03:15,028 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:03:15,030 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:03:15,033 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:03:15 BasicIcfg [2018-06-24 21:03:15,033 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:03:15,034 INFO ]: Toolchain (without parser) took 2996.55 ms. Allocated memory was 309.3 MB in the beginning and 326.6 MB in the end (delta: 17.3 MB). Free memory was 260.9 MB in the beginning and 265.7 MB in the end (delta: -4.8 MB). Peak memory consumption was 12.5 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:15,038 INFO ]: SmtParser took 0.07 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:03:15,038 INFO ]: ChcToBoogie took 67.83 ms. Allocated memory is still 309.3 MB. Free memory was 260.9 MB in the beginning and 257.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:15,038 INFO ]: Boogie Preprocessor took 59.93 ms. Allocated memory is still 309.3 MB. Free memory was 257.9 MB in the beginning and 256.9 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-24 21:03:15,039 INFO ]: RCFGBuilder took 588.65 ms. Allocated memory is still 309.3 MB. Free memory was 256.9 MB in the beginning and 239.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:15,039 INFO ]: BlockEncodingV2 took 116.89 ms. Allocated memory is still 309.3 MB. Free memory was 239.9 MB in the beginning and 233.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:15,040 INFO ]: TraceAbstraction took 2154.86 ms. Allocated memory was 309.3 MB in the beginning and 326.6 MB in the end (delta: 17.3 MB). Free memory was 233.9 MB in the beginning and 265.7 MB in the end (delta: -31.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:03:15,048 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 43 edges - StatisticsResult: Encoded RCFG 8 locations, 32 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 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 67.83 ms. Allocated memory is still 309.3 MB. Free memory was 260.9 MB in the beginning and 257.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 59.93 ms. Allocated memory is still 309.3 MB. Free memory was 257.9 MB in the beginning and 256.9 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 588.65 ms. Allocated memory is still 309.3 MB. Free memory was 256.9 MB in the beginning and 239.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 116.89 ms. Allocated memory is still 309.3 MB. Free memory was 239.9 MB in the beginning and 233.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2154.86 ms. Allocated memory was 309.3 MB in the beginning and 326.6 MB in the end (delta: 17.3 MB). Free memory was 233.9 MB in the beginning and 265.7 MB in the end (delta: -31.8 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, 8 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 54 SDslu, 111 SDs, 0 SdLazy, 98 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=4, 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3/3 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/011-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-03-15-075.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-03-15-075.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-03-15-075.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-03-15-075.csv Received shutdown request...