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/llreve-bench/smt2/loop__break.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:44:59,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:44:59,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:44:59,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:44:59,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:44:59,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:44:59,594 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:44:59,600 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:44:59,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:44:59,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:44:59,604 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:44:59,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:44:59,605 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:44:59,606 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:44:59,607 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:44:59,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:44:59,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:44:59,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:44:59,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:44:59,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:44:59,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:44:59,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:44:59,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:44:59,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:44:59,620 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:44:59,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:44:59,622 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:44:59,623 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:44:59,623 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:44:59,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:44:59,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:44:59,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:44:59,625 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:44:59,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:44:59,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:44:59,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:44:59,627 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:44:59,640 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:44:59,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:44:59,641 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:44:59,641 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:44:59,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:44:59,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:44:59,642 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:44:59,642 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:44:59,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:44:59,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:44:59,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:44:59,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:44:59,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:44:59,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:44:59,647 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:44:59,647 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:44:59,647 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:44:59,647 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:44:59,647 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:44:59,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:44:59,648 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:44:59,649 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:44:59,650 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:44:59,692 INFO ]: Repository-Root is: /tmp [2018-06-26 18:44:59,708 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:44:59,713 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:44:59,714 INFO ]: Initializing SmtParser... [2018-06-26 18:44:59,715 INFO ]: SmtParser initialized [2018-06-26 18:44:59,715 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__break.smt2 [2018-06-26 18:44:59,717 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 18:44:59,805 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__break.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3410ce77 [2018-06-26 18:44:59,999 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__break.smt2 [2018-06-26 18:45:00,003 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:45:00,009 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:45:00,009 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:45:00,009 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:45:00,010 INFO ]: ChcToBoogie initialized [2018-06-26 18:45:00,013 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:45:00" (1/1) ... [2018-06-26 18:45:00,072 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:00 Unit [2018-06-26 18:45:00,072 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:45:00,072 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:45:00,072 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:45:00,072 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:45:00,094 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:00" (1/1) ... [2018-06-26 18:45:00,095 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:00" (1/1) ... [2018-06-26 18:45:00,101 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:00" (1/1) ... [2018-06-26 18:45:00,101 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:00" (1/1) ... [2018-06-26 18:45:00,104 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:00" (1/1) ... [2018-06-26 18:45:00,106 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:00" (1/1) ... [2018-06-26 18:45:00,107 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:00" (1/1) ... [2018-06-26 18:45:00,110 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:45:00,110 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:45:00,111 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:45:00,111 INFO ]: RCFGBuilder initialized [2018-06-26 18:45:00,111 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:00" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 18:45:00,129 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:45:00,129 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:45:00,129 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:45:00,129 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:45:00,129 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:45:00,129 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:45:00,461 INFO ]: Using library mode [2018-06-26 18:45:00,461 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:45:00 BoogieIcfgContainer [2018-06-26 18:45:00,461 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:45:00,462 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:45:00,462 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:45:00,463 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:45:00,463 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:45:00" (1/1) ... [2018-06-26 18:45:00,484 INFO ]: Initial Icfg 10 locations, 18 edges [2018-06-26 18:45:00,486 INFO ]: Using Remove infeasible edges [2018-06-26 18:45:00,486 INFO ]: Using Maximize final states [2018-06-26 18:45:00,487 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:45:00,487 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:45:00,494 INFO ]: Using Remove sink states [2018-06-26 18:45:00,495 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:45:00,495 INFO ]: Using Use SBE [2018-06-26 18:45:00,514 INFO ]: SBE split 2 edges [2018-06-26 18:45:00,519 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-26 18:45:00,521 INFO ]: 0 new accepting states [2018-06-26 18:45:00,586 INFO ]: Removed 7 edges and 2 locations by large block encoding [2018-06-26 18:45:00,588 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:45:00,590 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:45:00,590 INFO ]: 0 new accepting states [2018-06-26 18:45:00,590 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:45:00,590 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:45:00,590 INFO ]: Encoded RCFG 6 locations, 13 edges [2018-06-26 18:45:00,591 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:45:00 BasicIcfg [2018-06-26 18:45:00,591 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:45:00,592 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:45:00,592 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:45:00,595 INFO ]: TraceAbstraction initialized [2018-06-26 18:45:00,595 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:45:00" (1/4) ... [2018-06-26 18:45:00,596 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d482d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:45:00, skipping insertion in model container [2018-06-26 18:45:00,596 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:00" (2/4) ... [2018-06-26 18:45:00,596 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d482d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:45:00, skipping insertion in model container [2018-06-26 18:45:00,596 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:45:00" (3/4) ... [2018-06-26 18:45:00,597 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d482d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:45:00, skipping insertion in model container [2018-06-26 18:45:00,597 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:45:00" (4/4) ... [2018-06-26 18:45:00,598 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:45:00,608 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:45:00,617 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:45:00,674 INFO ]: Using default assertion order modulation [2018-06-26 18:45:00,675 INFO ]: Interprodecural is true [2018-06-26 18:45:00,675 INFO ]: Hoare is false [2018-06-26 18:45:00,675 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:45:00,675 INFO ]: Backedges is TWOTRACK [2018-06-26 18:45:00,675 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:45:00,675 INFO ]: Difference is false [2018-06-26 18:45:00,675 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:45:00,675 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:45:00,686 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 18:45:00,701 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:45:00,701 INFO ]: Found error trace [2018-06-26 18:45:00,702 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:45:00,702 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:00,707 INFO ]: Analyzing trace with hash 33927673, now seen corresponding path program 1 times [2018-06-26 18:45:00,709 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:00,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:00,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:00,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:00,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:00,783 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:00,832 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:00,834 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:00,835 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:00,836 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:00,849 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:00,849 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:00,851 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 18:45:00,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:00,994 INFO ]: Finished difference Result 7 states and 18 transitions. [2018-06-26 18:45:00,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:00,996 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:45:00,996 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:01,004 INFO ]: With dead ends: 7 [2018-06-26 18:45:01,005 INFO ]: Without dead ends: 7 [2018-06-26 18:45:01,006 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:01,021 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:45:01,033 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:45:01,034 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:45:01,034 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-06-26 18:45:01,035 INFO ]: Start accepts. Automaton has 7 states and 18 transitions. Word has length 5 [2018-06-26 18:45:01,036 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:01,036 INFO ]: Abstraction has 7 states and 18 transitions. [2018-06-26 18:45:01,036 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:01,036 INFO ]: Start isEmpty. Operand 7 states and 18 transitions. [2018-06-26 18:45:01,036 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:45:01,036 INFO ]: Found error trace [2018-06-26 18:45:01,036 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:45:01,037 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:01,037 INFO ]: Analyzing trace with hash 33957464, now seen corresponding path program 1 times [2018-06-26 18:45:01,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:01,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:01,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:01,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:01,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:01,043 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:01,074 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:01,074 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:01,074 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:01,075 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:01,076 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:01,076 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:01,076 INFO ]: Start difference. First operand 7 states and 18 transitions. Second operand 3 states. [2018-06-26 18:45:01,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:01,164 INFO ]: Finished difference Result 9 states and 28 transitions. [2018-06-26 18:45:01,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:01,164 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:45:01,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:01,164 INFO ]: With dead ends: 9 [2018-06-26 18:45:01,164 INFO ]: Without dead ends: 9 [2018-06-26 18:45:01,165 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:01,165 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 18:45:01,167 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 18:45:01,167 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:45:01,168 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2018-06-26 18:45:01,168 INFO ]: Start accepts. Automaton has 9 states and 28 transitions. Word has length 5 [2018-06-26 18:45:01,168 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:01,168 INFO ]: Abstraction has 9 states and 28 transitions. [2018-06-26 18:45:01,168 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:01,168 INFO ]: Start isEmpty. Operand 9 states and 28 transitions. [2018-06-26 18:45:01,168 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:45:01,168 INFO ]: Found error trace [2018-06-26 18:45:01,168 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:45:01,168 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:01,168 INFO ]: Analyzing trace with hash 33987255, now seen corresponding path program 1 times [2018-06-26 18:45:01,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:01,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:01,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:01,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:01,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:01,178 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:01,194 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:01,194 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:01,194 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:01,194 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:01,195 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:01,195 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:01,195 INFO ]: Start difference. First operand 9 states and 28 transitions. Second operand 3 states. [2018-06-26 18:45:01,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:01,293 INFO ]: Finished difference Result 12 states and 43 transitions. [2018-06-26 18:45:01,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:01,294 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:45:01,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:01,294 INFO ]: With dead ends: 12 [2018-06-26 18:45:01,294 INFO ]: Without dead ends: 9 [2018-06-26 18:45:01,295 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:01,295 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 18:45:01,297 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 18:45:01,297 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:45:01,297 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-06-26 18:45:01,298 INFO ]: Start accepts. Automaton has 9 states and 27 transitions. Word has length 5 [2018-06-26 18:45:01,298 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:01,298 INFO ]: Abstraction has 9 states and 27 transitions. [2018-06-26 18:45:01,298 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:01,298 INFO ]: Start isEmpty. Operand 9 states and 27 transitions. [2018-06-26 18:45:01,298 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:45:01,298 INFO ]: Found error trace [2018-06-26 18:45:01,298 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:45:01,298 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:01,298 INFO ]: Analyzing trace with hash 1051558442, now seen corresponding path program 1 times [2018-06-26 18:45:01,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:01,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:01,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:01,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:01,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:01,314 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:01,387 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:01,387 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:01,387 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:45:01,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:01,442 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:01,450 INFO ]: Computing forward predicates... [2018-06-26 18:45:01,480 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:01,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:01,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:45:01,506 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:45:01,506 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:45:01,506 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:45:01,506 INFO ]: Start difference. First operand 9 states and 27 transitions. Second operand 4 states. [2018-06-26 18:45:01,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:01,717 INFO ]: Finished difference Result 11 states and 37 transitions. [2018-06-26 18:45:01,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:45:01,719 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:45:01,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:01,719 INFO ]: With dead ends: 11 [2018-06-26 18:45:01,720 INFO ]: Without dead ends: 11 [2018-06-26 18:45:01,720 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:45:01,720 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:45:01,721 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 18:45:01,721 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:45:01,722 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-06-26 18:45:01,722 INFO ]: Start accepts. Automaton has 11 states and 37 transitions. Word has length 6 [2018-06-26 18:45:01,722 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:01,722 INFO ]: Abstraction has 11 states and 37 transitions. [2018-06-26 18:45:01,722 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:45:01,722 INFO ]: Start isEmpty. Operand 11 states and 37 transitions. [2018-06-26 18:45:01,722 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:45:01,722 INFO ]: Found error trace [2018-06-26 18:45:01,722 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:45:01,723 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:01,723 INFO ]: Analyzing trace with hash 1052511754, now seen corresponding path program 1 times [2018-06-26 18:45:01,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:01,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:01,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:01,724 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:01,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:01,739 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:01,927 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:01,928 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:01,928 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:01,940 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:01,965 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:01,966 INFO ]: Computing forward predicates... [2018-06-26 18:45:02,020 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:02,040 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:02,040 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 18:45:02,040 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:45:02,040 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:45:02,040 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:45:02,041 INFO ]: Start difference. First operand 11 states and 37 transitions. Second operand 6 states. [2018-06-26 18:45:02,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:02,465 INFO ]: Finished difference Result 24 states and 102 transitions. [2018-06-26 18:45:02,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:45:02,465 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-26 18:45:02,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:02,466 INFO ]: With dead ends: 24 [2018-06-26 18:45:02,466 INFO ]: Without dead ends: 24 [2018-06-26 18:45:02,466 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:45:02,467 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 18:45:02,469 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-06-26 18:45:02,469 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:45:02,470 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 77 transitions. [2018-06-26 18:45:02,470 INFO ]: Start accepts. Automaton has 19 states and 77 transitions. Word has length 6 [2018-06-26 18:45:02,470 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:02,470 INFO ]: Abstraction has 19 states and 77 transitions. [2018-06-26 18:45:02,470 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:45:02,470 INFO ]: Start isEmpty. Operand 19 states and 77 transitions. [2018-06-26 18:45:02,470 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:45:02,471 INFO ]: Found error trace [2018-06-26 18:45:02,471 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 18:45:02,471 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:02,471 INFO ]: Analyzing trace with hash -1761626087, now seen corresponding path program 2 times [2018-06-26 18:45:02,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:02,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:02,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:02,472 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:02,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:02,480 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:02,642 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:02,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:02,642 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:02,652 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:45:02,695 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:45:02,695 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:02,696 INFO ]: Computing forward predicates... [2018-06-26 18:45:02,701 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:02,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:02,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 18:45:02,731 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:45:02,731 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:45:02,732 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:45:02,732 INFO ]: Start difference. First operand 19 states and 77 transitions. Second operand 5 states. [2018-06-26 18:45:03,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:03,048 INFO ]: Finished difference Result 30 states and 132 transitions. [2018-06-26 18:45:03,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:45:03,048 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 18:45:03,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:03,050 INFO ]: With dead ends: 30 [2018-06-26 18:45:03,050 INFO ]: Without dead ends: 30 [2018-06-26 18:45:03,050 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:45:03,050 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 18:45:03,055 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-06-26 18:45:03,055 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 18:45:03,056 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2018-06-26 18:45:03,056 INFO ]: Start accepts. Automaton has 25 states and 107 transitions. Word has length 7 [2018-06-26 18:45:03,056 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:03,056 INFO ]: Abstraction has 25 states and 107 transitions. [2018-06-26 18:45:03,056 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:45:03,056 INFO ]: Start isEmpty. Operand 25 states and 107 transitions. [2018-06-26 18:45:03,057 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:45:03,057 INFO ]: Found error trace [2018-06-26 18:45:03,057 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 18:45:03,057 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:03,057 INFO ]: Analyzing trace with hash 1223966730, now seen corresponding path program 3 times [2018-06-26 18:45:03,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:03,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:03,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:03,058 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:03,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:03,075 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:03,115 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:03,115 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:03,115 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:03,124 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:45:03,161 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-26 18:45:03,161 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:03,163 INFO ]: Computing forward predicates... [2018-06-26 18:45:03,176 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:45:03,195 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:45:03,195 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-06-26 18:45:03,196 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:45:03,196 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:45:03,196 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:45:03,196 INFO ]: Start difference. First operand 25 states and 107 transitions. Second operand 7 states. [2018-06-26 18:45:03,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:03,326 INFO ]: Finished difference Result 53 states and 230 transitions. [2018-06-26 18:45:03,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:45:03,326 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 18:45:03,327 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:03,328 INFO ]: With dead ends: 53 [2018-06-26 18:45:03,328 INFO ]: Without dead ends: 53 [2018-06-26 18:45:03,329 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:45:03,329 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 18:45:03,333 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 26. [2018-06-26 18:45:03,333 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 18:45:03,334 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 104 transitions. [2018-06-26 18:45:03,334 INFO ]: Start accepts. Automaton has 26 states and 104 transitions. Word has length 8 [2018-06-26 18:45:03,334 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:03,335 INFO ]: Abstraction has 26 states and 104 transitions. [2018-06-26 18:45:03,335 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:45:03,335 INFO ]: Start isEmpty. Operand 26 states and 104 transitions. [2018-06-26 18:45:03,335 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:45:03,335 INFO ]: Found error trace [2018-06-26 18:45:03,335 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:03,335 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:03,335 INFO ]: Analyzing trace with hash 2140844337, now seen corresponding path program 1 times [2018-06-26 18:45:03,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:03,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:03,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:03,336 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:03,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:03,346 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:03,393 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:03,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:03,393 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:03,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:03,410 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:03,411 INFO ]: Computing forward predicates... [2018-06-26 18:45:03,417 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:03,441 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:03,441 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 18:45:03,442 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:45:03,442 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:45:03,442 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:45:03,442 INFO ]: Start difference. First operand 26 states and 104 transitions. Second operand 6 states. [2018-06-26 18:45:03,575 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:03,575 INFO ]: Finished difference Result 41 states and 173 transitions. [2018-06-26 18:45:03,575 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:45:03,575 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-26 18:45:03,575 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:03,577 INFO ]: With dead ends: 41 [2018-06-26 18:45:03,577 INFO ]: Without dead ends: 41 [2018-06-26 18:45:03,577 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:45:03,577 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 18:45:03,582 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-06-26 18:45:03,582 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 18:45:03,584 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 132 transitions. [2018-06-26 18:45:03,584 INFO ]: Start accepts. Automaton has 32 states and 132 transitions. Word has length 8 [2018-06-26 18:45:03,584 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:03,584 INFO ]: Abstraction has 32 states and 132 transitions. [2018-06-26 18:45:03,584 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:45:03,584 INFO ]: Start isEmpty. Operand 32 states and 132 transitions. [2018-06-26 18:45:03,585 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:45:03,585 INFO ]: Found error trace [2018-06-26 18:45:03,585 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:03,585 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:03,585 INFO ]: Analyzing trace with hash -712115201, now seen corresponding path program 1 times [2018-06-26 18:45:03,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:03,585 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:03,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:03,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:03,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:03,598 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:03,682 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:03,682 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:03,682 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:03,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:03,702 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:03,704 INFO ]: Computing forward predicates... [2018-06-26 18:45:03,711 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:03,744 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:03,744 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 18:45:03,744 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:45:03,744 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:45:03,744 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:45:03,744 INFO ]: Start difference. First operand 32 states and 132 transitions. Second operand 7 states. [2018-06-26 18:45:03,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:03,846 INFO ]: Finished difference Result 52 states and 221 transitions. [2018-06-26 18:45:03,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:45:03,846 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-26 18:45:03,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:03,848 INFO ]: With dead ends: 52 [2018-06-26 18:45:03,848 INFO ]: Without dead ends: 52 [2018-06-26 18:45:03,848 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:45:03,848 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-26 18:45:03,852 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-06-26 18:45:03,852 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 18:45:03,853 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 168 transitions. [2018-06-26 18:45:03,854 INFO ]: Start accepts. Automaton has 40 states and 168 transitions. Word has length 9 [2018-06-26 18:45:03,854 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:03,854 INFO ]: Abstraction has 40 states and 168 transitions. [2018-06-26 18:45:03,854 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:45:03,854 INFO ]: Start isEmpty. Operand 40 states and 168 transitions. [2018-06-26 18:45:03,854 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:45:03,854 INFO ]: Found error trace [2018-06-26 18:45:03,854 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:03,855 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:03,855 INFO ]: Analyzing trace with hash 1947751487, now seen corresponding path program 2 times [2018-06-26 18:45:03,855 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:03,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:03,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:03,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:03,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:03,865 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:03,936 INFO ]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:45:03,936 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:03,936 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:03,947 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:45:03,975 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:45:03,975 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:03,976 INFO ]: Computing forward predicates... [2018-06-26 18:45:04,022 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:04,042 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:04,042 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-26 18:45:04,042 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:45:04,042 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:45:04,043 INFO ]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:45:04,043 INFO ]: Start difference. First operand 40 states and 168 transitions. Second operand 10 states. [2018-06-26 18:45:04,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:04,606 INFO ]: Finished difference Result 90 states and 384 transitions. [2018-06-26 18:45:04,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:45:04,606 INFO ]: Start accepts. Automaton has 10 states. Word has length 9 [2018-06-26 18:45:04,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:04,608 INFO ]: With dead ends: 90 [2018-06-26 18:45:04,608 INFO ]: Without dead ends: 90 [2018-06-26 18:45:04,608 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:45:04,608 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-26 18:45:04,615 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 64. [2018-06-26 18:45:04,615 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-26 18:45:04,616 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 269 transitions. [2018-06-26 18:45:04,616 INFO ]: Start accepts. Automaton has 64 states and 269 transitions. Word has length 9 [2018-06-26 18:45:04,616 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:04,616 INFO ]: Abstraction has 64 states and 269 transitions. [2018-06-26 18:45:04,616 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:45:04,616 INFO ]: Start isEmpty. Operand 64 states and 269 transitions. [2018-06-26 18:45:04,617 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:45:04,617 INFO ]: Found error trace [2018-06-26 18:45:04,617 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:04,617 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:04,618 INFO ]: Analyzing trace with hash -595571792, now seen corresponding path program 2 times [2018-06-26 18:45:04,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:04,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:04,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:04,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:04,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:04,630 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:04,834 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:04,834 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:04,834 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:04,841 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:45:04,868 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:45:04,868 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:04,869 INFO ]: Computing forward predicates... [2018-06-26 18:45:04,877 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:04,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:04,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 18:45:04,898 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:45:04,898 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:45:04,898 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:45:04,899 INFO ]: Start difference. First operand 64 states and 269 transitions. Second operand 8 states. [2018-06-26 18:45:04,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:04,969 INFO ]: Finished difference Result 115 states and 491 transitions. [2018-06-26 18:45:04,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:45:04,969 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 18:45:04,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:04,970 INFO ]: With dead ends: 115 [2018-06-26 18:45:04,970 INFO ]: Without dead ends: 115 [2018-06-26 18:45:04,971 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:45:04,971 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-26 18:45:04,979 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 80. [2018-06-26 18:45:04,980 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-26 18:45:04,981 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 339 transitions. [2018-06-26 18:45:04,981 INFO ]: Start accepts. Automaton has 80 states and 339 transitions. Word has length 10 [2018-06-26 18:45:04,981 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:04,981 INFO ]: Abstraction has 80 states and 339 transitions. [2018-06-26 18:45:04,981 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:45:04,981 INFO ]: Start isEmpty. Operand 80 states and 339 transitions. [2018-06-26 18:45:04,982 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:45:04,982 INFO ]: Found error trace [2018-06-26 18:45:04,982 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:04,982 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:04,983 INFO ]: Analyzing trace with hash -1277693409, now seen corresponding path program 3 times [2018-06-26 18:45:04,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:04,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:04,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:04,984 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:04,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:04,994 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:05,060 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:05,060 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:05,060 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:05,066 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:45:05,079 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:45:05,079 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:05,081 INFO ]: Computing forward predicates... [2018-06-26 18:45:05,118 INFO ]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:45:05,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:05,137 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-06-26 18:45:05,137 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:45:05,137 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:45:05,137 INFO ]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:45:05,137 INFO ]: Start difference. First operand 80 states and 339 transitions. Second operand 11 states. [2018-06-26 18:45:05,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:05,454 INFO ]: Finished difference Result 164 states and 693 transitions. [2018-06-26 18:45:05,455 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 18:45:05,455 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-26 18:45:05,455 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:05,456 INFO ]: With dead ends: 164 [2018-06-26 18:45:05,456 INFO ]: Without dead ends: 164 [2018-06-26 18:45:05,457 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:45:05,457 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-26 18:45:05,466 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 94. [2018-06-26 18:45:05,466 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-26 18:45:05,468 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 395 transitions. [2018-06-26 18:45:05,468 INFO ]: Start accepts. Automaton has 94 states and 395 transitions. Word has length 11 [2018-06-26 18:45:05,468 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:05,468 INFO ]: Abstraction has 94 states and 395 transitions. [2018-06-26 18:45:05,468 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:45:05,468 INFO ]: Start isEmpty. Operand 94 states and 395 transitions. [2018-06-26 18:45:05,469 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:45:05,469 INFO ]: Found error trace [2018-06-26 18:45:05,469 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2018-06-26 18:45:05,469 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:05,469 INFO ]: Analyzing trace with hash -628259336, now seen corresponding path program 3 times [2018-06-26 18:45:05,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:05,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:05,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:05,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:05,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:05,480 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:05,681 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 18:45:05,894 INFO ]: Checked inductivity of 21 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:45:05,894 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:05,894 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:05,900 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:45:05,925 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:45:05,925 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:05,926 INFO ]: Computing forward predicates... [2018-06-26 18:45:06,117 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:06,136 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:06,136 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-06-26 18:45:06,137 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:45:06,137 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:45:06,137 INFO ]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:45:06,137 INFO ]: Start difference. First operand 94 states and 395 transitions. Second operand 13 states. [2018-06-26 18:45:06,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:06,594 INFO ]: Finished difference Result 167 states and 717 transitions. [2018-06-26 18:45:06,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:45:06,595 INFO ]: Start accepts. Automaton has 13 states. Word has length 11 [2018-06-26 18:45:06,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:06,595 INFO ]: With dead ends: 167 [2018-06-26 18:45:06,595 INFO ]: Without dead ends: 0 [2018-06-26 18:45:06,595 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:45:06,595 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 18:45:06,595 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 18:45:06,595 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 18:45:06,595 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 18:45:06,595 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-06-26 18:45:06,595 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:06,595 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 18:45:06,595 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:45:06,595 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 18:45:06,595 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 18:45:06,597 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:45:06,599 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:45:06 BasicIcfg [2018-06-26 18:45:06,599 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:45:06,600 INFO ]: Toolchain (without parser) took 6596.36 ms. Allocated memory was 307.2 MB in the beginning and 361.2 MB in the end (delta: 54.0 MB). Free memory was 263.5 MB in the beginning and 283.5 MB in the end (delta: -20.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:06,601 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:45:06,601 INFO ]: ChcToBoogie took 62.54 ms. Allocated memory is still 307.2 MB. Free memory was 262.5 MB in the beginning and 260.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:06,602 INFO ]: Boogie Preprocessor took 37.67 ms. Allocated memory is still 307.2 MB. Free memory was 260.5 MB in the beginning and 259.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 18:45:06,602 INFO ]: RCFGBuilder took 350.98 ms. Allocated memory is still 307.2 MB. Free memory was 259.5 MB in the beginning and 251.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:06,602 INFO ]: BlockEncodingV2 took 128.87 ms. Allocated memory is still 307.2 MB. Free memory was 250.5 MB in the beginning and 247.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:06,603 INFO ]: TraceAbstraction took 6007.38 ms. Allocated memory was 307.2 MB in the beginning and 361.2 MB in the end (delta: 54.0 MB). Free memory was 247.6 MB in the beginning and 283.5 MB in the end (delta: -36.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:06,609 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 18 edges - StatisticsResult: Encoded RCFG 6 locations, 13 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.54 ms. Allocated memory is still 307.2 MB. Free memory was 262.5 MB in the beginning and 260.5 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.67 ms. Allocated memory is still 307.2 MB. Free memory was 260.5 MB in the beginning and 259.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 350.98 ms. Allocated memory is still 307.2 MB. Free memory was 259.5 MB in the beginning and 251.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 128.87 ms. Allocated memory is still 307.2 MB. Free memory was 250.5 MB in the beginning and 247.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6007.38 ms. Allocated memory was 307.2 MB in the beginning and 361.2 MB in the end (delta: 54.0 MB). Free memory was 247.6 MB in the beginning and 283.5 MB in the end (delta: -36.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 5.9s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 SDtfs, 0 SDslu, 135 SDs, 0 SdLazy, 622 SolverSat, 358 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=12, 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, 13 MinimizatonAttempts, 189 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 185 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 3433 SizeOfPredicates, 16 NumberOfNonLiveVariables, 832 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 42/188 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/loop__break.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-45-06-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-45-06-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-45-06-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-45-06-626.csv Received shutdown request...