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/vmt-chc-benchmarks/ctigar/apache-get-tag.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:43:35,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:43:35,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:43:35,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:43:35,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:43:35,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:43:35,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:43:35,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:43:35,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:43:35,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:43:35,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:43:35,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:43:35,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:43:35,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:43:35,217 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:43:35,222 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:43:35,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:43:35,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:43:35,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:43:35,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:43:35,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:43:35,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:43:35,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:43:35,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:43:35,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:43:35,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:43:35,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:43:35,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:43:35,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:43:35,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:43:35,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:43:35,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:43:35,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:43:35,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:43:35,256 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:43:35,257 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:43:35,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:43:35,279 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:43:35,279 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:43:35,279 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:43:35,280 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:43:35,280 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:43:35,280 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:43:35,281 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:43:35,281 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:43:35,281 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:43:35,281 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:43:35,281 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:43:35,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:43:35,282 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:43:35,282 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:43:35,282 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:43:35,282 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:43:35,283 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:43:35,283 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:43:35,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:43:35,283 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:43:35,284 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:43:35,285 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:43:35,334 INFO ]: Repository-Root is: /tmp [2018-06-25 00:43:35,345 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:43:35,348 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:43:35,350 INFO ]: Initializing SmtParser... [2018-06-25 00:43:35,350 INFO ]: SmtParser initialized [2018-06-25 00:43:35,350 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/apache-get-tag.c.smt2 [2018-06-25 00:43:35,352 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-25 00:43:35,442 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/apache-get-tag.c.smt2 unknown [2018-06-25 00:43:35,790 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/apache-get-tag.c.smt2 [2018-06-25 00:43:35,795 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:43:35,801 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:43:35,801 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:43:35,801 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:43:35,802 INFO ]: ChcToBoogie initialized [2018-06-25 00:43:35,805 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:43:35" (1/1) ... [2018-06-25 00:43:35,864 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:35 Unit [2018-06-25 00:43:35,864 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:43:35,865 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:43:35,865 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:43:35,865 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:43:35,884 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:35" (1/1) ... [2018-06-25 00:43:35,887 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:35" (1/1) ... [2018-06-25 00:43:35,906 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:35" (1/1) ... [2018-06-25 00:43:35,906 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:35" (1/1) ... [2018-06-25 00:43:35,915 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:35" (1/1) ... [2018-06-25 00:43:35,916 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:35" (1/1) ... [2018-06-25 00:43:35,919 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:35" (1/1) ... [2018-06-25 00:43:35,922 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:43:35,922 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:43:35,923 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:43:35,923 INFO ]: RCFGBuilder initialized [2018-06-25 00:43:35,923 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:35" (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-25 00:43:35,936 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:43:35,937 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:43:35,937 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:43:35,937 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:43:35,937 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:43:35,937 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-25 00:43:36,225 INFO ]: Using library mode [2018-06-25 00:43:36,225 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:43:36 BoogieIcfgContainer [2018-06-25 00:43:36,225 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:43:36,226 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:43:36,226 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:43:36,227 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:43:36,227 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:43:36" (1/1) ... [2018-06-25 00:43:36,241 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:43:36,242 INFO ]: Using Remove infeasible edges [2018-06-25 00:43:36,243 INFO ]: Using Maximize final states [2018-06-25 00:43:36,243 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:43:36,243 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:43:36,245 INFO ]: Using Remove sink states [2018-06-25 00:43:36,246 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:43:36,246 INFO ]: Using Use SBE [2018-06-25 00:43:36,252 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 00:43:37,296 WARN ]: aborting because of expected exponential blowup for input size 107 [2018-06-25 00:43:37,307 WARN ]: aborting because of expected exponential blowup for input size 107 [2018-06-25 00:43:37,307 INFO ]: SBE split 1 edges [2018-06-25 00:43:37,314 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:43:37,316 INFO ]: 0 new accepting states [2018-06-25 00:43:37,636 INFO ]: Removed 19 edges and 2 locations by large block encoding [2018-06-25 00:43:37,638 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:43:37,640 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:43:37,640 INFO ]: 0 new accepting states [2018-06-25 00:43:37,640 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:43:37,640 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:43:37,640 INFO ]: Encoded RCFG 6 locations, 21 edges [2018-06-25 00:43:37,641 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:43:37 BasicIcfg [2018-06-25 00:43:37,642 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:43:37,643 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:43:37,643 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:43:37,647 INFO ]: TraceAbstraction initialized [2018-06-25 00:43:37,647 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:43:35" (1/4) ... [2018-06-25 00:43:37,648 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e674af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:43:37, skipping insertion in model container [2018-06-25 00:43:37,648 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:35" (2/4) ... [2018-06-25 00:43:37,648 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e674af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:43:37, skipping insertion in model container [2018-06-25 00:43:37,648 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:43:36" (3/4) ... [2018-06-25 00:43:37,649 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e674af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:43:37, skipping insertion in model container [2018-06-25 00:43:37,649 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:43:37" (4/4) ... [2018-06-25 00:43:37,651 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:43:37,660 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:43:37,669 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:43:37,725 INFO ]: Using default assertion order modulation [2018-06-25 00:43:37,725 INFO ]: Interprodecural is true [2018-06-25 00:43:37,725 INFO ]: Hoare is false [2018-06-25 00:43:37,726 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:43:37,726 INFO ]: Backedges is TWOTRACK [2018-06-25 00:43:37,726 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:43:37,726 INFO ]: Difference is false [2018-06-25 00:43:37,726 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:43:37,726 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:43:37,738 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:43:37,751 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:43:37,751 INFO ]: Found error trace [2018-06-25 00:43:37,752 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:43:37,752 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:37,757 INFO ]: Analyzing trace with hash 36087755, now seen corresponding path program 1 times [2018-06-25 00:43:37,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:37,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:37,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:37,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:37,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:37,852 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:37,954 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:37,956 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:43:37,957 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:43:37,958 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:43:37,971 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:43:37,972 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:37,974 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:43:38,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:38,204 INFO ]: Finished difference Result 7 states and 22 transitions. [2018-06-25 00:43:38,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:43:38,206 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:43:38,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:38,214 INFO ]: With dead ends: 7 [2018-06-25 00:43:38,214 INFO ]: Without dead ends: 7 [2018-06-25 00:43:38,216 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-25 00:43:38,234 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:43:38,251 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:43:38,252 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:43:38,253 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-06-25 00:43:38,254 INFO ]: Start accepts. Automaton has 7 states and 22 transitions. Word has length 5 [2018-06-25 00:43:38,255 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:38,255 INFO ]: Abstraction has 7 states and 22 transitions. [2018-06-25 00:43:38,255 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:43:38,255 INFO ]: Start isEmpty. Operand 7 states and 22 transitions. [2018-06-25 00:43:38,255 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:43:38,255 INFO ]: Found error trace [2018-06-25 00:43:38,255 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:43:38,256 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:38,256 INFO ]: Analyzing trace with hash 36147337, now seen corresponding path program 1 times [2018-06-25 00:43:38,256 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:38,256 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:38,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:38,257 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:38,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:38,261 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:38,318 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:38,318 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:43:38,318 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:43:38,319 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:43:38,319 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:43:38,319 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:38,320 INFO ]: Start difference. First operand 7 states and 22 transitions. Second operand 3 states. [2018-06-25 00:43:38,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:38,582 INFO ]: Finished difference Result 9 states and 24 transitions. [2018-06-25 00:43:38,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:43:38,583 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:43:38,583 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:38,583 INFO ]: With dead ends: 9 [2018-06-25 00:43:38,583 INFO ]: Without dead ends: 9 [2018-06-25 00:43:38,584 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-25 00:43:38,584 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:43:38,586 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 00:43:38,586 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:43:38,586 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-06-25 00:43:38,586 INFO ]: Start accepts. Automaton has 7 states and 22 transitions. Word has length 5 [2018-06-25 00:43:38,586 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:38,586 INFO ]: Abstraction has 7 states and 22 transitions. [2018-06-25 00:43:38,586 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:43:38,586 INFO ]: Start isEmpty. Operand 7 states and 22 transitions. [2018-06-25 00:43:38,587 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:43:38,587 INFO ]: Found error trace [2018-06-25 00:43:38,587 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:43:38,587 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:38,587 INFO ]: Analyzing trace with hash 36296292, now seen corresponding path program 1 times [2018-06-25 00:43:38,587 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:38,587 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:38,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:38,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:38,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:38,593 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:38,648 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:38,648 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:43:38,648 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:43:38,649 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:43:38,649 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:43:38,649 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:38,649 INFO ]: Start difference. First operand 7 states and 22 transitions. Second operand 3 states. [2018-06-25 00:43:38,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:38,886 INFO ]: Finished difference Result 9 states and 24 transitions. [2018-06-25 00:43:38,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:43:38,887 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:43:38,888 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:38,888 INFO ]: With dead ends: 9 [2018-06-25 00:43:38,888 INFO ]: Without dead ends: 9 [2018-06-25 00:43:38,888 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-25 00:43:38,888 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:43:38,890 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 00:43:38,890 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:43:38,890 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-06-25 00:43:38,890 INFO ]: Start accepts. Automaton has 7 states and 22 transitions. Word has length 5 [2018-06-25 00:43:38,890 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:38,890 INFO ]: Abstraction has 7 states and 22 transitions. [2018-06-25 00:43:38,890 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:43:38,891 INFO ]: Start isEmpty. Operand 7 states and 22 transitions. [2018-06-25 00:43:38,891 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:43:38,891 INFO ]: Found error trace [2018-06-25 00:43:38,891 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:43:38,891 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:38,891 INFO ]: Analyzing trace with hash 35998382, now seen corresponding path program 1 times [2018-06-25 00:43:38,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:38,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:38,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:38,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:38,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:38,901 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:38,935 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:38,935 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:43:38,935 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:43:38,936 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:43:38,936 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:43:38,936 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:38,936 INFO ]: Start difference. First operand 7 states and 22 transitions. Second operand 3 states. [2018-06-25 00:43:39,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:39,053 INFO ]: Finished difference Result 9 states and 24 transitions. [2018-06-25 00:43:39,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:43:39,054 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:43:39,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:39,054 INFO ]: With dead ends: 9 [2018-06-25 00:43:39,054 INFO ]: Without dead ends: 9 [2018-06-25 00:43:39,055 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-25 00:43:39,055 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:43:39,056 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 00:43:39,056 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:43:39,057 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-06-25 00:43:39,057 INFO ]: Start accepts. Automaton has 7 states and 22 transitions. Word has length 5 [2018-06-25 00:43:39,057 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:39,057 INFO ]: Abstraction has 7 states and 22 transitions. [2018-06-25 00:43:39,057 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:43:39,057 INFO ]: Start isEmpty. Operand 7 states and 22 transitions. [2018-06-25 00:43:39,057 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:43:39,057 INFO ]: Found error trace [2018-06-25 00:43:39,057 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:43:39,057 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:39,057 INFO ]: Analyzing trace with hash 1117560637, now seen corresponding path program 1 times [2018-06-25 00:43:39,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:39,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:39,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:39,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:39,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:39,116 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:39,233 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:39,233 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:39,233 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-25 00:43:39,246 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:39,297 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:39,306 INFO ]: Computing forward predicates... [2018-06-25 00:43:41,476 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:41,497 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:43:41,497 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:43:41,497 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:43:41,497 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:43:41,498 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:43:41,498 INFO ]: Start difference. First operand 7 states and 22 transitions. Second operand 5 states. [2018-06-25 00:43:41,843 WARN ]: Spent 311.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-06-25 00:43:41,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:41,938 INFO ]: Finished difference Result 11 states and 26 transitions. [2018-06-25 00:43:41,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:43:41,939 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:43:41,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:41,939 INFO ]: With dead ends: 11 [2018-06-25 00:43:41,939 INFO ]: Without dead ends: 11 [2018-06-25 00:43:41,940 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:43:41,940 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:43:41,942 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-25 00:43:41,942 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:43:41,942 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-06-25 00:43:41,942 INFO ]: Start accepts. Automaton has 8 states and 23 transitions. Word has length 6 [2018-06-25 00:43:41,942 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:41,942 INFO ]: Abstraction has 8 states and 23 transitions. [2018-06-25 00:43:41,942 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:43:41,942 INFO ]: Start isEmpty. Operand 8 states and 23 transitions. [2018-06-25 00:43:41,942 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:43:41,943 INFO ]: Found error trace [2018-06-25 00:43:41,943 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:43:41,943 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:41,943 INFO ]: Analyzing trace with hash 1119407679, now seen corresponding path program 1 times [2018-06-25 00:43:41,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:41,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:41,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:41,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:41,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:41,969 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:42,043 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:42,043 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:42,043 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-25 00:43:42,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:42,091 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:42,094 INFO ]: Computing forward predicates... [2018-06-25 00:43:46,267 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:46,289 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:43:46,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:43:46,289 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:43:46,289 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:43:46,289 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:43:46,289 INFO ]: Start difference. First operand 8 states and 23 transitions. Second operand 5 states. [2018-06-25 00:43:46,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:46,508 INFO ]: Finished difference Result 14 states and 29 transitions. [2018-06-25 00:43:46,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:43:46,508 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:43:46,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:46,509 INFO ]: With dead ends: 14 [2018-06-25 00:43:46,509 INFO ]: Without dead ends: 14 [2018-06-25 00:43:46,509 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:43:46,509 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:43:46,511 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 8. [2018-06-25 00:43:46,511 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:43:46,512 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-06-25 00:43:46,512 INFO ]: Start accepts. Automaton has 8 states and 23 transitions. Word has length 6 [2018-06-25 00:43:46,512 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:46,512 INFO ]: Abstraction has 8 states and 23 transitions. [2018-06-25 00:43:46,512 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:43:46,512 INFO ]: Start isEmpty. Operand 8 states and 23 transitions. [2018-06-25 00:43:46,512 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:43:46,512 INFO ]: Found error trace [2018-06-25 00:43:46,512 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:43:46,512 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:46,512 INFO ]: Analyzing trace with hash 1123101763, now seen corresponding path program 1 times [2018-06-25 00:43:46,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:46,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:46,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:46,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:46,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:46,534 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:46,624 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:46,624 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:46,624 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-25 00:43:46,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:46,669 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:46,672 INFO ]: Computing forward predicates... [2018-06-25 00:43:47,350 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:47,370 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:43:47,370 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:43:47,371 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:43:47,371 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:43:47,371 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:43:47,371 INFO ]: Start difference. First operand 8 states and 23 transitions. Second operand 5 states. [2018-06-25 00:43:47,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:47,435 INFO ]: Finished difference Result 14 states and 29 transitions. [2018-06-25 00:43:47,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:43:47,436 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:43:47,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:47,436 INFO ]: With dead ends: 14 [2018-06-25 00:43:47,436 INFO ]: Without dead ends: 14 [2018-06-25 00:43:47,436 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:43:47,437 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:43:47,438 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 8. [2018-06-25 00:43:47,438 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:43:47,438 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-06-25 00:43:47,438 INFO ]: Start accepts. Automaton has 8 states and 23 transitions. Word has length 6 [2018-06-25 00:43:47,438 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:47,438 INFO ]: Abstraction has 8 states and 23 transitions. [2018-06-25 00:43:47,438 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:43:47,439 INFO ]: Start isEmpty. Operand 8 states and 23 transitions. [2018-06-25 00:43:47,439 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:43:47,439 INFO ]: Found error trace [2018-06-25 00:43:47,439 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:43:47,439 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:47,439 INFO ]: Analyzing trace with hash 283481611, now seen corresponding path program 2 times [2018-06-25 00:43:47,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:47,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:47,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:47,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:47,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:47,474 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:47,984 WARN ]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-25 00:43:47,994 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:47,994 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:47,994 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-25 00:43:48,000 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:43:48,049 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:43:48,049 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:48,051 INFO ]: Computing forward predicates... [2018-06-25 00:43:48,097 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 00:43:49,111 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:49,132 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:43:49,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:43:49,145 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:43:49,145 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:43:49,145 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:43:49,145 INFO ]: Start difference. First operand 8 states and 23 transitions. Second operand 6 states. [2018-06-25 00:43:49,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:49,221 INFO ]: Finished difference Result 12 states and 27 transitions. [2018-06-25 00:43:49,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:43:49,222 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:43:49,222 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:49,222 INFO ]: With dead ends: 12 [2018-06-25 00:43:49,222 INFO ]: Without dead ends: 12 [2018-06-25 00:43:49,222 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:43:49,222 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:43:49,224 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-25 00:43:49,224 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:43:49,225 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-06-25 00:43:49,225 INFO ]: Start accepts. Automaton has 9 states and 24 transitions. Word has length 7 [2018-06-25 00:43:49,225 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:49,225 INFO ]: Abstraction has 9 states and 24 transitions. [2018-06-25 00:43:49,225 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:43:49,225 INFO ]: Start isEmpty. Operand 9 states and 24 transitions. [2018-06-25 00:43:49,225 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:43:49,225 INFO ]: Found error trace [2018-06-25 00:43:49,225 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:43:49,225 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:49,225 INFO ]: Analyzing trace with hash 340739913, now seen corresponding path program 2 times [2018-06-25 00:43:49,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:49,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:49,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:49,226 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:43:49,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:49,249 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:49,433 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:49,434 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:49,434 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-25 00:43:49,442 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:43:49,482 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:43:49,482 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:49,485 INFO ]: Computing forward predicates... [2018-06-25 00:44:05,966 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:05,985 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:05,985 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:44:05,985 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:44:05,985 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:44:05,986 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:44:05,986 INFO ]: Start difference. First operand 9 states and 24 transitions. Second operand 6 states. [2018-06-25 00:44:06,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:06,113 INFO ]: Finished difference Result 17 states and 32 transitions. [2018-06-25 00:44:06,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:44:06,114 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:44:06,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:06,114 INFO ]: With dead ends: 17 [2018-06-25 00:44:06,114 INFO ]: Without dead ends: 17 [2018-06-25 00:44:06,114 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:44:06,115 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:44:06,116 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 9. [2018-06-25 00:44:06,116 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:44:06,116 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-06-25 00:44:06,116 INFO ]: Start accepts. Automaton has 9 states and 24 transitions. Word has length 7 [2018-06-25 00:44:06,116 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:06,116 INFO ]: Abstraction has 9 states and 24 transitions. [2018-06-25 00:44:06,116 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:44:06,117 INFO ]: Start isEmpty. Operand 9 states and 24 transitions. [2018-06-25 00:44:06,117 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:44:06,117 INFO ]: Found error trace [2018-06-25 00:44:06,117 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:44:06,117 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:06,117 INFO ]: Analyzing trace with hash 397998215, now seen corresponding path program 1 times [2018-06-25 00:44:06,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:06,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:06,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:06,118 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:44:06,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:06,142 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:06,339 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:06,339 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:44:06,339 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-25 00:44:06,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:44:06,386 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:06,388 INFO ]: Computing forward predicates... [2018-06-25 00:44:06,544 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 00:44:15,836 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:15,856 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:15,856 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:44:15,856 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:44:15,856 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:44:15,856 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:44:15,856 INFO ]: Start difference. First operand 9 states and 24 transitions. Second operand 6 states. [2018-06-25 00:44:15,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:15,997 INFO ]: Finished difference Result 18 states and 33 transitions. [2018-06-25 00:44:15,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:44:15,997 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:44:15,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:15,998 INFO ]: With dead ends: 18 [2018-06-25 00:44:15,998 INFO ]: Without dead ends: 18 [2018-06-25 00:44:15,998 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:44:15,998 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 00:44:16,000 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 9. [2018-06-25 00:44:16,000 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:44:16,000 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-06-25 00:44:16,000 INFO ]: Start accepts. Automaton has 9 states and 24 transitions. Word has length 7 [2018-06-25 00:44:16,000 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:16,000 INFO ]: Abstraction has 9 states and 24 transitions. [2018-06-25 00:44:16,000 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:44:16,000 INFO ]: Start isEmpty. Operand 9 states and 24 transitions. [2018-06-25 00:44:16,000 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:44:16,000 INFO ]: Found error trace [2018-06-25 00:44:16,000 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:44:16,001 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:16,001 INFO ]: Analyzing trace with hash 512514819, now seen corresponding path program 1 times [2018-06-25 00:44:16,001 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:16,001 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:16,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:16,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:44:16,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:16,031 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:16,275 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:16,275 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:44:16,275 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-25 00:44:16,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:44:16,342 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:16,344 INFO ]: Computing forward predicates... [2018-06-25 00:44:16,461 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 00:44:19,122 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:19,153 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:19,154 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:44:19,154 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:44:19,154 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:44:19,154 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:44:19,154 INFO ]: Start difference. First operand 9 states and 24 transitions. Second operand 6 states. [2018-06-25 00:44:19,349 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:19,349 INFO ]: Finished difference Result 16 states and 31 transitions. [2018-06-25 00:44:19,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:44:19,349 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:44:19,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:19,350 INFO ]: With dead ends: 16 [2018-06-25 00:44:19,350 INFO ]: Without dead ends: 16 [2018-06-25 00:44:19,350 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:44:19,350 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 00:44:19,351 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 9. [2018-06-25 00:44:19,351 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:44:19,352 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-06-25 00:44:19,352 INFO ]: Start accepts. Automaton has 9 states and 24 transitions. Word has length 7 [2018-06-25 00:44:19,352 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:19,352 INFO ]: Abstraction has 9 states and 24 transitions. [2018-06-25 00:44:19,352 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:44:19,352 INFO ]: Start isEmpty. Operand 9 states and 24 transitions. [2018-06-25 00:44:19,352 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:44:19,352 INFO ]: Found error trace [2018-06-25 00:44:19,352 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 00:44:19,352 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:19,352 INFO ]: Analyzing trace with hash 196835581, now seen corresponding path program 3 times [2018-06-25 00:44:19,352 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:19,352 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:19,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:19,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:44:19,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:19,395 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:19,681 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:19,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:44:19,681 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-25 00:44:19,688 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:44:19,742 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:44:19,742 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:19,744 INFO ]: Computing forward predicates... [2018-06-25 00:44:19,768 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 00:44:24,494 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:24,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:24,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 00:44:24,514 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:44:24,514 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:44:24,514 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:44:24,514 INFO ]: Start difference. First operand 9 states and 24 transitions. Second operand 7 states. [2018-06-25 00:44:24,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:24,704 INFO ]: Finished difference Result 15 states and 30 transitions. [2018-06-25 00:44:24,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:44:24,704 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 00:44:24,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:24,705 INFO ]: With dead ends: 15 [2018-06-25 00:44:24,705 INFO ]: Without dead ends: 15 [2018-06-25 00:44:24,705 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-06-25 00:44:24,705 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:44:24,707 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 10. [2018-06-25 00:44:24,707 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:44:24,707 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2018-06-25 00:44:24,707 INFO ]: Start accepts. Automaton has 10 states and 25 transitions. Word has length 8 [2018-06-25 00:44:24,707 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:24,707 INFO ]: Abstraction has 10 states and 25 transitions. [2018-06-25 00:44:24,707 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:44:24,708 INFO ]: Start isEmpty. Operand 10 states and 25 transitions. [2018-06-25 00:44:24,708 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:44:24,708 INFO ]: Found error trace [2018-06-25 00:44:24,708 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 00:44:24,708 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:24,708 INFO ]: Analyzing trace with hash -548116991, now seen corresponding path program 2 times [2018-06-25 00:44:24,708 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:24,708 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:24,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:24,708 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:44:24,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:24,746 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:25,361 WARN ]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 00:44:25,409 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:25,409 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:44:25,409 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-25 00:44:25,417 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:44:25,469 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:44:25,469 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:25,472 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-25 00:44:38,711 INFO ]: Timeout while computing interpolants [2018-06-25 00:44:38,911 WARN ]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:44:38,911 WARN ]: Verification canceled [2018-06-25 00:44:38,913 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:44:38,914 WARN ]: Timeout [2018-06-25 00:44:38,915 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:44:38 BasicIcfg [2018-06-25 00:44:38,915 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:44:38,916 INFO ]: Toolchain (without parser) took 63120.11 ms. Allocated memory was 308.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 250.9 MB in the beginning and 1.2 GB in the end (delta: -935.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-25 00:44:38,916 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:44:38,917 INFO ]: ChcToBoogie took 63.37 ms. Allocated memory is still 308.3 MB. Free memory was 250.9 MB in the beginning and 247.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:44:38,917 INFO ]: Boogie Preprocessor took 56.94 ms. Allocated memory is still 308.3 MB. Free memory was 247.9 MB in the beginning and 245.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:44:38,918 INFO ]: RCFGBuilder took 303.02 ms. Allocated memory is still 308.3 MB. Free memory was 245.8 MB in the beginning and 227.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:44:38,918 INFO ]: BlockEncodingV2 took 1415.76 ms. Allocated memory was 308.3 MB in the beginning and 329.3 MB in the end (delta: 21.0 MB). Free memory was 227.7 MB in the beginning and 206.4 MB in the end (delta: 21.3 MB). Peak memory consumption was 45.9 MB. Max. memory is 3.6 GB. [2018-06-25 00:44:38,924 INFO ]: TraceAbstraction took 61271.81 ms. Allocated memory was 329.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 206.4 MB in the beginning and 1.2 GB in the end (delta: -980.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-25 00:44:38,928 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, 21 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.37 ms. Allocated memory is still 308.3 MB. Free memory was 250.9 MB in the beginning and 247.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 56.94 ms. Allocated memory is still 308.3 MB. Free memory was 247.9 MB in the beginning and 245.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 303.02 ms. Allocated memory is still 308.3 MB. Free memory was 245.8 MB in the beginning and 227.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1415.76 ms. Allocated memory was 308.3 MB in the beginning and 329.3 MB in the end (delta: 21.0 MB). Free memory was 227.7 MB in the beginning and 206.4 MB in the end (delta: 21.3 MB). Peak memory consumption was 45.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61271.81 ms. Allocated memory was 329.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 206.4 MB in the beginning and 1.2 GB in the end (delta: -980.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 9 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 18 quantified variables from 29 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 61.2s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 0 SDslu, 93 SDs, 0 SdLazy, 270 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 14 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred 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, 12 MinimizatonAttempts, 53 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 43.5s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 3071 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1922 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 0/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/apache-get-tag.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-44-38-944.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/apache-get-tag.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-44-38-944.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/apache-get-tag.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-44-38-944.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/apache-get-tag.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-44-38-944.csv Completed graceful shutdown