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-62c3406-m [2018-06-26 21:15:43,498 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:15:43,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:15:43,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:15:43,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:15:43,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:15:43,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:15:43,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:15:43,521 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:15:43,522 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:15:43,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:15:43,523 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:15:43,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:15:43,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:15:43,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:15:43,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:15:43,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:15:43,528 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:15:43,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:15:43,532 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:15:43,533 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:15:43,534 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:15:43,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:15:43,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:15:43,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:15:43,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:15:43,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:15:43,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:15:43,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:15:43,541 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:15:43,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:15:43,541 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:15:43,542 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:15:43,542 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:15:43,543 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:15:43,543 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:15:43,544 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 21:15:43,563 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:15:43,563 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:15:43,564 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:15:43,564 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:15:43,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:15:43,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:15:43,565 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:15:43,565 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:15:43,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:15:43,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:15:43,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:15:43,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:15:43,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:15:43,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:15:43,567 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:15:43,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:15:43,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:15:43,567 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:15:43,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:15:43,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:15:43,570 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:15:43,572 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:15:43,572 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:15:43,620 INFO ]: Repository-Root is: /tmp [2018-06-26 21:15:43,635 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:15:43,638 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:15:43,640 INFO ]: Initializing SmtParser... [2018-06-26 21:15:43,640 INFO ]: SmtParser initialized [2018-06-26 21:15:43,641 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/apache-get-tag.c.smt2 [2018-06-26 21:15:43,642 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 21:15:43,733 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/apache-get-tag.c.smt2 unknown [2018-06-26 21:15:44,169 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/apache-get-tag.c.smt2 [2018-06-26 21:15:44,173 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:15:44,180 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:15:44,181 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:15:44,181 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:15:44,181 INFO ]: ChcToBoogie initialized [2018-06-26 21:15:44,184 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:15:44" (1/1) ... [2018-06-26 21:15:44,246 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:15:44 Unit [2018-06-26 21:15:44,246 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:15:44,247 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:15:44,247 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:15:44,247 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:15:44,263 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:15:44" (1/1) ... [2018-06-26 21:15:44,263 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:15:44" (1/1) ... [2018-06-26 21:15:44,270 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:15:44" (1/1) ... [2018-06-26 21:15:44,270 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:15:44" (1/1) ... [2018-06-26 21:15:44,280 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:15:44" (1/1) ... [2018-06-26 21:15:44,282 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:15:44" (1/1) ... [2018-06-26 21:15:44,285 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:15:44" (1/1) ... [2018-06-26 21:15:44,292 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:15:44,293 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:15:44,293 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:15:44,293 INFO ]: RCFGBuilder initialized [2018-06-26 21:15:44,294 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:15:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:15:44,320 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:15:44,320 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:15:44,320 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:15:44,320 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:15:44,320 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:15:44,320 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 21:15:44,620 INFO ]: Using library mode [2018-06-26 21:15:44,620 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:15:44 BoogieIcfgContainer [2018-06-26 21:15:44,620 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:15:44,621 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:15:44,621 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:15:44,626 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:15:44,627 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:15:44" (1/1) ... [2018-06-26 21:15:44,644 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:15:44,645 INFO ]: Using Remove infeasible edges [2018-06-26 21:15:44,646 INFO ]: Using Maximize final states [2018-06-26 21:15:44,646 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:15:44,646 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:15:44,651 INFO ]: Using Remove sink states [2018-06-26 21:15:44,652 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:15:44,652 INFO ]: Using Use SBE [2018-06-26 21:15:44,660 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:15:44,768 WARN ]: aborting because of expected exponential blowup for input size 107 [2018-06-26 21:15:44,785 WARN ]: aborting because of expected exponential blowup for input size 107 [2018-06-26 21:15:44,785 INFO ]: SBE split 1 edges [2018-06-26 21:15:44,792 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:15:44,794 INFO ]: 0 new accepting states [2018-06-26 21:15:45,103 INFO ]: Removed 19 edges and 2 locations by large block encoding [2018-06-26 21:15:45,106 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:15:45,107 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:15:45,107 INFO ]: 0 new accepting states [2018-06-26 21:15:45,107 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:15:45,107 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:15:45,108 INFO ]: Encoded RCFG 6 locations, 21 edges [2018-06-26 21:15:45,108 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:15:45 BasicIcfg [2018-06-26 21:15:45,108 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:15:45,110 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:15:45,110 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:15:45,115 INFO ]: TraceAbstraction initialized [2018-06-26 21:15:45,115 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:15:44" (1/4) ... [2018-06-26 21:15:45,116 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0728a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:15:45, skipping insertion in model container [2018-06-26 21:15:45,117 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:15:44" (2/4) ... [2018-06-26 21:15:45,117 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0728a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:15:45, skipping insertion in model container [2018-06-26 21:15:45,117 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:15:44" (3/4) ... [2018-06-26 21:15:45,117 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0728a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:15:45, skipping insertion in model container [2018-06-26 21:15:45,117 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:15:45" (4/4) ... [2018-06-26 21:15:45,119 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:15:45,130 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:15:45,138 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:15:45,194 INFO ]: Using default assertion order modulation [2018-06-26 21:15:45,194 INFO ]: Interprodecural is true [2018-06-26 21:15:45,194 INFO ]: Hoare is false [2018-06-26 21:15:45,194 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:15:45,194 INFO ]: Backedges is TWOTRACK [2018-06-26 21:15:45,194 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:15:45,194 INFO ]: Difference is false [2018-06-26 21:15:45,194 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:15:45,194 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:15:45,207 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:15:45,221 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:15:45,221 INFO ]: Found error trace [2018-06-26 21:15:45,222 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:15:45,222 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:15:45,228 INFO ]: Analyzing trace with hash 36087755, now seen corresponding path program 1 times [2018-06-26 21:15:45,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:15:45,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:15:45,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:45,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:45,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:45,345 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:45,446 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:45,448 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:15:45,448 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:15:45,450 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:15:45,465 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:15:45,466 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:15:45,468 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:15:45,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:15:45,747 INFO ]: Finished difference Result 7 states and 22 transitions. [2018-06-26 21:15:45,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:15:45,750 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:15:45,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:15:45,762 INFO ]: With dead ends: 7 [2018-06-26 21:15:45,762 INFO ]: Without dead ends: 7 [2018-06-26 21:15:45,766 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:15:45,790 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:15:45,807 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:15:45,808 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:15:45,808 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-06-26 21:15:45,810 INFO ]: Start accepts. Automaton has 7 states and 22 transitions. Word has length 5 [2018-06-26 21:15:45,811 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:15:45,811 INFO ]: Abstraction has 7 states and 22 transitions. [2018-06-26 21:15:45,811 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:15:45,811 INFO ]: Start isEmpty. Operand 7 states and 22 transitions. [2018-06-26 21:15:45,811 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:15:45,811 INFO ]: Found error trace [2018-06-26 21:15:45,811 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:15:45,812 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:15:45,812 INFO ]: Analyzing trace with hash 36177128, now seen corresponding path program 1 times [2018-06-26 21:15:45,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:15:45,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:15:45,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:45,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:45,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:45,818 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:45,887 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:45,888 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:15:45,888 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:15:45,889 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:15:45,889 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:15:45,889 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:15:45,890 INFO ]: Start difference. First operand 7 states and 22 transitions. Second operand 3 states. [2018-06-26 21:15:46,054 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:15:46,054 INFO ]: Finished difference Result 9 states and 24 transitions. [2018-06-26 21:15:46,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:15:46,054 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:15:46,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:15:46,055 INFO ]: With dead ends: 9 [2018-06-26 21:15:46,055 INFO ]: Without dead ends: 9 [2018-06-26 21:15:46,056 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:15:46,056 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:15:46,057 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:15:46,057 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:15:46,058 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-06-26 21:15:46,058 INFO ]: Start accepts. Automaton has 7 states and 22 transitions. Word has length 5 [2018-06-26 21:15:46,058 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:15:46,058 INFO ]: Abstraction has 7 states and 22 transitions. [2018-06-26 21:15:46,058 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:15:46,058 INFO ]: Start isEmpty. Operand 7 states and 22 transitions. [2018-06-26 21:15:46,058 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:15:46,058 INFO ]: Found error trace [2018-06-26 21:15:46,058 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:15:46,058 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:15:46,059 INFO ]: Analyzing trace with hash 36206919, now seen corresponding path program 1 times [2018-06-26 21:15:46,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:15:46,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:15:46,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:46,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:46,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:46,063 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:46,109 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:46,109 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:15:46,109 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:15:46,109 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:15:46,110 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:15:46,110 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:15:46,110 INFO ]: Start difference. First operand 7 states and 22 transitions. Second operand 3 states. [2018-06-26 21:15:46,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:15:46,285 INFO ]: Finished difference Result 9 states and 24 transitions. [2018-06-26 21:15:46,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:15:46,285 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:15:46,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:15:46,286 INFO ]: With dead ends: 9 [2018-06-26 21:15:46,286 INFO ]: Without dead ends: 9 [2018-06-26 21:15:46,286 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:15:46,286 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:15:46,291 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:15:46,291 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:15:46,292 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-06-26 21:15:46,292 INFO ]: Start accepts. Automaton has 7 states and 22 transitions. Word has length 5 [2018-06-26 21:15:46,292 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:15:46,292 INFO ]: Abstraction has 7 states and 22 transitions. [2018-06-26 21:15:46,292 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:15:46,292 INFO ]: Start isEmpty. Operand 7 states and 22 transitions. [2018-06-26 21:15:46,292 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:15:46,292 INFO ]: Found error trace [2018-06-26 21:15:46,292 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:15:46,292 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:15:46,292 INFO ]: Analyzing trace with hash 36326083, now seen corresponding path program 1 times [2018-06-26 21:15:46,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:15:46,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:15:46,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:46,293 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:46,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:46,297 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:46,328 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:46,328 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:15:46,328 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:15:46,328 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:15:46,329 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:15:46,329 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:15:46,329 INFO ]: Start difference. First operand 7 states and 22 transitions. Second operand 3 states. [2018-06-26 21:15:46,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:15:46,506 INFO ]: Finished difference Result 9 states and 24 transitions. [2018-06-26 21:15:46,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:15:46,507 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:15:46,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:15:46,507 INFO ]: With dead ends: 9 [2018-06-26 21:15:46,507 INFO ]: Without dead ends: 9 [2018-06-26 21:15:46,508 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:15:46,508 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:15:46,509 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:15:46,509 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:15:46,509 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-06-26 21:15:46,509 INFO ]: Start accepts. Automaton has 7 states and 22 transitions. Word has length 5 [2018-06-26 21:15:46,509 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:15:46,509 INFO ]: Abstraction has 7 states and 22 transitions. [2018-06-26 21:15:46,509 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:15:46,510 INFO ]: Start isEmpty. Operand 7 states and 22 transitions. [2018-06-26 21:15:46,510 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:15:46,510 INFO ]: Found error trace [2018-06-26 21:15:46,510 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:15:46,510 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:15:46,510 INFO ]: Analyzing trace with hash 1117560637, now seen corresponding path program 1 times [2018-06-26 21:15:46,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:15:46,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:15:46,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:46,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:46,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:46,568 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:46,856 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-26 21:15:46,857 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:46,857 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:15:46,857 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:15:46,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:46,916 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:46,925 INFO ]: Computing forward predicates... [2018-06-26 21:15:49,362 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:49,382 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:15:49,382 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:15:49,382 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:15:49,382 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:15:49,382 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:15:49,383 INFO ]: Start difference. First operand 7 states and 22 transitions. Second operand 5 states. [2018-06-26 21:15:49,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:15:49,439 INFO ]: Finished difference Result 11 states and 26 transitions. [2018-06-26 21:15:49,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:15:49,439 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:15:49,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:15:49,440 INFO ]: With dead ends: 11 [2018-06-26 21:15:49,440 INFO ]: Without dead ends: 11 [2018-06-26 21:15:49,440 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:15:49,440 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 21:15:49,442 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-26 21:15:49,442 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:15:49,442 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-06-26 21:15:49,442 INFO ]: Start accepts. Automaton has 8 states and 23 transitions. Word has length 6 [2018-06-26 21:15:49,442 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:15:49,442 INFO ]: Abstraction has 8 states and 23 transitions. [2018-06-26 21:15:49,442 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:15:49,442 INFO ]: Start isEmpty. Operand 8 states and 23 transitions. [2018-06-26 21:15:49,443 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:15:49,443 INFO ]: Found error trace [2018-06-26 21:15:49,443 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:15:49,443 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:15:49,443 INFO ]: Analyzing trace with hash 1118484158, now seen corresponding path program 1 times [2018-06-26 21:15:49,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:15:49,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:15:49,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:49,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:49,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:49,471 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:49,572 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:49,572 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:15:49,572 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:15:49,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:49,619 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:49,621 INFO ]: Computing forward predicates... [2018-06-26 21:15:53,619 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:53,639 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:15:53,639 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:15:53,639 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:15:53,639 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:15:53,639 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:15:53,640 INFO ]: Start difference. First operand 8 states and 23 transitions. Second operand 5 states. [2018-06-26 21:15:53,792 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:15:53,792 INFO ]: Finished difference Result 14 states and 29 transitions. [2018-06-26 21:15:53,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:15:53,793 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:15:53,793 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:15:53,793 INFO ]: With dead ends: 14 [2018-06-26 21:15:53,793 INFO ]: Without dead ends: 14 [2018-06-26 21:15:53,793 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-26 21:15:53,793 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 21:15:53,795 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 8. [2018-06-26 21:15:53,795 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:15:53,795 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-06-26 21:15:53,795 INFO ]: Start accepts. Automaton has 8 states and 23 transitions. Word has length 6 [2018-06-26 21:15:53,796 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:15:53,796 INFO ]: Abstraction has 8 states and 23 transitions. [2018-06-26 21:15:53,796 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:15:53,796 INFO ]: Start isEmpty. Operand 8 states and 23 transitions. [2018-06-26 21:15:53,796 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:15:53,796 INFO ]: Found error trace [2018-06-26 21:15:53,796 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:15:53,796 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:15:53,796 INFO ]: Analyzing trace with hash 1120331200, now seen corresponding path program 1 times [2018-06-26 21:15:53,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:15:53,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:15:53,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:53,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:53,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:53,814 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:53,895 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:53,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:15:53,895 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:15:53,902 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:53,926 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:53,927 INFO ]: Computing forward predicates... [2018-06-26 21:15:54,670 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:54,690 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:15:54,690 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:15:54,690 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:15:54,690 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:15:54,690 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:15:54,690 INFO ]: Start difference. First operand 8 states and 23 transitions. Second operand 5 states. [2018-06-26 21:15:54,789 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:15:54,789 INFO ]: Finished difference Result 13 states and 28 transitions. [2018-06-26 21:15:54,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:15:54,789 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:15:54,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:15:54,790 INFO ]: With dead ends: 13 [2018-06-26 21:15:54,790 INFO ]: Without dead ends: 13 [2018-06-26 21:15:54,790 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-26 21:15:54,790 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:15:54,792 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 8. [2018-06-26 21:15:54,792 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:15:54,792 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-06-26 21:15:54,792 INFO ]: Start accepts. Automaton has 8 states and 23 transitions. Word has length 6 [2018-06-26 21:15:54,792 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:15:54,792 INFO ]: Abstraction has 8 states and 23 transitions. [2018-06-26 21:15:54,792 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:15:54,793 INFO ]: Start isEmpty. Operand 8 states and 23 transitions. [2018-06-26 21:15:54,793 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:15:54,793 INFO ]: Found error trace [2018-06-26 21:15:54,793 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:15:54,793 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:15:54,793 INFO ]: Analyzing trace with hash 283481611, now seen corresponding path program 2 times [2018-06-26 21:15:54,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:15:54,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:15:54,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:54,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:54,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:54,825 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:54,972 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:54,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:15:54,972 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:15:54,977 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:15:55,028 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:15:55,028 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:55,031 INFO ]: Computing forward predicates... [2018-06-26 21:15:55,108 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:15:55,561 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:55,585 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:15:55,585 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 21:15:55,585 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:15:55,585 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:15:55,585 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:15:55,585 INFO ]: Start difference. First operand 8 states and 23 transitions. Second operand 6 states. [2018-06-26 21:15:55,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:15:55,738 INFO ]: Finished difference Result 13 states and 28 transitions. [2018-06-26 21:15:55,739 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:15:55,739 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 21:15:55,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:15:55,739 INFO ]: With dead ends: 13 [2018-06-26 21:15:55,739 INFO ]: Without dead ends: 13 [2018-06-26 21:15:55,739 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-26 21:15:55,739 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:15:55,741 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-26 21:15:55,741 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:15:55,741 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-06-26 21:15:55,741 INFO ]: Start accepts. Automaton has 9 states and 24 transitions. Word has length 7 [2018-06-26 21:15:55,741 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:15:55,741 INFO ]: Abstraction has 9 states and 24 transitions. [2018-06-26 21:15:55,741 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:15:55,741 INFO ]: Start isEmpty. Operand 9 states and 24 transitions. [2018-06-26 21:15:55,741 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:15:55,741 INFO ]: Found error trace [2018-06-26 21:15:55,741 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:15:55,742 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:15:55,742 INFO ]: Analyzing trace with hash 397998215, now seen corresponding path program 1 times [2018-06-26 21:15:55,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:15:55,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:15:55,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:55,742 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:15:55,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:15:55,782 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:56,129 WARN ]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-26 21:15:56,142 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:15:56,142 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:15:56,142 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:15:56,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:15:56,185 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:15:56,187 INFO ]: Computing forward predicates... [2018-06-26 21:16:12,540 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:16:12,561 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:16:12,561 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 21:16:12,561 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:16:12,562 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:16:12,562 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:16:12,562 INFO ]: Start difference. First operand 9 states and 24 transitions. Second operand 6 states. [2018-06-26 21:16:12,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:16:12,689 INFO ]: Finished difference Result 18 states and 33 transitions. [2018-06-26 21:16:12,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:16:12,690 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 21:16:12,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:16:12,691 INFO ]: With dead ends: 18 [2018-06-26 21:16:12,691 INFO ]: Without dead ends: 18 [2018-06-26 21:16:12,691 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:16:12,691 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 21:16:12,693 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 9. [2018-06-26 21:16:12,693 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:16:12,693 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-06-26 21:16:12,693 INFO ]: Start accepts. Automaton has 9 states and 24 transitions. Word has length 7 [2018-06-26 21:16:12,694 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:16:12,694 INFO ]: Abstraction has 9 states and 24 transitions. [2018-06-26 21:16:12,694 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:16:12,694 INFO ]: Start isEmpty. Operand 9 states and 24 transitions. [2018-06-26 21:16:12,694 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:16:12,694 INFO ]: Found error trace [2018-06-26 21:16:12,694 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:16:12,694 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:16:12,694 INFO ]: Analyzing trace with hash 512514819, now seen corresponding path program 1 times [2018-06-26 21:16:12,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:16:12,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:16:12,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:16:12,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:16:12,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:16:12,722 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:16:12,862 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:16:12,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:16:12,863 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:16:12,874 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:16:12,912 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:16:12,915 INFO ]: Computing forward predicates... [2018-06-26 21:16:13,091 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:16:21,666 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:16:21,686 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:16:21,687 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 21:16:21,687 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:16:21,687 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:16:21,687 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:16:21,687 INFO ]: Start difference. First operand 9 states and 24 transitions. Second operand 6 states. [2018-06-26 21:16:21,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:16:21,831 INFO ]: Finished difference Result 16 states and 31 transitions. [2018-06-26 21:16:21,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:16:21,831 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 21:16:21,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:16:21,832 INFO ]: With dead ends: 16 [2018-06-26 21:16:21,832 INFO ]: Without dead ends: 16 [2018-06-26 21:16:21,832 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:16:21,832 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 21:16:21,834 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 9. [2018-06-26 21:16:21,834 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:16:21,834 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-06-26 21:16:21,834 INFO ]: Start accepts. Automaton has 9 states and 24 transitions. Word has length 7 [2018-06-26 21:16:21,834 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:16:21,834 INFO ]: Abstraction has 9 states and 24 transitions. [2018-06-26 21:16:21,834 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:16:21,834 INFO ]: Start isEmpty. Operand 9 states and 24 transitions. [2018-06-26 21:16:21,834 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:16:21,834 INFO ]: Found error trace [2018-06-26 21:16:21,834 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 21:16:21,835 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:16:21,835 INFO ]: Analyzing trace with hash 196835581, now seen corresponding path program 3 times [2018-06-26 21:16:21,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:16:21,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:16:21,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:16:21,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:16:21,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:16:21,883 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:16:22,377 WARN ]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 21:16:22,408 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:16:22,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:16:22,409 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:16:22,419 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 21:16:22,498 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 21:16:22,498 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:16:22,501 INFO ]: Computing forward predicates... [2018-06-26 21:16:27,053 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:16:27,075 WARN ]: expecting exponential blowup for input size 6 Received shutdown request... [2018-06-26 21:16:51,252 INFO ]: Timeout while computing interpolants [2018-06-26 21:16:51,453 WARN ]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:16:51,453 WARN ]: Verification canceled [2018-06-26 21:16:51,455 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:16:51,456 WARN ]: Timeout [2018-06-26 21:16:51,456 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:16:51 BasicIcfg [2018-06-26 21:16:51,456 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:16:51,457 INFO ]: Toolchain (without parser) took 67283.56 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 251.2 MB in the beginning and 812.5 MB in the end (delta: -561.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 21:16:51,461 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:16:51,461 INFO ]: ChcToBoogie took 65.67 ms. Allocated memory is still 308.8 MB. Free memory was 251.2 MB in the beginning and 245.2 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:16:51,461 INFO ]: Boogie Preprocessor took 45.69 ms. Allocated memory is still 308.8 MB. Free memory was 245.2 MB in the beginning and 243.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:16:51,462 INFO ]: RCFGBuilder took 327.19 ms. Allocated memory is still 308.8 MB. Free memory was 243.2 MB in the beginning and 225.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:16:51,462 INFO ]: BlockEncodingV2 took 487.91 ms. Allocated memory is still 308.8 MB. Free memory was 225.3 MB in the beginning and 197.4 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 3.6 GB. [2018-06-26 21:16:51,463 INFO ]: TraceAbstraction took 66346.26 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 197.4 MB in the beginning and 812.5 MB in the end (delta: -615.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 21:16:51,466 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.09 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.67 ms. Allocated memory is still 308.8 MB. Free memory was 251.2 MB in the beginning and 245.2 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.69 ms. Allocated memory is still 308.8 MB. Free memory was 245.2 MB in the beginning and 243.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 327.19 ms. Allocated memory is still 308.8 MB. Free memory was 243.2 MB in the beginning and 225.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 487.91 ms. Allocated memory is still 308.8 MB. Free memory was 225.3 MB in the beginning and 197.4 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 66346.26 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 197.4 MB in the beginning and 812.5 MB in the end (delta: -615.2 MB). Peak memory consumption was 1.3 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 PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while XnfDer was eliminating 9707 quantified variables from 16 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 66.2s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 0 SDslu, 63 SDs, 0 SdLazy, 222 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=8, 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, 10 MinimizatonAttempts, 40 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 1875 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1275 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 0/24 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-26_21-16-51-479.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-26_21-16-51-479.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-26_21-16-51-479.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-26_21-16-51-479.csv Completed graceful shutdown