java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/lock.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:21:41,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:21:41,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:21:41,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:21:41,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:21:41,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:21:41,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:21:41,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:21:41,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:21:41,590 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:21:41,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:21:41,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:21:41,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:21:41,596 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:21:41,596 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:21:41,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:21:41,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:21:41,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:21:41,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:21:41,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:21:41,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:21:41,616 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:21:41,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:21:41,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:21:41,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:21:41,618 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:21:41,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:21:41,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:21:41,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:21:41,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:21:41,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:21:41,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:21:41,621 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:21:41,622 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:21:41,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:21:41,623 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:21:41,648 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:21:41,648 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:21:41,648 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:21:41,648 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:21:41,649 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:21:41,649 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:21:41,650 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:21:41,650 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:21:41,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:21:41,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:21:41,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:21:41,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:21:41,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:21:41,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:21:41,652 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:21:41,652 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:21:41,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:21:41,652 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:21:41,653 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:21:41,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:21:41,653 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:21:41,655 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:21:41,655 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:21:41,710 INFO ]: Repository-Root is: /tmp [2018-06-24 21:21:41,721 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:21:41,724 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:21:41,726 INFO ]: Initializing SmtParser... [2018-06-24 21:21:41,726 INFO ]: SmtParser initialized [2018-06-24 21:21:41,727 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/lock.smt2 [2018-06-24 21:21:41,728 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:21:41,824 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/lock.smt2 unknown [2018-06-24 21:21:42,057 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/lock.smt2 [2018-06-24 21:21:42,063 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:21:42,069 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:21:42,070 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:21:42,070 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:21:42,070 INFO ]: ChcToBoogie initialized [2018-06-24 21:21:42,073 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:21:42" (1/1) ... [2018-06-24 21:21:42,116 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:42 Unit [2018-06-24 21:21:42,116 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:21:42,116 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:21:42,117 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:21:42,117 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:21:42,136 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:42" (1/1) ... [2018-06-24 21:21:42,136 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:42" (1/1) ... [2018-06-24 21:21:42,142 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:42" (1/1) ... [2018-06-24 21:21:42,142 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:42" (1/1) ... [2018-06-24 21:21:42,148 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:42" (1/1) ... [2018-06-24 21:21:42,157 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:42" (1/1) ... [2018-06-24 21:21:42,158 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:42" (1/1) ... [2018-06-24 21:21:42,160 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:21:42,160 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:21:42,160 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:21:42,160 INFO ]: RCFGBuilder initialized [2018-06-24 21:21:42,166 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:42" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:21:42,179 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:21:42,179 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:21:42,179 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:21:42,179 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:21:42,179 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:21:42,179 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 21:21:42,538 INFO ]: Using library mode [2018-06-24 21:21:42,539 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:21:42 BoogieIcfgContainer [2018-06-24 21:21:42,539 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:21:42,539 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:21:42,539 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:21:42,541 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:21:42,541 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:21:42" (1/1) ... [2018-06-24 21:21:42,556 INFO ]: Initial Icfg 26 locations, 36 edges [2018-06-24 21:21:42,557 INFO ]: Using Remove infeasible edges [2018-06-24 21:21:42,558 INFO ]: Using Maximize final states [2018-06-24 21:21:42,558 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:21:42,558 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:21:42,560 INFO ]: Using Remove sink states [2018-06-24 21:21:42,560 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:21:42,560 INFO ]: Using Use SBE [2018-06-24 21:21:42,569 INFO ]: SBE split 0 edges [2018-06-24 21:21:42,577 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:21:42,578 INFO ]: 0 new accepting states [2018-06-24 21:21:42,752 INFO ]: Removed 42 edges and 12 locations by large block encoding [2018-06-24 21:21:42,754 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:21:42,756 INFO ]: Removed 1 edges and 0 locations because of local infeasibility [2018-06-24 21:21:42,756 INFO ]: 0 new accepting states [2018-06-24 21:21:42,756 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:21:42,756 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:21:42,757 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:21:42,757 INFO ]: 0 new accepting states [2018-06-24 21:21:42,757 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:21:42,757 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:21:42,757 INFO ]: Encoded RCFG 12 locations, 21 edges [2018-06-24 21:21:42,759 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:21:42 BasicIcfg [2018-06-24 21:21:42,759 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:21:42,760 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:21:42,760 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:21:42,764 INFO ]: TraceAbstraction initialized [2018-06-24 21:21:42,764 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:21:42" (1/4) ... [2018-06-24 21:21:42,765 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393566b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:21:42, skipping insertion in model container [2018-06-24 21:21:42,765 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:21:42" (2/4) ... [2018-06-24 21:21:42,765 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393566b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:21:42, skipping insertion in model container [2018-06-24 21:21:42,765 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:21:42" (3/4) ... [2018-06-24 21:21:42,765 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393566b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:21:42, skipping insertion in model container [2018-06-24 21:21:42,766 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:21:42" (4/4) ... [2018-06-24 21:21:42,768 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:21:42,780 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:21:42,786 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:21:42,829 INFO ]: Using default assertion order modulation [2018-06-24 21:21:42,830 INFO ]: Interprodecural is true [2018-06-24 21:21:42,830 INFO ]: Hoare is false [2018-06-24 21:21:42,830 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:21:42,830 INFO ]: Backedges is TWOTRACK [2018-06-24 21:21:42,830 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:21:42,830 INFO ]: Difference is false [2018-06-24 21:21:42,830 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:21:42,830 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:21:42,838 INFO ]: Start isEmpty. Operand 12 states. [2018-06-24 21:21:42,848 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:21:42,848 INFO ]: Found error trace [2018-06-24 21:21:42,849 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:21:42,849 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:42,854 INFO ]: Analyzing trace with hash 1275369, now seen corresponding path program 1 times [2018-06-24 21:21:42,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:42,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:42,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:42,892 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:42,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:42,919 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:42,969 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:21:42,970 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:42,970 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:42,971 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:42,981 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:42,982 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:42,983 INFO ]: Start difference. First operand 12 states. Second operand 3 states. [2018-06-24 21:21:43,267 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:43,267 INFO ]: Finished difference Result 21 states and 36 transitions. [2018-06-24 21:21:43,268 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:43,269 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:21:43,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:43,278 INFO ]: With dead ends: 21 [2018-06-24 21:21:43,278 INFO ]: Without dead ends: 21 [2018-06-24 21:21:43,280 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:21:43,292 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:21:43,324 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 21:21:43,325 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:21:43,328 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-06-24 21:21:43,329 INFO ]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 4 [2018-06-24 21:21:43,331 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:43,331 INFO ]: Abstraction has 21 states and 36 transitions. [2018-06-24 21:21:43,331 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:43,331 INFO ]: Start isEmpty. Operand 21 states and 36 transitions. [2018-06-24 21:21:43,332 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:21:43,332 INFO ]: Found error trace [2018-06-24 21:21:43,332 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:21:43,333 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:43,333 INFO ]: Analyzing trace with hash 1276330, now seen corresponding path program 1 times [2018-06-24 21:21:43,333 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:43,333 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:43,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:43,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:43,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:43,345 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:43,419 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:21:43,420 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:43,420 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:43,421 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:43,421 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:43,421 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:43,421 INFO ]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. [2018-06-24 21:21:43,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:43,750 INFO ]: Finished difference Result 30 states and 53 transitions. [2018-06-24 21:21:43,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:43,751 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:21:43,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:43,752 INFO ]: With dead ends: 30 [2018-06-24 21:21:43,752 INFO ]: Without dead ends: 30 [2018-06-24 21:21:43,753 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:21:43,753 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 21:21:43,759 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 21:21:43,759 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 21:21:43,761 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2018-06-24 21:21:43,761 INFO ]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 4 [2018-06-24 21:21:43,761 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:43,761 INFO ]: Abstraction has 30 states and 53 transitions. [2018-06-24 21:21:43,761 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:43,761 INFO ]: Start isEmpty. Operand 30 states and 53 transitions. [2018-06-24 21:21:43,762 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:21:43,762 INFO ]: Found error trace [2018-06-24 21:21:43,762 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:21:43,762 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:43,762 INFO ]: Analyzing trace with hash 39737472, now seen corresponding path program 1 times [2018-06-24 21:21:43,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:43,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:43,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:43,763 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:43,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:43,769 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:43,793 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:21:43,793 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:43,793 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:43,793 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:43,793 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:43,793 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:43,793 INFO ]: Start difference. First operand 30 states and 53 transitions. Second operand 3 states. [2018-06-24 21:21:44,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:44,062 INFO ]: Finished difference Result 39 states and 71 transitions. [2018-06-24 21:21:44,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:44,064 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:21:44,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:44,065 INFO ]: With dead ends: 39 [2018-06-24 21:21:44,065 INFO ]: Without dead ends: 39 [2018-06-24 21:21:44,066 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:21:44,066 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 21:21:44,076 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 21:21:44,076 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 21:21:44,080 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2018-06-24 21:21:44,080 INFO ]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 5 [2018-06-24 21:21:44,080 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:44,080 INFO ]: Abstraction has 39 states and 71 transitions. [2018-06-24 21:21:44,080 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:44,080 INFO ]: Start isEmpty. Operand 39 states and 71 transitions. [2018-06-24 21:21:44,081 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:21:44,081 INFO ]: Found error trace [2018-06-24 21:21:44,081 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:21:44,081 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:44,082 INFO ]: Analyzing trace with hash 39767263, now seen corresponding path program 1 times [2018-06-24 21:21:44,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:44,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:44,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:44,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:44,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:44,100 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:44,128 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:21:44,128 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:44,128 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:21:44,128 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:44,128 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:44,128 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:44,129 INFO ]: Start difference. First operand 39 states and 71 transitions. Second operand 3 states. [2018-06-24 21:21:44,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:44,190 INFO ]: Finished difference Result 49 states and 92 transitions. [2018-06-24 21:21:44,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:44,191 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:21:44,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:44,195 INFO ]: With dead ends: 49 [2018-06-24 21:21:44,195 INFO ]: Without dead ends: 49 [2018-06-24 21:21:44,195 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:21:44,195 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 21:21:44,205 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-06-24 21:21:44,205 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 21:21:44,207 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2018-06-24 21:21:44,207 INFO ]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 5 [2018-06-24 21:21:44,207 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:44,207 INFO ]: Abstraction has 43 states and 75 transitions. [2018-06-24 21:21:44,207 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:44,207 INFO ]: Start isEmpty. Operand 43 states and 75 transitions. [2018-06-24 21:21:44,208 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:21:44,209 INFO ]: Found error trace [2018-06-24 21:21:44,209 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:44,209 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:44,209 INFO ]: Analyzing trace with hash 861311070, now seen corresponding path program 1 times [2018-06-24 21:21:44,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:44,209 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:44,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:44,210 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:44,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:44,228 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:44,306 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:21:44,306 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:44,306 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:21:44,306 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:21:44,306 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:21:44,306 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:21:44,306 INFO ]: Start difference. First operand 43 states and 75 transitions. Second operand 5 states. [2018-06-24 21:21:44,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:44,440 INFO ]: Finished difference Result 55 states and 97 transitions. [2018-06-24 21:21:44,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:21:44,440 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 21:21:44,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:44,441 INFO ]: With dead ends: 55 [2018-06-24 21:21:44,441 INFO ]: Without dead ends: 49 [2018-06-24 21:21:44,442 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:21:44,442 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 21:21:44,449 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-06-24 21:21:44,449 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-24 21:21:44,451 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2018-06-24 21:21:44,451 INFO ]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 9 [2018-06-24 21:21:44,451 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:44,451 INFO ]: Abstraction has 48 states and 81 transitions. [2018-06-24 21:21:44,451 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:21:44,451 INFO ]: Start isEmpty. Operand 48 states and 81 transitions. [2018-06-24 21:21:44,452 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:21:44,452 INFO ]: Found error trace [2018-06-24 21:21:44,453 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:44,453 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:44,453 INFO ]: Analyzing trace with hash -335963927, now seen corresponding path program 1 times [2018-06-24 21:21:44,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:44,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:44,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:44,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:44,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:44,469 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:44,534 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:21:44,534 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:44,534 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:21:44,534 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:21:44,534 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:21:44,534 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:21:44,534 INFO ]: Start difference. First operand 48 states and 81 transitions. Second operand 4 states. [2018-06-24 21:21:44,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:44,606 INFO ]: Finished difference Result 64 states and 110 transitions. [2018-06-24 21:21:44,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:21:44,608 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-24 21:21:44,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:44,610 INFO ]: With dead ends: 64 [2018-06-24 21:21:44,610 INFO ]: Without dead ends: 52 [2018-06-24 21:21:44,610 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:21:44,610 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 21:21:44,626 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-06-24 21:21:44,626 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-24 21:21:44,629 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-06-24 21:21:44,630 INFO ]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 9 [2018-06-24 21:21:44,630 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:44,630 INFO ]: Abstraction has 48 states and 77 transitions. [2018-06-24 21:21:44,630 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:21:44,630 INFO ]: Start isEmpty. Operand 48 states and 77 transitions. [2018-06-24 21:21:44,632 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:21:44,632 INFO ]: Found error trace [2018-06-24 21:21:44,632 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:44,632 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:44,632 INFO ]: Analyzing trace with hash -675471984, now seen corresponding path program 1 times [2018-06-24 21:21:44,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:44,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:44,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:44,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:44,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:44,663 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:44,939 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:21:44,939 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:44,940 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 21:21:44,942 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:21:44,942 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:21:44,942 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:21:44,943 INFO ]: Start difference. First operand 48 states and 77 transitions. Second operand 6 states. [2018-06-24 21:21:44,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:44,997 INFO ]: Finished difference Result 71 states and 126 transitions. [2018-06-24 21:21:44,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:21:44,997 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-24 21:21:44,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:45,000 INFO ]: With dead ends: 71 [2018-06-24 21:21:45,000 INFO ]: Without dead ends: 71 [2018-06-24 21:21:45,001 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:21:45,001 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-24 21:21:45,011 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-06-24 21:21:45,011 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-24 21:21:45,012 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 92 transitions. [2018-06-24 21:21:45,012 INFO ]: Start accepts. Automaton has 55 states and 92 transitions. Word has length 13 [2018-06-24 21:21:45,012 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:45,012 INFO ]: Abstraction has 55 states and 92 transitions. [2018-06-24 21:21:45,012 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:21:45,012 INFO ]: Start isEmpty. Operand 55 states and 92 transitions. [2018-06-24 21:21:45,014 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:21:45,014 INFO ]: Found error trace [2018-06-24 21:21:45,014 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:45,014 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:45,014 INFO ]: Analyzing trace with hash 1399728410, now seen corresponding path program 1 times [2018-06-24 21:21:45,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:45,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:45,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:45,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:45,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:45,032 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:45,101 INFO ]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:21:45,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:45,102 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:45,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:45,155 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:45,163 INFO ]: Computing forward predicates... [2018-06-24 21:21:45,204 INFO ]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:21:45,228 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:21:45,228 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2018-06-24 21:21:45,228 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:21:45,228 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:21:45,229 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:21:45,229 INFO ]: Start difference. First operand 55 states and 92 transitions. Second operand 5 states. [2018-06-24 21:21:45,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:45,265 INFO ]: Finished difference Result 55 states and 88 transitions. [2018-06-24 21:21:45,268 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:21:45,268 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-24 21:21:45,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:45,270 INFO ]: With dead ends: 55 [2018-06-24 21:21:45,270 INFO ]: Without dead ends: 55 [2018-06-24 21:21:45,270 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:21:45,270 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 21:21:45,276 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-06-24 21:21:45,276 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 21:21:45,277 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2018-06-24 21:21:45,277 INFO ]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 17 [2018-06-24 21:21:45,277 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:45,277 INFO ]: Abstraction has 50 states and 80 transitions. [2018-06-24 21:21:45,277 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:21:45,277 INFO ]: Start isEmpty. Operand 50 states and 80 transitions. [2018-06-24 21:21:45,279 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:21:45,279 INFO ]: Found error trace [2018-06-24 21:21:45,279 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:45,279 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:45,279 INFO ]: Analyzing trace with hash -1632484496, now seen corresponding path program 1 times [2018-06-24 21:21:45,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:45,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:45,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:45,280 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:45,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:45,289 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:45,441 INFO ]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:21:45,441 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:45,441 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:45,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:45,490 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:45,492 INFO ]: Computing forward predicates... [2018-06-24 21:21:45,593 INFO ]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:21:45,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:45,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-06-24 21:21:45,626 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:21:45,627 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:21:45,627 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:21:45,627 INFO ]: Start difference. First operand 50 states and 80 transitions. Second operand 8 states. [2018-06-24 21:21:46,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:46,149 INFO ]: Finished difference Result 57 states and 83 transitions. [2018-06-24 21:21:46,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:21:46,150 INFO ]: Start accepts. Automaton has 8 states. Word has length 18 [2018-06-24 21:21:46,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:46,151 INFO ]: With dead ends: 57 [2018-06-24 21:21:46,151 INFO ]: Without dead ends: 50 [2018-06-24 21:21:46,151 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:21:46,151 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 21:21:46,156 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-24 21:21:46,156 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 21:21:46,157 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2018-06-24 21:21:46,157 INFO ]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 18 [2018-06-24 21:21:46,157 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:46,157 INFO ]: Abstraction has 50 states and 74 transitions. [2018-06-24 21:21:46,157 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:21:46,157 INFO ]: Start isEmpty. Operand 50 states and 74 transitions. [2018-06-24 21:21:46,158 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:21:46,158 INFO ]: Found error trace [2018-06-24 21:21:46,158 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:46,158 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:46,158 INFO ]: Analyzing trace with hash -1229820290, now seen corresponding path program 1 times [2018-06-24 21:21:46,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:46,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:46,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:46,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:46,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:46,174 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:46,252 INFO ]: Checked inductivity of 23 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 21:21:46,252 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:46,252 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-24 21:21:46,258 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:46,296 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:46,298 INFO ]: Computing forward predicates... [2018-06-24 21:21:46,375 INFO ]: Checked inductivity of 23 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:21:46,395 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:46,395 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:21:46,395 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:21:46,395 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:21:46,396 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:21:46,396 INFO ]: Start difference. First operand 50 states and 74 transitions. Second operand 14 states. [2018-06-24 21:21:47,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:47,167 INFO ]: Finished difference Result 96 states and 188 transitions. [2018-06-24 21:21:47,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:21:47,167 INFO ]: Start accepts. Automaton has 14 states. Word has length 22 [2018-06-24 21:21:47,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:47,169 INFO ]: With dead ends: 96 [2018-06-24 21:21:47,169 INFO ]: Without dead ends: 96 [2018-06-24 21:21:47,169 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:21:47,169 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-24 21:21:47,183 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 71. [2018-06-24 21:21:47,183 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-24 21:21:47,184 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 117 transitions. [2018-06-24 21:21:47,184 INFO ]: Start accepts. Automaton has 71 states and 117 transitions. Word has length 22 [2018-06-24 21:21:47,185 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:47,185 INFO ]: Abstraction has 71 states and 117 transitions. [2018-06-24 21:21:47,185 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:21:47,185 INFO ]: Start isEmpty. Operand 71 states and 117 transitions. [2018-06-24 21:21:47,186 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:21:47,186 INFO ]: Found error trace [2018-06-24 21:21:47,186 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:47,186 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:47,186 INFO ]: Analyzing trace with hash 1040728372, now seen corresponding path program 1 times [2018-06-24 21:21:47,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:47,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:47,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:47,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:47,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:47,204 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:47,241 INFO ]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-24 21:21:47,241 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:21:47,242 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:21:47,242 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:21:47,242 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:21:47,242 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:21:47,242 INFO ]: Start difference. First operand 71 states and 117 transitions. Second operand 4 states. [2018-06-24 21:21:47,248 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:47,248 INFO ]: Finished difference Result 29 states and 35 transitions. [2018-06-24 21:21:47,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:21:47,248 INFO ]: Start accepts. Automaton has 4 states. Word has length 26 [2018-06-24 21:21:47,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:47,248 INFO ]: With dead ends: 29 [2018-06-24 21:21:47,248 INFO ]: Without dead ends: 0 [2018-06-24 21:21:47,249 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:21:47,249 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:21:47,249 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:21:47,249 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:21:47,249 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:21:47,249 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-06-24 21:21:47,249 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:47,249 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:21:47,249 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:21:47,249 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:21:47,249 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:21:47,251 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:21:47,252 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:21:47 BasicIcfg [2018-06-24 21:21:47,252 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:21:47,253 INFO ]: Toolchain (without parser) took 5189.56 ms. Allocated memory was 303.0 MB in the beginning and 340.8 MB in the end (delta: 37.7 MB). Free memory was 258.6 MB in the beginning and 239.0 MB in the end (delta: 19.5 MB). Peak memory consumption was 57.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:47,254 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:21:47,254 INFO ]: ChcToBoogie took 46.65 ms. Allocated memory is still 303.0 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:47,255 INFO ]: Boogie Preprocessor took 43.38 ms. Allocated memory is still 303.0 MB. Free memory was 255.6 MB in the beginning and 254.6 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-24 21:21:47,255 INFO ]: RCFGBuilder took 378.75 ms. Allocated memory is still 303.0 MB. Free memory was 254.6 MB in the beginning and 242.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:47,256 INFO ]: BlockEncodingV2 took 219.72 ms. Allocated memory is still 303.0 MB. Free memory was 242.6 MB in the beginning and 232.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:47,256 INFO ]: TraceAbstraction took 4491.74 ms. Allocated memory was 303.0 MB in the beginning and 340.8 MB in the end (delta: 37.7 MB). Free memory was 232.6 MB in the beginning and 239.0 MB in the end (delta: -6.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:47,260 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 26 locations, 36 edges - StatisticsResult: Encoded RCFG 12 locations, 21 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 46.65 ms. Allocated memory is still 303.0 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.38 ms. Allocated memory is still 303.0 MB. Free memory was 255.6 MB in the beginning and 254.6 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 378.75 ms. Allocated memory is still 303.0 MB. Free memory was 254.6 MB in the beginning and 242.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 219.72 ms. Allocated memory is still 303.0 MB. Free memory was 242.6 MB in the beginning and 232.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4491.74 ms. Allocated memory was 303.0 MB in the beginning and 340.8 MB in the end (delta: 37.7 MB). Free memory was 232.6 MB in the beginning and 239.0 MB in the end (delta: -6.4 MB). Peak memory consumption was 31.3 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, 12 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 261 SDtfs, 122 SDslu, 441 SDs, 0 SdLazy, 678 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=10, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 57 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 4939 SizeOfPredicates, 14 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 139/147 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/lock.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-21-47-272.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lock.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-21-47-272.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lock.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-21-47-272.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lock.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-21-47-272.csv Received shutdown request...