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/sally-chc-benchmarks/misc/Ex3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 22:20:42,101 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 22:20:42,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 22:20:42,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 22:20:42,121 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 22:20:42,122 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 22:20:42,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 22:20:42,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 22:20:42,130 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 22:20:42,132 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 22:20:42,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 22:20:42,133 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 22:20:42,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 22:20:42,138 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 22:20:42,139 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 22:20:42,140 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 22:20:42,141 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 22:20:42,155 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 22:20:42,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 22:20:42,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 22:20:42,159 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 22:20:42,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 22:20:42,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 22:20:42,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 22:20:42,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 22:20:42,170 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 22:20:42,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 22:20:42,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 22:20:42,172 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 22:20:42,172 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 22:20:42,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 22:20:42,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 22:20:42,178 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 22:20:42,179 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 22:20:42,180 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 22:20:42,180 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 22:20:42,204 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 22:20:42,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 22:20:42,204 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 22:20:42,204 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 22:20:42,205 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 22:20:42,206 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 22:20:42,206 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 22:20:42,206 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 22:20:42,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 22:20:42,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 22:20:42,208 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 22:20:42,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 22:20:42,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 22:20:42,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 22:20:42,209 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 22:20:42,209 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 22:20:42,209 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 22:20:42,209 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 22:20:42,210 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 22:20:42,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 22:20:42,210 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 22:20:42,211 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 22:20:42,212 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 22:20:42,262 INFO ]: Repository-Root is: /tmp [2018-06-24 22:20:42,281 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 22:20:42,287 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 22:20:42,288 INFO ]: Initializing SmtParser... [2018-06-24 22:20:42,289 INFO ]: SmtParser initialized [2018-06-24 22:20:42,289 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/sally-chc-benchmarks/misc/Ex3.smt2 [2018-06-24 22:20:42,290 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 22:20:42,375 INFO ]: Executing SMT file /storage/chc-comp/sally-chc-benchmarks/misc/Ex3.smt2 unknown [2018-06-24 22:20:42,582 INFO ]: Succesfully executed SMT file /storage/chc-comp/sally-chc-benchmarks/misc/Ex3.smt2 [2018-06-24 22:20:42,587 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 22:20:42,593 INFO ]: Walking toolchain with 5 elements. [2018-06-24 22:20:42,593 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 22:20:42,593 INFO ]: Initializing ChcToBoogie... [2018-06-24 22:20:42,594 INFO ]: ChcToBoogie initialized [2018-06-24 22:20:42,597 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:20:42" (1/1) ... [2018-06-24 22:20:42,653 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:42 Unit [2018-06-24 22:20:42,653 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 22:20:42,654 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 22:20:42,654 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 22:20:42,654 INFO ]: Boogie Preprocessor initialized [2018-06-24 22:20:42,674 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:42" (1/1) ... [2018-06-24 22:20:42,674 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:42" (1/1) ... [2018-06-24 22:20:42,681 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:42" (1/1) ... [2018-06-24 22:20:42,681 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:42" (1/1) ... [2018-06-24 22:20:42,685 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:42" (1/1) ... [2018-06-24 22:20:42,686 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:42" (1/1) ... [2018-06-24 22:20:42,687 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:42" (1/1) ... [2018-06-24 22:20:42,689 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 22:20:42,690 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 22:20:42,690 INFO ]: Initializing RCFGBuilder... [2018-06-24 22:20:42,690 INFO ]: RCFGBuilder initialized [2018-06-24 22:20:42,691 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20: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) [2018-06-24 22:20:42,706 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 22:20:42,706 INFO ]: Found specification of procedure gotoProc [2018-06-24 22:20:42,706 INFO ]: Found implementation of procedure gotoProc [2018-06-24 22:20:42,706 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 22:20:42,706 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 22:20:42,706 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 22:20:42,958 INFO ]: Using library mode [2018-06-24 22:20:42,958 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:20:42 BoogieIcfgContainer [2018-06-24 22:20:42,958 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 22:20:42,959 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 22:20:42,959 INFO ]: Initializing BlockEncodingV2... [2018-06-24 22:20:42,967 INFO ]: BlockEncodingV2 initialized [2018-06-24 22:20:42,967 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:20:42" (1/1) ... [2018-06-24 22:20:42,996 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 22:20:42,997 INFO ]: Using Remove infeasible edges [2018-06-24 22:20:42,998 INFO ]: Using Maximize final states [2018-06-24 22:20:42,998 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 22:20:42,998 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 22:20:43,000 INFO ]: Using Remove sink states [2018-06-24 22:20:43,001 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 22:20:43,001 INFO ]: Using Use SBE [2018-06-24 22:20:43,030 INFO ]: SBE split 2 edges [2018-06-24 22:20:43,035 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 22:20:43,036 INFO ]: 0 new accepting states [2018-06-24 22:20:43,081 INFO ]: Removed 5 edges and 2 locations by large block encoding [2018-06-24 22:20:43,082 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:20:43,084 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 22:20:43,084 INFO ]: 0 new accepting states [2018-06-24 22:20:43,084 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 22:20:43,084 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:20:43,084 INFO ]: Encoded RCFG 6 locations, 10 edges [2018-06-24 22:20:43,085 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:20:43 BasicIcfg [2018-06-24 22:20:43,085 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 22:20:43,086 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 22:20:43,086 INFO ]: Initializing TraceAbstraction... [2018-06-24 22:20:43,091 INFO ]: TraceAbstraction initialized [2018-06-24 22:20:43,092 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:20:42" (1/4) ... [2018-06-24 22:20:43,093 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cafd957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 10:20:43, skipping insertion in model container [2018-06-24 22:20:43,093 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:42" (2/4) ... [2018-06-24 22:20:43,093 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cafd957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 10:20:43, skipping insertion in model container [2018-06-24 22:20:43,093 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:20:42" (3/4) ... [2018-06-24 22:20:43,093 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cafd957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:20:43, skipping insertion in model container [2018-06-24 22:20:43,093 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:20:43" (4/4) ... [2018-06-24 22:20:43,095 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 22:20:43,107 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 22:20:43,131 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 22:20:43,180 INFO ]: Using default assertion order modulation [2018-06-24 22:20:43,181 INFO ]: Interprodecural is true [2018-06-24 22:20:43,181 INFO ]: Hoare is false [2018-06-24 22:20:43,181 INFO ]: Compute interpolants for FPandBP [2018-06-24 22:20:43,181 INFO ]: Backedges is TWOTRACK [2018-06-24 22:20:43,181 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 22:20:43,181 INFO ]: Difference is false [2018-06-24 22:20:43,181 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 22:20:43,181 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 22:20:43,189 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 22:20:43,200 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 22:20:43,200 INFO ]: Found error trace [2018-06-24 22:20:43,201 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 22:20:43,201 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:43,207 INFO ]: Analyzing trace with hash 35588035, now seen corresponding path program 1 times [2018-06-24 22:20:43,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:43,209 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:43,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:43,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:43,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:43,296 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:43,373 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:43,374 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:20:43,374 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:20:43,375 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:20:43,386 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:20:43,386 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:20:43,389 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 22:20:43,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:43,513 INFO ]: Finished difference Result 7 states and 14 transitions. [2018-06-24 22:20:43,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:20:43,517 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 22:20:43,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:43,524 INFO ]: With dead ends: 7 [2018-06-24 22:20:43,524 INFO ]: Without dead ends: 7 [2018-06-24 22:20:43,527 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 22:20:43,543 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 22:20:43,568 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 22:20:43,569 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 22:20:43,569 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2018-06-24 22:20:43,570 INFO ]: Start accepts. Automaton has 7 states and 14 transitions. Word has length 5 [2018-06-24 22:20:43,571 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:43,571 INFO ]: Abstraction has 7 states and 14 transitions. [2018-06-24 22:20:43,571 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:20:43,571 INFO ]: Start isEmpty. Operand 7 states and 14 transitions. [2018-06-24 22:20:43,571 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 22:20:43,571 INFO ]: Found error trace [2018-06-24 22:20:43,571 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 22:20:43,571 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:43,571 INFO ]: Analyzing trace with hash 35617826, now seen corresponding path program 1 times [2018-06-24 22:20:43,571 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:43,571 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:43,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:43,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:43,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:43,589 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:43,616 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:43,616 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:20:43,616 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:20:43,617 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:20:43,617 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:20:43,618 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:20:43,618 INFO ]: Start difference. First operand 7 states and 14 transitions. Second operand 3 states. [2018-06-24 22:20:43,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:43,694 INFO ]: Finished difference Result 8 states and 18 transitions. [2018-06-24 22:20:43,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:20:43,695 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 22:20:43,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:43,695 INFO ]: With dead ends: 8 [2018-06-24 22:20:43,695 INFO ]: Without dead ends: 8 [2018-06-24 22:20:43,696 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 22:20:43,696 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 22:20:43,697 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 22:20:43,697 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 22:20:43,698 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-06-24 22:20:43,698 INFO ]: Start accepts. Automaton has 8 states and 18 transitions. Word has length 5 [2018-06-24 22:20:43,698 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:43,698 INFO ]: Abstraction has 8 states and 18 transitions. [2018-06-24 22:20:43,698 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:20:43,698 INFO ]: Start isEmpty. Operand 8 states and 18 transitions. [2018-06-24 22:20:43,698 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:20:43,698 INFO ]: Found error trace [2018-06-24 22:20:43,698 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:20:43,698 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:43,698 INFO ]: Analyzing trace with hash 1103088938, now seen corresponding path program 1 times [2018-06-24 22:20:43,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:43,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:43,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:43,699 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:43,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:43,726 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:43,802 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:43,803 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:20:43,803 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 22:20:43,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:43,860 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:43,868 INFO ]: Computing forward predicates... [2018-06-24 22:20:43,895 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:43,925 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:20:43,925 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 22:20:43,926 INFO ]: Interpolant automaton has 4 states [2018-06-24 22:20:43,926 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 22:20:43,926 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:20:43,926 INFO ]: Start difference. First operand 8 states and 18 transitions. Second operand 4 states. [2018-06-24 22:20:44,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:44,166 INFO ]: Finished difference Result 10 states and 26 transitions. [2018-06-24 22:20:44,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 22:20:44,167 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 22:20:44,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:44,167 INFO ]: With dead ends: 10 [2018-06-24 22:20:44,167 INFO ]: Without dead ends: 10 [2018-06-24 22:20:44,168 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:20:44,168 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 22:20:44,169 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-24 22:20:44,169 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 22:20:44,170 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2018-06-24 22:20:44,170 INFO ]: Start accepts. Automaton has 9 states and 22 transitions. Word has length 6 [2018-06-24 22:20:44,170 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:44,170 INFO ]: Abstraction has 9 states and 22 transitions. [2018-06-24 22:20:44,170 INFO ]: Interpolant automaton has 4 states. [2018-06-24 22:20:44,170 INFO ]: Start isEmpty. Operand 9 states and 22 transitions. [2018-06-24 22:20:44,170 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:20:44,170 INFO ]: Found error trace [2018-06-24 22:20:44,170 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:20:44,171 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:44,172 INFO ]: Analyzing trace with hash 1104072041, now seen corresponding path program 1 times [2018-06-24 22:20:44,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:44,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:44,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:44,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:44,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:44,186 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:44,251 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:44,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:20:44,251 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 22:20:44,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:44,294 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:44,296 INFO ]: Computing forward predicates... [2018-06-24 22:20:44,313 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:44,333 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:20:44,333 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 22:20:44,333 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:20:44,333 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:20:44,333 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:20:44,333 INFO ]: Start difference. First operand 9 states and 22 transitions. Second operand 5 states. [2018-06-24 22:20:44,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:44,592 INFO ]: Finished difference Result 12 states and 34 transitions. [2018-06-24 22:20:44,592 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:20:44,592 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 22:20:44,592 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:44,593 INFO ]: With dead ends: 12 [2018-06-24 22:20:44,593 INFO ]: Without dead ends: 12 [2018-06-24 22:20:44,593 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:20:44,593 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 22:20:44,595 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 22:20:44,595 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 22:20:44,596 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-06-24 22:20:44,596 INFO ]: Start accepts. Automaton has 10 states and 26 transitions. Word has length 6 [2018-06-24 22:20:44,596 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:44,596 INFO ]: Abstraction has 10 states and 26 transitions. [2018-06-24 22:20:44,596 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:20:44,596 INFO ]: Start isEmpty. Operand 10 states and 26 transitions. [2018-06-24 22:20:44,596 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 22:20:44,596 INFO ]: Found error trace [2018-06-24 22:20:44,596 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 22:20:44,596 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:44,596 INFO ]: Analyzing trace with hash -164121437, now seen corresponding path program 2 times [2018-06-24 22:20:44,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:44,597 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:44,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:44,597 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:44,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:44,622 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:44,694 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:44,694 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:20:44,694 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:20:44,694 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:20:44,694 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:20:44,694 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:20:44,695 INFO ]: Start difference. First operand 10 states and 26 transitions. Second operand 3 states. [2018-06-24 22:20:44,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:44,744 INFO ]: Finished difference Result 16 states and 43 transitions. [2018-06-24 22:20:44,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:20:44,744 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 22:20:44,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:44,746 INFO ]: With dead ends: 16 [2018-06-24 22:20:44,746 INFO ]: Without dead ends: 16 [2018-06-24 22:20:44,746 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 22:20:44,746 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 22:20:44,750 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-24 22:20:44,750 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 22:20:44,751 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2018-06-24 22:20:44,751 INFO ]: Start accepts. Automaton has 15 states and 42 transitions. Word has length 7 [2018-06-24 22:20:44,751 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:44,751 INFO ]: Abstraction has 15 states and 42 transitions. [2018-06-24 22:20:44,751 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:20:44,751 INFO ]: Start isEmpty. Operand 15 states and 42 transitions. [2018-06-24 22:20:44,751 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 22:20:44,751 INFO ]: Found error trace [2018-06-24 22:20:44,751 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 22:20:44,751 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:44,751 INFO ]: Analyzing trace with hash -133585662, now seen corresponding path program 2 times [2018-06-24 22:20:44,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:44,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:44,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:44,752 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:20:44,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:44,769 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:44,811 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:44,812 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:20:44,812 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:20:44,812 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:20:44,812 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:20:44,812 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:20:44,812 INFO ]: Start difference. First operand 15 states and 42 transitions. Second operand 3 states. [2018-06-24 22:20:44,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:44,842 INFO ]: Finished difference Result 22 states and 58 transitions. [2018-06-24 22:20:44,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:20:44,842 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 22:20:44,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:44,843 INFO ]: With dead ends: 22 [2018-06-24 22:20:44,843 INFO ]: Without dead ends: 22 [2018-06-24 22:20:44,843 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 22:20:44,843 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 22:20:44,846 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-24 22:20:44,846 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 22:20:44,847 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2018-06-24 22:20:44,847 INFO ]: Start accepts. Automaton has 21 states and 57 transitions. Word has length 7 [2018-06-24 22:20:44,847 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:44,847 INFO ]: Abstraction has 21 states and 57 transitions. [2018-06-24 22:20:44,847 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:20:44,847 INFO ]: Start isEmpty. Operand 21 states and 57 transitions. [2018-06-24 22:20:44,847 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 22:20:44,847 INFO ]: Found error trace [2018-06-24 22:20:44,848 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 22:20:44,848 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:44,848 INFO ]: Analyzing trace with hash -793860919, now seen corresponding path program 1 times [2018-06-24 22:20:44,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:44,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:44,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:44,848 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:20:44,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:44,879 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:44,971 INFO ]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:20:44,971 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:20:44,971 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 22:20:44,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:45,027 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:45,034 INFO ]: Computing forward predicates... [2018-06-24 22:20:45,134 INFO ]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:20:45,154 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:20:45,154 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 22:20:45,154 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:20:45,155 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:20:45,155 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:20:45,155 INFO ]: Start difference. First operand 21 states and 57 transitions. Second operand 5 states. [2018-06-24 22:20:45,343 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-24 22:20:45,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:45,581 INFO ]: Finished difference Result 36 states and 101 transitions. [2018-06-24 22:20:45,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:20:45,581 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 22:20:45,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:45,582 INFO ]: With dead ends: 36 [2018-06-24 22:20:45,582 INFO ]: Without dead ends: 36 [2018-06-24 22:20:45,583 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:20:45,583 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 22:20:45,587 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-06-24 22:20:45,587 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 22:20:45,588 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 100 transitions. [2018-06-24 22:20:45,588 INFO ]: Start accepts. Automaton has 35 states and 100 transitions. Word has length 8 [2018-06-24 22:20:45,588 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:45,588 INFO ]: Abstraction has 35 states and 100 transitions. [2018-06-24 22:20:45,588 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:20:45,588 INFO ]: Start isEmpty. Operand 35 states and 100 transitions. [2018-06-24 22:20:45,589 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 22:20:45,589 INFO ]: Found error trace [2018-06-24 22:20:45,589 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 22:20:45,589 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:45,589 INFO ]: Analyzing trace with hash -792013877, now seen corresponding path program 1 times [2018-06-24 22:20:45,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:45,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:45,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:45,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:45,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:45,610 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:45,697 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:45,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:20:45,697 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:20:45,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:45,754 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:45,756 INFO ]: Computing forward predicates... [2018-06-24 22:20:45,885 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:45,915 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:20:45,915 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 22:20:45,915 INFO ]: Interpolant automaton has 6 states [2018-06-24 22:20:45,915 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 22:20:45,915 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 22:20:45,916 INFO ]: Start difference. First operand 35 states and 100 transitions. Second operand 6 states. [2018-06-24 22:20:46,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:46,140 INFO ]: Finished difference Result 48 states and 137 transitions. [2018-06-24 22:20:46,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 22:20:46,141 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 22:20:46,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:46,142 INFO ]: With dead ends: 48 [2018-06-24 22:20:46,142 INFO ]: Without dead ends: 48 [2018-06-24 22:20:46,142 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-24 22:20:46,142 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 22:20:46,148 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 31. [2018-06-24 22:20:46,148 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 22:20:46,150 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 89 transitions. [2018-06-24 22:20:46,150 INFO ]: Start accepts. Automaton has 31 states and 89 transitions. Word has length 8 [2018-06-24 22:20:46,150 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:46,150 INFO ]: Abstraction has 31 states and 89 transitions. [2018-06-24 22:20:46,150 INFO ]: Interpolant automaton has 6 states. [2018-06-24 22:20:46,150 INFO ]: Start isEmpty. Operand 31 states and 89 transitions. [2018-06-24 22:20:46,151 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 22:20:46,151 INFO ]: Found error trace [2018-06-24 22:20:46,151 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 22:20:46,151 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:46,151 INFO ]: Analyzing trace with hash 150960646, now seen corresponding path program 1 times [2018-06-24 22:20:46,151 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:46,151 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:46,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:46,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:46,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:46,169 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:46,219 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:46,219 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:20:46,219 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:20:46,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:46,275 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:46,277 INFO ]: Computing forward predicates... [2018-06-24 22:20:46,284 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:46,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:20:46,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 22:20:46,304 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:20:46,304 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:20:46,304 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:20:46,304 INFO ]: Start difference. First operand 31 states and 89 transitions. Second operand 5 states. [2018-06-24 22:20:46,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:46,467 INFO ]: Finished difference Result 46 states and 134 transitions. [2018-06-24 22:20:46,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 22:20:46,468 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 22:20:46,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:46,469 INFO ]: With dead ends: 46 [2018-06-24 22:20:46,469 INFO ]: Without dead ends: 46 [2018-06-24 22:20:46,469 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:20:46,469 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 22:20:46,474 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-06-24 22:20:46,474 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 22:20:46,475 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 129 transitions. [2018-06-24 22:20:46,475 INFO ]: Start accepts. Automaton has 43 states and 129 transitions. Word has length 8 [2018-06-24 22:20:46,475 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:46,475 INFO ]: Abstraction has 43 states and 129 transitions. [2018-06-24 22:20:46,475 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:20:46,475 INFO ]: Start isEmpty. Operand 43 states and 129 transitions. [2018-06-24 22:20:46,477 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 22:20:46,477 INFO ]: Found error trace [2018-06-24 22:20:46,478 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:20:46,478 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:46,478 INFO ]: Analyzing trace with hash 1160034722, now seen corresponding path program 1 times [2018-06-24 22:20:46,478 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:46,478 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:46,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:46,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:46,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:46,508 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:46,617 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:20:46,617 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:20:46,617 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:20:46,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:46,659 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:46,662 INFO ]: Computing forward predicates... [2018-06-24 22:20:46,696 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 22:20:46,716 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:20:46,716 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-06-24 22:20:46,716 INFO ]: Interpolant automaton has 8 states [2018-06-24 22:20:46,716 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 22:20:46,716 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:20:46,717 INFO ]: Start difference. First operand 43 states and 129 transitions. Second operand 8 states. [2018-06-24 22:20:46,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:46,802 INFO ]: Finished difference Result 65 states and 199 transitions. [2018-06-24 22:20:46,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 22:20:46,803 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 22:20:46,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:46,804 INFO ]: With dead ends: 65 [2018-06-24 22:20:46,804 INFO ]: Without dead ends: 65 [2018-06-24 22:20:46,804 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-06-24 22:20:46,805 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-24 22:20:46,811 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-06-24 22:20:46,811 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 22:20:46,812 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 163 transitions. [2018-06-24 22:20:46,812 INFO ]: Start accepts. Automaton has 53 states and 163 transitions. Word has length 9 [2018-06-24 22:20:46,812 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:46,812 INFO ]: Abstraction has 53 states and 163 transitions. [2018-06-24 22:20:46,812 INFO ]: Interpolant automaton has 8 states. [2018-06-24 22:20:46,812 INFO ]: Start isEmpty. Operand 53 states and 163 transitions. [2018-06-24 22:20:46,813 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 22:20:46,813 INFO ]: Found error trace [2018-06-24 22:20:46,813 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:20:46,813 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:46,813 INFO ]: Analyzing trace with hash 384672583, now seen corresponding path program 1 times [2018-06-24 22:20:46,813 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:46,813 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:46,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:46,814 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:46,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:46,843 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:46,949 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:20:46,949 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:20:46,949 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:20:46,965 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:47,016 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:47,018 INFO ]: Computing forward predicates... [2018-06-24 22:20:47,028 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 22:20:47,060 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:20:47,060 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-06-24 22:20:47,060 INFO ]: Interpolant automaton has 6 states [2018-06-24 22:20:47,061 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 22:20:47,061 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-24 22:20:47,061 INFO ]: Start difference. First operand 53 states and 163 transitions. Second operand 6 states. [2018-06-24 22:20:47,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:47,139 INFO ]: Finished difference Result 75 states and 233 transitions. [2018-06-24 22:20:47,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:20:47,139 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 22:20:47,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:47,140 INFO ]: With dead ends: 75 [2018-06-24 22:20:47,140 INFO ]: Without dead ends: 75 [2018-06-24 22:20:47,141 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-24 22:20:47,141 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-24 22:20:47,147 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 63. [2018-06-24 22:20:47,147 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-24 22:20:47,149 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 197 transitions. [2018-06-24 22:20:47,149 INFO ]: Start accepts. Automaton has 63 states and 197 transitions. Word has length 9 [2018-06-24 22:20:47,149 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:47,149 INFO ]: Abstraction has 63 states and 197 transitions. [2018-06-24 22:20:47,149 INFO ]: Interpolant automaton has 6 states. [2018-06-24 22:20:47,149 INFO ]: Start isEmpty. Operand 63 states and 197 transitions. [2018-06-24 22:20:47,150 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:20:47,150 INFO ]: Found error trace [2018-06-24 22:20:47,150 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 22:20:47,150 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:47,150 INFO ]: Analyzing trace with hash -1988441693, now seen corresponding path program 2 times [2018-06-24 22:20:47,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:47,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:47,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:47,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:47,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:47,168 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:47,253 INFO ]: Checked inductivity of 21 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:20:47,253 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:20:47,253 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:20:47,259 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 22:20:47,306 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 22:20:47,306 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:47,308 INFO ]: Computing forward predicates... [2018-06-24 22:20:47,333 INFO ]: Checked inductivity of 21 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:20:47,353 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:20:47,353 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-24 22:20:47,353 INFO ]: Interpolant automaton has 9 states [2018-06-24 22:20:47,354 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 22:20:47,354 INFO ]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-24 22:20:47,354 INFO ]: Start difference. First operand 63 states and 197 transitions. Second operand 9 states. [2018-06-24 22:20:47,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:47,522 INFO ]: Finished difference Result 112 states and 281 transitions. [2018-06-24 22:20:47,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 22:20:47,522 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 22:20:47,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:47,523 INFO ]: With dead ends: 112 [2018-06-24 22:20:47,523 INFO ]: Without dead ends: 96 [2018-06-24 22:20:47,524 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-06-24 22:20:47,524 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-24 22:20:47,539 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 72. [2018-06-24 22:20:47,539 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-24 22:20:47,540 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 181 transitions. [2018-06-24 22:20:47,540 INFO ]: Start accepts. Automaton has 72 states and 181 transitions. Word has length 11 [2018-06-24 22:20:47,540 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:47,540 INFO ]: Abstraction has 72 states and 181 transitions. [2018-06-24 22:20:47,540 INFO ]: Interpolant automaton has 9 states. [2018-06-24 22:20:47,540 INFO ]: Start isEmpty. Operand 72 states and 181 transitions. [2018-06-24 22:20:47,541 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:20:47,541 INFO ]: Found error trace [2018-06-24 22:20:47,541 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:20:47,541 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:47,541 INFO ]: Analyzing trace with hash 1498966437, now seen corresponding path program 1 times [2018-06-24 22:20:47,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:47,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:47,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:47,542 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:20:47,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:47,567 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:47,727 INFO ]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:20:47,727 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:20:47,727 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:20:47,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:47,777 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:47,779 INFO ]: Computing forward predicates... [2018-06-24 22:20:47,882 INFO ]: Checked inductivity of 21 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:20:47,902 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:20:47,902 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-24 22:20:47,902 INFO ]: Interpolant automaton has 9 states [2018-06-24 22:20:47,902 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 22:20:47,902 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-24 22:20:47,903 INFO ]: Start difference. First operand 72 states and 181 transitions. Second operand 9 states. [2018-06-24 22:20:48,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:48,224 INFO ]: Finished difference Result 86 states and 189 transitions. [2018-06-24 22:20:48,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 22:20:48,224 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 22:20:48,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:48,225 INFO ]: With dead ends: 86 [2018-06-24 22:20:48,225 INFO ]: Without dead ends: 59 [2018-06-24 22:20:48,226 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-06-24 22:20:48,226 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-24 22:20:48,230 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-06-24 22:20:48,230 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 22:20:48,231 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 94 transitions. [2018-06-24 22:20:48,231 INFO ]: Start accepts. Automaton has 42 states and 94 transitions. Word has length 11 [2018-06-24 22:20:48,231 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:48,231 INFO ]: Abstraction has 42 states and 94 transitions. [2018-06-24 22:20:48,231 INFO ]: Interpolant automaton has 9 states. [2018-06-24 22:20:48,231 INFO ]: Start isEmpty. Operand 42 states and 94 transitions. [2018-06-24 22:20:48,232 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:20:48,232 INFO ]: Found error trace [2018-06-24 22:20:48,232 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:20:48,232 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:48,232 INFO ]: Analyzing trace with hash 327368836, now seen corresponding path program 1 times [2018-06-24 22:20:48,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:48,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:48,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:48,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:48,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:48,249 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:48,361 INFO ]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:20:48,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:20:48,361 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:20:48,367 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:48,419 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:48,422 INFO ]: Computing forward predicates... [2018-06-24 22:20:48,518 INFO ]: Checked inductivity of 21 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:20:48,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:20:48,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-24 22:20:48,551 INFO ]: Interpolant automaton has 9 states [2018-06-24 22:20:48,551 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 22:20:48,551 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-24 22:20:48,551 INFO ]: Start difference. First operand 42 states and 94 transitions. Second operand 9 states. [2018-06-24 22:20:48,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:48,740 INFO ]: Finished difference Result 27 states and 47 transitions. [2018-06-24 22:20:48,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 22:20:48,740 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 22:20:48,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:48,740 INFO ]: With dead ends: 27 [2018-06-24 22:20:48,740 INFO ]: Without dead ends: 0 [2018-06-24 22:20:48,741 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-06-24 22:20:48,741 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 22:20:48,741 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 22:20:48,741 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 22:20:48,741 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 22:20:48,741 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-06-24 22:20:48,741 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:48,741 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 22:20:48,741 INFO ]: Interpolant automaton has 9 states. [2018-06-24 22:20:48,741 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 22:20:48,741 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 22:20:48,743 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 22:20:48,744 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:20:48 BasicIcfg [2018-06-24 22:20:48,744 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 22:20:48,745 INFO ]: Toolchain (without parser) took 6157.50 ms. Allocated memory was 309.3 MB in the beginning and 368.1 MB in the end (delta: 58.7 MB). Free memory was 263.7 MB in the beginning and 272.8 MB in the end (delta: -9.1 MB). Peak memory consumption was 49.7 MB. Max. memory is 3.6 GB. [2018-06-24 22:20:48,746 INFO ]: SmtParser took 0.07 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-24 22:20:48,746 INFO ]: ChcToBoogie took 60.09 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:20:48,747 INFO ]: Boogie Preprocessor took 35.60 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-24 22:20:48,747 INFO ]: RCFGBuilder took 268.64 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 251.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:20:48,748 INFO ]: BlockEncodingV2 took 126.07 ms. Allocated memory is still 309.3 MB. Free memory was 251.7 MB in the beginning and 247.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:20:48,748 INFO ]: TraceAbstraction took 5658.27 ms. Allocated memory was 309.3 MB in the beginning and 368.1 MB in the end (delta: 58.7 MB). Free memory was 247.8 MB in the beginning and 272.8 MB in the end (delta: -25.0 MB). Peak memory consumption was 33.7 MB. Max. memory is 3.6 GB. [2018-06-24 22:20:48,752 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.09 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.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 35.60 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. * RCFGBuilder took 268.64 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 251.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 126.07 ms. Allocated memory is still 309.3 MB. Free memory was 251.7 MB in the beginning and 247.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5658.27 ms. Allocated memory was 309.3 MB in the beginning and 368.1 MB in the end (delta: 58.7 MB). Free memory was 247.8 MB in the beginning and 272.8 MB in the end (delta: -25.0 MB). Peak memory consumption was 33.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 5.5s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 86 SDtfs, 25 SDslu, 116 SDs, 0 SdLazy, 607 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 91 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 3260 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2938 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 24 InterpolantComputations, 4 PerfectInterpolantSequences, 136/212 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/Ex3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_22-20-48-763.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ex3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_22-20-48-763.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ex3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_22-20-48-763.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ex3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_22-20-48-763.csv Received shutdown request...