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-62c3406-m [2018-06-26 18:24:23,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:24:23,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:24:23,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:24:23,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:24:23,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:24:23,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:24:23,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:24:23,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:24:23,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:24:23,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:24:23,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:24:23,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:24:23,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:24:23,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:24:23,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:24:23,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:24:23,049 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:24:23,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:24:23,052 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:24:23,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:24:23,054 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:24:23,056 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:24:23,056 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:24:23,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:24:23,060 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:24:23,061 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:24:23,062 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:24:23,063 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:24:23,064 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:24:23,064 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:24:23,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:24:23,065 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:24:23,065 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:24:23,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:24:23,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:24:23,066 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:24:23,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:24:23,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:24:23,082 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:24:23,082 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:24:23,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:24:23,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:24:23,083 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:24:23,084 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:24:23,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:24:23,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:24:23,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:24:23,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:24:23,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:24:23,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:24:23,085 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:24:23,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:24:23,085 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:24:23,086 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:24:23,086 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:24:23,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:24:23,086 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:24:23,088 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:24:23,088 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:24:23,122 INFO ]: Repository-Root is: /tmp [2018-06-26 18:24:23,138 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:24:23,143 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:24:23,145 INFO ]: Initializing SmtParser... [2018-06-26 18:24:23,145 INFO ]: SmtParser initialized [2018-06-26 18:24:23,145 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/lock.smt2 [2018-06-26 18:24:23,147 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:24:23,234 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/lock.smt2 unknown [2018-06-26 18:24:23,497 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/lock.smt2 [2018-06-26 18:24:23,502 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:24:23,509 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:24:23,509 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:24:23,509 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:24:23,509 INFO ]: ChcToBoogie initialized [2018-06-26 18:24:23,513 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:24:23" (1/1) ... [2018-06-26 18:24:23,570 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:24:23 Unit [2018-06-26 18:24:23,570 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:24:23,571 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:24:23,571 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:24:23,571 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:24:23,587 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:24:23" (1/1) ... [2018-06-26 18:24:23,587 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:24:23" (1/1) ... [2018-06-26 18:24:23,592 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:24:23" (1/1) ... [2018-06-26 18:24:23,592 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:24:23" (1/1) ... [2018-06-26 18:24:23,595 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:24:23" (1/1) ... [2018-06-26 18:24:23,599 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:24:23" (1/1) ... [2018-06-26 18:24:23,599 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:24:23" (1/1) ... [2018-06-26 18:24:23,601 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:24:23,601 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:24:23,601 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:24:23,602 INFO ]: RCFGBuilder initialized [2018-06-26 18:24:23,602 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:24:23" (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-26 18:24:23,614 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:24:23,614 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:24:23,614 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:24:23,614 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:24:23,614 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:24:23,614 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 18:24:23,984 INFO ]: Using library mode [2018-06-26 18:24:23,985 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:24:23 BoogieIcfgContainer [2018-06-26 18:24:23,985 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:24:23,985 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:24:23,986 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:24:23,986 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:24:23,987 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:24:23" (1/1) ... [2018-06-26 18:24:24,000 INFO ]: Initial Icfg 26 locations, 36 edges [2018-06-26 18:24:24,001 INFO ]: Using Remove infeasible edges [2018-06-26 18:24:24,001 INFO ]: Using Maximize final states [2018-06-26 18:24:24,002 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:24:24,002 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:24:24,004 INFO ]: Using Remove sink states [2018-06-26 18:24:24,004 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:24:24,004 INFO ]: Using Use SBE [2018-06-26 18:24:24,012 INFO ]: SBE split 0 edges [2018-06-26 18:24:24,017 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 18:24:24,019 INFO ]: 0 new accepting states [2018-06-26 18:24:24,192 INFO ]: Removed 42 edges and 12 locations by large block encoding [2018-06-26 18:24:24,193 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:24:24,195 INFO ]: Removed 1 edges and 0 locations because of local infeasibility [2018-06-26 18:24:24,195 INFO ]: 0 new accepting states [2018-06-26 18:24:24,195 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:24:24,195 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:24:24,196 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:24:24,196 INFO ]: 0 new accepting states [2018-06-26 18:24:24,196 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:24:24,196 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:24:24,196 INFO ]: Encoded RCFG 12 locations, 21 edges [2018-06-26 18:24:24,196 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:24:24 BasicIcfg [2018-06-26 18:24:24,196 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:24:24,197 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:24:24,197 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:24:24,200 INFO ]: TraceAbstraction initialized [2018-06-26 18:24:24,201 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:24:23" (1/4) ... [2018-06-26 18:24:24,201 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b6577f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:24:24, skipping insertion in model container [2018-06-26 18:24:24,201 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:24:23" (2/4) ... [2018-06-26 18:24:24,202 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b6577f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:24:24, skipping insertion in model container [2018-06-26 18:24:24,202 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:24:23" (3/4) ... [2018-06-26 18:24:24,202 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b6577f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:24:24, skipping insertion in model container [2018-06-26 18:24:24,202 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:24:24" (4/4) ... [2018-06-26 18:24:24,204 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:24:24,213 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:24:24,220 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:24:24,264 INFO ]: Using default assertion order modulation [2018-06-26 18:24:24,265 INFO ]: Interprodecural is true [2018-06-26 18:24:24,265 INFO ]: Hoare is false [2018-06-26 18:24:24,265 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:24:24,265 INFO ]: Backedges is TWOTRACK [2018-06-26 18:24:24,265 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:24:24,265 INFO ]: Difference is false [2018-06-26 18:24:24,265 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:24:24,265 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:24:24,275 INFO ]: Start isEmpty. Operand 12 states. [2018-06-26 18:24:24,285 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 18:24:24,285 INFO ]: Found error trace [2018-06-26 18:24:24,286 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 18:24:24,286 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:24,290 INFO ]: Analyzing trace with hash 1275369, now seen corresponding path program 1 times [2018-06-26 18:24:24,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:24,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:24,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:24,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:24,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:24,359 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:24,408 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:24:24,410 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:24:24,410 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:24:24,411 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:24:24,421 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:24:24,421 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:24:24,424 INFO ]: Start difference. First operand 12 states. Second operand 3 states. [2018-06-26 18:24:24,756 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:24,756 INFO ]: Finished difference Result 21 states and 36 transitions. [2018-06-26 18:24:24,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:24:24,758 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 18:24:24,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:24,767 INFO ]: With dead ends: 21 [2018-06-26 18:24:24,768 INFO ]: Without dead ends: 21 [2018-06-26 18:24:24,770 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:24:24,783 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 18:24:24,808 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 18:24:24,809 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 18:24:24,811 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-06-26 18:24:24,812 INFO ]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 4 [2018-06-26 18:24:24,813 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:24,813 INFO ]: Abstraction has 21 states and 36 transitions. [2018-06-26 18:24:24,813 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:24:24,813 INFO ]: Start isEmpty. Operand 21 states and 36 transitions. [2018-06-26 18:24:24,814 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 18:24:24,814 INFO ]: Found error trace [2018-06-26 18:24:24,814 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 18:24:24,814 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:24,814 INFO ]: Analyzing trace with hash 1276330, now seen corresponding path program 1 times [2018-06-26 18:24:24,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:24,814 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:24,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:24,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:24,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:24,822 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:24,838 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:24:24,838 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:24:24,838 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:24:24,840 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:24:24,840 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:24:24,840 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:24:24,840 INFO ]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. [2018-06-26 18:24:25,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:25,053 INFO ]: Finished difference Result 30 states and 53 transitions. [2018-06-26 18:24:25,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:24:25,054 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 18:24:25,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:25,055 INFO ]: With dead ends: 30 [2018-06-26 18:24:25,055 INFO ]: Without dead ends: 30 [2018-06-26 18:24:25,056 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:24:25,056 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 18:24:25,062 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 18:24:25,062 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 18:24:25,064 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2018-06-26 18:24:25,064 INFO ]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 4 [2018-06-26 18:24:25,064 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:25,064 INFO ]: Abstraction has 30 states and 53 transitions. [2018-06-26 18:24:25,064 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:24:25,065 INFO ]: Start isEmpty. Operand 30 states and 53 transitions. [2018-06-26 18:24:25,066 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:24:25,066 INFO ]: Found error trace [2018-06-26 18:24:25,066 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:24:25,066 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:25,066 INFO ]: Analyzing trace with hash 39677890, now seen corresponding path program 1 times [2018-06-26 18:24:25,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:25,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:25,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:25,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:25,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:25,074 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:25,110 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:24:25,111 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:24:25,111 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:24:25,111 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:24:25,111 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:24:25,111 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:24:25,111 INFO ]: Start difference. First operand 30 states and 53 transitions. Second operand 3 states. [2018-06-26 18:24:25,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:25,375 INFO ]: Finished difference Result 39 states and 71 transitions. [2018-06-26 18:24:25,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:24:25,376 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:24:25,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:25,377 INFO ]: With dead ends: 39 [2018-06-26 18:24:25,377 INFO ]: Without dead ends: 39 [2018-06-26 18:24:25,377 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:24:25,378 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 18:24:25,389 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 18:24:25,389 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 18:24:25,391 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2018-06-26 18:24:25,391 INFO ]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 5 [2018-06-26 18:24:25,392 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:25,392 INFO ]: Abstraction has 39 states and 71 transitions. [2018-06-26 18:24:25,392 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:24:25,392 INFO ]: Start isEmpty. Operand 39 states and 71 transitions. [2018-06-26 18:24:25,396 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:24:25,396 INFO ]: Found error trace [2018-06-26 18:24:25,396 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:24:25,396 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:25,396 INFO ]: Analyzing trace with hash 39797054, now seen corresponding path program 1 times [2018-06-26 18:24:25,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:25,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:25,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:25,397 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:25,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:25,409 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:25,473 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:24:25,473 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:24:25,473 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:24:25,474 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:24:25,474 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:24:25,474 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:24:25,474 INFO ]: Start difference. First operand 39 states and 71 transitions. Second operand 3 states. [2018-06-26 18:24:25,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:25,508 INFO ]: Finished difference Result 49 states and 92 transitions. [2018-06-26 18:24:25,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:24:25,508 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:24:25,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:25,512 INFO ]: With dead ends: 49 [2018-06-26 18:24:25,512 INFO ]: Without dead ends: 49 [2018-06-26 18:24:25,512 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:24:25,512 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 18:24:25,521 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-06-26 18:24:25,522 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 18:24:25,524 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2018-06-26 18:24:25,524 INFO ]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 5 [2018-06-26 18:24:25,524 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:25,524 INFO ]: Abstraction has 43 states and 75 transitions. [2018-06-26 18:24:25,524 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:24:25,524 INFO ]: Start isEmpty. Operand 43 states and 75 transitions. [2018-06-26 18:24:25,526 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:24:25,526 INFO ]: Found error trace [2018-06-26 18:24:25,526 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:24:25,526 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:25,526 INFO ]: Analyzing trace with hash -881469474, now seen corresponding path program 1 times [2018-06-26 18:24:25,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:25,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:25,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:25,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:25,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:25,543 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:25,616 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:24:25,616 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:24:25,616 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:24:25,616 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:24:25,616 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:24:25,616 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:24:25,617 INFO ]: Start difference. First operand 43 states and 75 transitions. Second operand 5 states. [2018-06-26 18:24:25,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:25,744 INFO ]: Finished difference Result 55 states and 97 transitions. [2018-06-26 18:24:25,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:24:25,745 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 18:24:25,745 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:25,747 INFO ]: With dead ends: 55 [2018-06-26 18:24:25,747 INFO ]: Without dead ends: 49 [2018-06-26 18:24:25,747 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-26 18:24:25,747 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 18:24:25,754 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-06-26 18:24:25,754 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 18:24:25,755 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2018-06-26 18:24:25,755 INFO ]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 9 [2018-06-26 18:24:25,755 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:25,755 INFO ]: Abstraction has 48 states and 81 transitions. [2018-06-26 18:24:25,755 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:24:25,755 INFO ]: Start isEmpty. Operand 48 states and 81 transitions. [2018-06-26 18:24:25,757 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:24:25,757 INFO ]: Found error trace [2018-06-26 18:24:25,757 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:24:25,757 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:25,757 INFO ]: Analyzing trace with hash -1113113526, now seen corresponding path program 1 times [2018-06-26 18:24:25,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:25,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:25,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:25,758 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:25,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:25,777 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:25,843 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:24:25,843 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:24:25,843 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:24:25,843 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:24:25,843 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:24:25,843 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:24:25,843 INFO ]: Start difference. First operand 48 states and 81 transitions. Second operand 4 states. [2018-06-26 18:24:25,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:25,942 INFO ]: Finished difference Result 64 states and 110 transitions. [2018-06-26 18:24:25,944 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:24:25,944 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-26 18:24:25,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:25,946 INFO ]: With dead ends: 64 [2018-06-26 18:24:25,946 INFO ]: Without dead ends: 52 [2018-06-26 18:24:25,946 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-26 18:24:25,946 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-26 18:24:25,963 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-06-26 18:24:25,963 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 18:24:25,964 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-06-26 18:24:25,964 INFO ]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 9 [2018-06-26 18:24:25,964 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:25,964 INFO ]: Abstraction has 48 states and 77 transitions. [2018-06-26 18:24:25,964 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:24:25,964 INFO ]: Start isEmpty. Operand 48 states and 77 transitions. [2018-06-26 18:24:25,969 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:24:25,969 INFO ]: Found error trace [2018-06-26 18:24:25,969 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:24:25,969 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:25,970 INFO ]: Analyzing trace with hash -214984397, now seen corresponding path program 1 times [2018-06-26 18:24:25,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:25,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:25,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:25,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:25,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:25,994 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:26,244 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:24:26,244 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:24:26,244 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 18:24:26,245 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:24:26,245 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:24:26,245 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:24:26,245 INFO ]: Start difference. First operand 48 states and 77 transitions. Second operand 6 states. [2018-06-26 18:24:26,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:26,317 INFO ]: Finished difference Result 71 states and 126 transitions. [2018-06-26 18:24:26,317 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:24:26,317 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-26 18:24:26,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:26,319 INFO ]: With dead ends: 71 [2018-06-26 18:24:26,319 INFO ]: Without dead ends: 71 [2018-06-26 18:24:26,320 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-26 18:24:26,320 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-26 18:24:26,330 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-06-26 18:24:26,330 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-26 18:24:26,331 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 92 transitions. [2018-06-26 18:24:26,331 INFO ]: Start accepts. Automaton has 55 states and 92 transitions. Word has length 13 [2018-06-26 18:24:26,331 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:26,331 INFO ]: Abstraction has 55 states and 92 transitions. [2018-06-26 18:24:26,331 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:24:26,332 INFO ]: Start isEmpty. Operand 55 states and 92 transitions. [2018-06-26 18:24:26,333 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:24:26,333 INFO ]: Found error trace [2018-06-26 18:24:26,333 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:24:26,333 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:26,334 INFO ]: Analyzing trace with hash -1645178433, now seen corresponding path program 1 times [2018-06-26 18:24:26,334 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:26,334 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:26,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:26,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:26,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:26,347 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:26,423 INFO ]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:24:26,423 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:24:26,423 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:24:26,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:26,474 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:26,481 INFO ]: Computing forward predicates... [2018-06-26 18:24:26,507 INFO ]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:24:26,534 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:24:26,534 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2018-06-26 18:24:26,534 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:24:26,534 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:24:26,534 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:24:26,534 INFO ]: Start difference. First operand 55 states and 92 transitions. Second operand 5 states. [2018-06-26 18:24:26,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:26,560 INFO ]: Finished difference Result 55 states and 88 transitions. [2018-06-26 18:24:26,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:24:26,561 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-26 18:24:26,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:26,562 INFO ]: With dead ends: 55 [2018-06-26 18:24:26,562 INFO ]: Without dead ends: 55 [2018-06-26 18:24:26,563 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-26 18:24:26,563 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-26 18:24:26,570 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-06-26 18:24:26,571 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 18:24:26,572 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2018-06-26 18:24:26,572 INFO ]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 17 [2018-06-26 18:24:26,573 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:26,573 INFO ]: Abstraction has 50 states and 80 transitions. [2018-06-26 18:24:26,573 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:24:26,573 INFO ]: Start isEmpty. Operand 50 states and 80 transitions. [2018-06-26 18:24:26,574 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:24:26,574 INFO ]: Found error trace [2018-06-26 18:24:26,574 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:24:26,575 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:26,575 INFO ]: Analyzing trace with hash -1618448402, now seen corresponding path program 1 times [2018-06-26 18:24:26,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:26,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:26,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:26,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:26,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:26,589 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:26,650 INFO ]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:24:26,650 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:24:26,650 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:24:26,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:26,695 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:26,699 INFO ]: Computing forward predicates... [2018-06-26 18:24:26,871 INFO ]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:24:26,894 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:24:26,894 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-06-26 18:24:26,894 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:24:26,894 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:24:26,894 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:24:26,894 INFO ]: Start difference. First operand 50 states and 80 transitions. Second operand 7 states. [2018-06-26 18:24:27,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:27,448 INFO ]: Finished difference Result 75 states and 124 transitions. [2018-06-26 18:24:27,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:24:27,448 INFO ]: Start accepts. Automaton has 7 states. Word has length 18 [2018-06-26 18:24:27,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:27,449 INFO ]: With dead ends: 75 [2018-06-26 18:24:27,449 INFO ]: Without dead ends: 67 [2018-06-26 18:24:27,449 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:24:27,449 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-26 18:24:27,459 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-06-26 18:24:27,459 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 18:24:27,460 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2018-06-26 18:24:27,460 INFO ]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 18 [2018-06-26 18:24:27,460 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:27,460 INFO ]: Abstraction has 50 states and 74 transitions. [2018-06-26 18:24:27,460 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:24:27,460 INFO ]: Start isEmpty. Operand 50 states and 74 transitions. [2018-06-26 18:24:27,461 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:24:27,461 INFO ]: Found error trace [2018-06-26 18:24:27,461 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:24:27,461 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:27,462 INFO ]: Analyzing trace with hash 74088365, now seen corresponding path program 1 times [2018-06-26 18:24:27,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:27,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:27,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:27,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:27,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:27,481 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:27,552 INFO ]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-26 18:24:27,552 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:24:27,552 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:24:27,553 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:24:27,553 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:24:27,553 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:24:27,553 INFO ]: Start difference. First operand 50 states and 74 transitions. Second operand 4 states. [2018-06-26 18:24:27,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:27,557 INFO ]: Finished difference Result 29 states and 36 transitions. [2018-06-26 18:24:27,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:24:27,558 INFO ]: Start accepts. Automaton has 4 states. Word has length 26 [2018-06-26 18:24:27,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:27,558 INFO ]: With dead ends: 29 [2018-06-26 18:24:27,558 INFO ]: Without dead ends: 0 [2018-06-26 18:24:27,558 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:24:27,559 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 18:24:27,559 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 18:24:27,559 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 18:24:27,559 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 18:24:27,559 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-06-26 18:24:27,559 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:27,559 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 18:24:27,559 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:24:27,559 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 18:24:27,559 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 18:24:27,561 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:24:27,563 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:24:27 BasicIcfg [2018-06-26 18:24:27,563 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:24:27,563 INFO ]: Toolchain (without parser) took 4060.55 ms. Allocated memory was 309.3 MB in the beginning and 327.2 MB in the end (delta: 17.8 MB). Free memory was 261.7 MB in the beginning and 186.4 MB in the end (delta: 75.3 MB). Peak memory consumption was 93.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:24:27,565 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:24:27,565 INFO ]: ChcToBoogie took 61.44 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 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:24:27,566 INFO ]: Boogie Preprocessor took 29.76 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 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:24:27,566 INFO ]: RCFGBuilder took 383.70 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 245.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:24:27,567 INFO ]: BlockEncodingV2 took 210.97 ms. Allocated memory is still 309.3 MB. Free memory was 245.7 MB in the beginning and 235.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:24:27,567 INFO ]: TraceAbstraction took 3365.28 ms. Allocated memory was 309.3 MB in the beginning and 327.2 MB in the end (delta: 17.8 MB). Free memory was 235.8 MB in the beginning and 186.4 MB in the end (delta: 49.3 MB). Peak memory consumption was 67.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:24:27,571 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.06 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.44 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 29.76 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 383.70 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 245.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 210.97 ms. Allocated memory is still 309.3 MB. Free memory was 245.7 MB in the beginning and 235.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3365.28 ms. Allocated memory was 309.3 MB in the beginning and 327.2 MB in the end (delta: 17.8 MB). Free memory was 235.8 MB in the beginning and 186.4 MB in the end (delta: 49.3 MB). Peak memory consumption was 67.1 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, 3.3s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 225 SDtfs, 75 SDslu, 296 SDs, 0 SdLazy, 331 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=7, 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, 10 MinimizatonAttempts, 49 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 3401 SizeOfPredicates, 7 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 98/101 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-26_18-24-27-590.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-26_18-24-27-590.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-26_18-24-27-590.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-26_18-24-27-590.csv Received shutdown request...