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/dillig20.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:52:19,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:52:19,197 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:52:19,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:52:19,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:52:19,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:52:19,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:52:19,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:52:19,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:52:19,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:52:19,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:52:19,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:52:19,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:52:19,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:52:19,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:52:19,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:52:19,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:52:19,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:52:19,232 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:52:19,233 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:52:19,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:52:19,236 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:52:19,236 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:52:19,236 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:52:19,237 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:52:19,238 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:52:19,239 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:52:19,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:52:19,241 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:52:19,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:52:19,241 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:52:19,242 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:52:19,242 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:52:19,243 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:52:19,244 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:52:19,244 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:52:19,258 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:52:19,258 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:52:19,259 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:52:19,259 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:52:19,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:52:19,260 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:52:19,260 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:52:19,261 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:52:19,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:52:19,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:52:19,261 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:52:19,261 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:52:19,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:52:19,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:52:19,262 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:52:19,262 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:52:19,263 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:52:19,263 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:52:19,263 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:52:19,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:52:19,263 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:52:19,265 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:52:19,266 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:52:19,317 INFO ]: Repository-Root is: /tmp [2018-06-25 00:52:19,336 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:52:19,345 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:52:19,347 INFO ]: Initializing SmtParser... [2018-06-25 00:52:19,347 INFO ]: SmtParser initialized [2018-06-25 00:52:19,348 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig20.c.smt2 [2018-06-25 00:52:19,349 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:52:19,443 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig20.c.smt2 unknown [2018-06-25 00:52:19,799 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig20.c.smt2 [2018-06-25 00:52:19,805 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:52:19,811 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:52:19,811 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:52:19,811 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:52:19,812 INFO ]: ChcToBoogie initialized [2018-06-25 00:52:19,815 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:52:19" (1/1) ... [2018-06-25 00:52:19,876 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:52:19 Unit [2018-06-25 00:52:19,876 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:52:19,877 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:52:19,877 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:52:19,877 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:52:19,899 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:52:19" (1/1) ... [2018-06-25 00:52:19,899 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:52:19" (1/1) ... [2018-06-25 00:52:19,907 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:52:19" (1/1) ... [2018-06-25 00:52:19,907 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:52:19" (1/1) ... [2018-06-25 00:52:19,915 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:52:19" (1/1) ... [2018-06-25 00:52:19,917 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:52:19" (1/1) ... [2018-06-25 00:52:19,918 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:52:19" (1/1) ... [2018-06-25 00:52:19,921 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:52:19,921 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:52:19,921 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:52:19,921 INFO ]: RCFGBuilder initialized [2018-06-25 00:52:19,922 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:52:19" (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:52:19,933 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:52:19,933 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:52:19,933 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:52:19,933 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:52:19,933 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:52:19,933 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:52:20,255 INFO ]: Using library mode [2018-06-25 00:52:20,256 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:52:20 BoogieIcfgContainer [2018-06-25 00:52:20,256 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:52:20,256 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:52:20,256 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:52:20,257 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:52:20,258 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:52:20" (1/1) ... [2018-06-25 00:52:20,276 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:52:20,277 INFO ]: Using Remove infeasible edges [2018-06-25 00:52:20,278 INFO ]: Using Maximize final states [2018-06-25 00:52:20,278 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:52:20,279 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:52:20,282 INFO ]: Using Remove sink states [2018-06-25 00:52:20,283 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:52:20,283 INFO ]: Using Use SBE [2018-06-25 00:52:20,288 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 00:52:20,341 WARN ]: aborting because of expected exponential blowup for input size 42 [2018-06-25 00:52:20,348 WARN ]: aborting because of expected exponential blowup for input size 42 [2018-06-25 00:52:20,348 INFO ]: SBE split 1 edges [2018-06-25 00:52:20,354 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:52:20,355 INFO ]: 0 new accepting states [2018-06-25 00:52:20,431 INFO ]: Removed 6 edges and 2 locations by large block encoding [2018-06-25 00:52:20,432 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:52:20,434 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:52:20,434 INFO ]: 0 new accepting states [2018-06-25 00:52:20,434 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:52:20,434 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:52:20,434 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-25 00:52:20,434 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:52:20 BasicIcfg [2018-06-25 00:52:20,434 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:52:20,436 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:52:20,436 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:52:20,439 INFO ]: TraceAbstraction initialized [2018-06-25 00:52:20,440 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:52:19" (1/4) ... [2018-06-25 00:52:20,441 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67572ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:52:20, skipping insertion in model container [2018-06-25 00:52:20,441 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:52:19" (2/4) ... [2018-06-25 00:52:20,441 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67572ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:52:20, skipping insertion in model container [2018-06-25 00:52:20,441 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:52:20" (3/4) ... [2018-06-25 00:52:20,441 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67572ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:52:20, skipping insertion in model container [2018-06-25 00:52:20,441 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:52:20" (4/4) ... [2018-06-25 00:52:20,443 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:52:20,454 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:52:20,464 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:52:20,504 INFO ]: Using default assertion order modulation [2018-06-25 00:52:20,504 INFO ]: Interprodecural is true [2018-06-25 00:52:20,504 INFO ]: Hoare is false [2018-06-25 00:52:20,504 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:52:20,504 INFO ]: Backedges is TWOTRACK [2018-06-25 00:52:20,504 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:52:20,504 INFO ]: Difference is false [2018-06-25 00:52:20,504 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:52:20,504 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:52:20,514 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:52:20,523 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:52:20,523 INFO ]: Found error trace [2018-06-25 00:52:20,524 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:52:20,524 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:20,528 INFO ]: Analyzing trace with hash 35496740, now seen corresponding path program 1 times [2018-06-25 00:52:20,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:20,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:20,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:20,562 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:52:20,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:20,595 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:20,652 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:52:20,655 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:52:20,655 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:52:20,657 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:52:20,667 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:52:20,667 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:52:20,669 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:52:20,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:20,737 INFO ]: Finished difference Result 7 states and 9 transitions. [2018-06-25 00:52:20,739 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:52:20,740 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:52:20,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:20,748 INFO ]: With dead ends: 7 [2018-06-25 00:52:20,748 INFO ]: Without dead ends: 7 [2018-06-25 00:52:20,750 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:52:20,763 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:52:20,778 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:52:20,779 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:52:20,780 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-06-25 00:52:20,781 INFO ]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 5 [2018-06-25 00:52:20,781 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:20,781 INFO ]: Abstraction has 7 states and 9 transitions. [2018-06-25 00:52:20,781 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:52:20,781 INFO ]: Start isEmpty. Operand 7 states and 9 transitions. [2018-06-25 00:52:20,781 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:52:20,781 INFO ]: Found error trace [2018-06-25 00:52:20,781 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:52:20,781 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:20,782 INFO ]: Analyzing trace with hash 35526531, now seen corresponding path program 1 times [2018-06-25 00:52:20,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:20,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:20,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:20,783 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:52:20,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:20,789 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:20,849 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:52:20,849 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:52:20,849 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:52:20,850 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:52:20,851 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:52:20,851 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:52:20,851 INFO ]: Start difference. First operand 7 states and 9 transitions. Second operand 3 states. [2018-06-25 00:52:20,949 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:20,949 INFO ]: Finished difference Result 8 states and 10 transitions. [2018-06-25 00:52:20,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:52:20,950 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:52:20,950 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:20,951 INFO ]: With dead ends: 8 [2018-06-25 00:52:20,951 INFO ]: Without dead ends: 8 [2018-06-25 00:52:20,951 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:52:20,952 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:52:20,952 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 00:52:20,953 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:52:20,953 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-06-25 00:52:20,953 INFO ]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 5 [2018-06-25 00:52:20,953 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:20,953 INFO ]: Abstraction has 7 states and 9 transitions. [2018-06-25 00:52:20,953 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:52:20,953 INFO ]: Start isEmpty. Operand 7 states and 9 transitions. [2018-06-25 00:52:20,953 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:52:20,953 INFO ]: Found error trace [2018-06-25 00:52:20,953 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:52:20,956 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:20,956 INFO ]: Analyzing trace with hash 1099958961, now seen corresponding path program 1 times [2018-06-25 00:52:20,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:20,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:20,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:20,957 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:52:20,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:21,046 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:21,236 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:52:21,236 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:21,236 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) [2018-06-25 00:52:21,251 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:52:21,323 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:21,333 INFO ]: Computing forward predicates... [2018-06-25 00:52:21,668 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:52:21,690 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:21,690 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 00:52:21,690 INFO ]: Interpolant automaton has 4 states [2018-06-25 00:52:21,690 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 00:52:21,690 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 00:52:21,691 INFO ]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2018-06-25 00:52:21,996 WARN ]: Spent 276.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-06-25 00:52:22,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:22,108 INFO ]: Finished difference Result 9 states and 11 transitions. [2018-06-25 00:52:22,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 00:52:22,109 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 00:52:22,109 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:22,109 INFO ]: With dead ends: 9 [2018-06-25 00:52:22,109 INFO ]: Without dead ends: 9 [2018-06-25 00:52:22,109 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:52:22,109 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:52:22,110 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-25 00:52:22,110 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:52:22,111 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-06-25 00:52:22,111 INFO ]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2018-06-25 00:52:22,111 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:22,111 INFO ]: Abstraction has 8 states and 10 transitions. [2018-06-25 00:52:22,111 INFO ]: Interpolant automaton has 4 states. [2018-06-25 00:52:22,111 INFO ]: Start isEmpty. Operand 8 states and 10 transitions. [2018-06-25 00:52:22,111 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:52:22,111 INFO ]: Found error trace [2018-06-25 00:52:22,111 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:52:22,111 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:22,112 INFO ]: Analyzing trace with hash 1100882482, now seen corresponding path program 1 times [2018-06-25 00:52:22,112 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:22,112 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:22,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:22,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:52:22,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:22,141 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:22,265 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:52:22,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:22,265 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:52:22,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:52:22,320 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:22,322 INFO ]: Computing forward predicates... [2018-06-25 00:52:22,694 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:52:22,714 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:22,714 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:52:22,714 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:52:22,714 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:52:22,714 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:52:22,714 INFO ]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2018-06-25 00:52:22,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:22,868 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-25 00:52:22,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 00:52:22,869 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:52:22,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:22,871 INFO ]: With dead ends: 11 [2018-06-25 00:52:22,871 INFO ]: Without dead ends: 11 [2018-06-25 00:52:22,871 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:52:22,871 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:52:22,875 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-25 00:52:22,875 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:52:22,875 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-06-25 00:52:22,875 INFO ]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2018-06-25 00:52:22,875 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:22,875 INFO ]: Abstraction has 8 states and 10 transitions. [2018-06-25 00:52:22,875 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:52:22,876 INFO ]: Start isEmpty. Operand 8 states and 10 transitions. [2018-06-25 00:52:22,876 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:52:22,876 INFO ]: Found error trace [2018-06-25 00:52:22,876 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:52:22,876 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:22,876 INFO ]: Analyzing trace with hash 1101806003, now seen corresponding path program 1 times [2018-06-25 00:52:22,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:22,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:22,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:22,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:52:22,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:22,894 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:22,932 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:52:22,932 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:22,932 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:52:22,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:52:22,981 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:22,983 INFO ]: Computing forward predicates... [2018-06-25 00:52:23,124 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:52:23,144 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:23,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 00:52:23,144 INFO ]: Interpolant automaton has 4 states [2018-06-25 00:52:23,144 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 00:52:23,144 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 00:52:23,145 INFO ]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2018-06-25 00:52:23,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:23,157 INFO ]: Finished difference Result 10 states and 12 transitions. [2018-06-25 00:52:23,157 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 00:52:23,157 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 00:52:23,157 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:23,158 INFO ]: With dead ends: 10 [2018-06-25 00:52:23,158 INFO ]: Without dead ends: 10 [2018-06-25 00:52:23,158 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 00:52:23,158 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 00:52:23,159 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 00:52:23,159 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:52:23,159 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-06-25 00:52:23,159 INFO ]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2018-06-25 00:52:23,159 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:23,160 INFO ]: Abstraction has 8 states and 10 transitions. [2018-06-25 00:52:23,160 INFO ]: Interpolant automaton has 4 states. [2018-06-25 00:52:23,160 INFO ]: Start isEmpty. Operand 8 states and 10 transitions. [2018-06-25 00:52:23,160 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:52:23,160 INFO ]: Found error trace [2018-06-25 00:52:23,160 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:52:23,160 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:23,160 INFO ]: Analyzing trace with hash -261450556, now seen corresponding path program 2 times [2018-06-25 00:52:23,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:23,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:23,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:23,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:52:23,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:23,217 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:23,437 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-25 00:52:23,438 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:52:23,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:23,438 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) [2018-06-25 00:52:23,456 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:52:23,526 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:52:23,526 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:23,529 INFO ]: Computing forward predicates... [2018-06-25 00:52:24,636 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:52:24,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:24,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:52:24,656 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:52:24,656 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:52:24,656 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:52:24,656 INFO ]: Start difference. First operand 8 states and 10 transitions. Second operand 6 states. [2018-06-25 00:52:24,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:24,753 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-25 00:52:24,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:52:24,754 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:52:24,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:24,754 INFO ]: With dead ends: 11 [2018-06-25 00:52:24,754 INFO ]: Without dead ends: 11 [2018-06-25 00:52:24,754 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:52:24,755 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:52:24,756 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-25 00:52:24,756 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:52:24,756 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-25 00:52:24,756 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-06-25 00:52:24,756 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:24,756 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-25 00:52:24,756 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:52:24,756 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-25 00:52:24,756 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:52:24,756 INFO ]: Found error trace [2018-06-25 00:52:24,756 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:52:24,757 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:24,757 INFO ]: Analyzing trace with hash -232821405, now seen corresponding path program 2 times [2018-06-25 00:52:24,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:24,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:24,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:24,758 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:52:24,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:24,778 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:25,025 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:52:25,026 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:25,026 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:52:25,033 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:52:25,090 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:52:25,090 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:25,093 INFO ]: Computing forward predicates... [2018-06-25 00:52:26,931 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:52:26,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:26,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:52:26,951 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:52:26,951 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:52:26,951 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:52:26,951 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 6 states. [2018-06-25 00:52:26,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:26,993 INFO ]: Finished difference Result 14 states and 16 transitions. [2018-06-25 00:52:26,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:52:26,993 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:52:26,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:26,993 INFO ]: With dead ends: 14 [2018-06-25 00:52:26,993 INFO ]: Without dead ends: 14 [2018-06-25 00:52:26,994 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:52:26,994 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:52:26,996 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 9. [2018-06-25 00:52:26,996 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:52:26,996 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-25 00:52:26,996 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-06-25 00:52:26,996 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:26,996 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-25 00:52:26,996 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:52:26,996 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-25 00:52:26,997 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:52:26,997 INFO ]: Found error trace [2018-06-25 00:52:26,997 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:52:26,997 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:26,997 INFO ]: Analyzing trace with hash -204192254, now seen corresponding path program 2 times [2018-06-25 00:52:26,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:26,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:26,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:26,998 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:52:26,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:27,016 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:27,322 WARN ]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-25 00:52:27,538 WARN ]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-25 00:52:27,538 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:52:27,538 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:27,538 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) [2018-06-25 00:52:27,556 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:52:27,620 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:52:27,620 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:27,622 INFO ]: Computing forward predicates... [2018-06-25 00:52:28,100 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:52:28,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:28,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:52:28,120 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:52:28,121 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:52:28,121 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:52:28,121 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 6 states. [2018-06-25 00:52:28,187 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:28,187 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-25 00:52:28,187 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:52:28,187 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:52:28,188 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:28,188 INFO ]: With dead ends: 15 [2018-06-25 00:52:28,188 INFO ]: Without dead ends: 15 [2018-06-25 00:52:28,188 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:52:28,188 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:52:28,190 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-25 00:52:28,190 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:52:28,190 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-25 00:52:28,191 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-06-25 00:52:28,191 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:28,191 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-25 00:52:28,191 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:52:28,191 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-25 00:52:28,191 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:52:28,191 INFO ]: Found error trace [2018-06-25 00:52:28,191 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 00:52:28,191 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:28,191 INFO ]: Analyzing trace with hash 484527377, now seen corresponding path program 3 times [2018-06-25 00:52:28,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:28,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:28,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:28,193 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:52:28,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:28,225 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:28,340 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:52:28,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:28,340 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:52:28,347 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:52:28,389 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:52:28,389 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:28,392 INFO ]: Computing forward predicates... [2018-06-25 00:52:31,107 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 00:52:37,355 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:52:37,388 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:37,388 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 00:52:37,388 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:52:37,388 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:52:37,388 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:52:37,388 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 7 states. [2018-06-25 00:52:37,545 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-06-25 00:52:37,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:37,603 INFO ]: Finished difference Result 13 states and 15 transitions. [2018-06-25 00:52:37,604 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:52:37,604 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 00:52:37,604 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:37,604 INFO ]: With dead ends: 13 [2018-06-25 00:52:37,604 INFO ]: Without dead ends: 13 [2018-06-25 00:52:37,604 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:52:37,604 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:52:37,605 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-25 00:52:37,605 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:52:37,606 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-25 00:52:37,606 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-25 00:52:37,606 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:37,606 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-25 00:52:37,606 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:52:37,606 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-25 00:52:37,606 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:52:37,606 INFO ]: Found error trace [2018-06-25 00:52:37,606 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 00:52:37,606 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:37,606 INFO ]: Analyzing trace with hash 1372031058, now seen corresponding path program 3 times [2018-06-25 00:52:37,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:37,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:37,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:37,607 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:52:37,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:37,641 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:37,904 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:52:37,904 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:37,904 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:52:37,913 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:52:37,951 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:52:37,951 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:37,954 INFO ]: Computing forward predicates... [2018-06-25 00:52:39,305 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:52:39,325 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:39,325 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 00:52:39,326 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:52:39,326 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:52:39,326 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:52:39,326 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 7 states. [2018-06-25 00:52:39,451 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:39,451 INFO ]: Finished difference Result 17 states and 19 transitions. [2018-06-25 00:52:39,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:52:39,451 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 00:52:39,452 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:39,452 INFO ]: With dead ends: 17 [2018-06-25 00:52:39,452 INFO ]: Without dead ends: 17 [2018-06-25 00:52:39,452 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:52:39,452 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:52:39,453 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 10. [2018-06-25 00:52:39,453 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:52:39,454 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-25 00:52:39,454 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-25 00:52:39,454 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:39,454 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-25 00:52:39,454 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:52:39,454 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-25 00:52:39,454 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:52:39,454 INFO ]: Found error trace [2018-06-25 00:52:39,454 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 00:52:39,454 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:39,454 INFO ]: Analyzing trace with hash -2035432557, now seen corresponding path program 3 times [2018-06-25 00:52:39,454 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:39,454 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:39,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:39,455 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:52:39,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:39,482 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:39,870 WARN ]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 00:52:39,884 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:52:39,884 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:39,884 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:52:39,891 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:52:39,931 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:52:39,931 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:39,933 INFO ]: Computing forward predicates... [2018-06-25 00:52:41,519 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:52:41,538 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:41,538 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 00:52:41,538 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:52:41,538 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:52:41,538 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:52:41,539 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 7 states. [2018-06-25 00:52:41,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:41,638 INFO ]: Finished difference Result 18 states and 20 transitions. [2018-06-25 00:52:41,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:52:41,638 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 00:52:41,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:41,639 INFO ]: With dead ends: 18 [2018-06-25 00:52:41,639 INFO ]: Without dead ends: 18 [2018-06-25 00:52:41,639 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:52:41,639 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 00:52:41,640 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 10. [2018-06-25 00:52:41,640 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:52:41,640 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-25 00:52:41,640 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-25 00:52:41,640 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:41,640 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-25 00:52:41,640 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:52:41,640 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-25 00:52:41,641 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:52:41,641 INFO ]: Found error trace [2018-06-25 00:52:41,641 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-25 00:52:41,641 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:41,641 INFO ]: Analyzing trace with hash 2135006820, now seen corresponding path program 4 times [2018-06-25 00:52:41,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:41,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:41,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:41,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:52:41,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:41,682 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:41,944 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:52:41,944 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:41,944 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:52:41,950 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:52:41,992 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:52:41,992 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:41,995 INFO ]: Computing forward predicates... [2018-06-25 00:52:44,446 WARN ]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 4 [2018-06-25 00:52:45,170 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:52:45,191 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:45,191 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 00:52:45,191 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:52:45,191 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:52:45,191 INFO ]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:52:45,192 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 9 states. [2018-06-25 00:52:45,370 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:45,370 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-25 00:52:45,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:52:45,371 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-25 00:52:45,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:45,371 INFO ]: With dead ends: 15 [2018-06-25 00:52:45,371 INFO ]: Without dead ends: 15 [2018-06-25 00:52:45,371 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-06-25 00:52:45,371 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:52:45,372 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-25 00:52:45,372 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:52:45,373 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-25 00:52:45,373 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-25 00:52:45,373 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:45,373 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-25 00:52:45,373 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:52:45,373 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-25 00:52:45,373 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:52:45,373 INFO ]: Found error trace [2018-06-25 00:52:45,373 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-25 00:52:45,373 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:45,373 INFO ]: Analyzing trace with hash -417150141, now seen corresponding path program 4 times [2018-06-25 00:52:45,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:45,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:45,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:45,374 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:52:45,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:45,405 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:45,533 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:52:45,533 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:45,533 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:52:45,539 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:52:45,587 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:52:45,587 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:45,590 INFO ]: Computing forward predicates... [2018-06-25 00:52:47,834 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:52:47,854 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:47,854 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 00:52:47,854 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:52:47,854 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:52:47,854 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:52:47,854 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 9 states. [2018-06-25 00:52:48,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:48,033 INFO ]: Finished difference Result 20 states and 22 transitions. [2018-06-25 00:52:48,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:52:48,033 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-25 00:52:48,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:48,034 INFO ]: With dead ends: 20 [2018-06-25 00:52:48,034 INFO ]: Without dead ends: 20 [2018-06-25 00:52:48,034 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2018-06-25 00:52:48,034 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 00:52:48,035 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 11. [2018-06-25 00:52:48,035 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:52:48,036 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-25 00:52:48,036 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-25 00:52:48,036 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:48,036 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-25 00:52:48,036 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:52:48,036 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-25 00:52:48,036 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:52:48,036 INFO ]: Found error trace [2018-06-25 00:52:48,036 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-25 00:52:48,036 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:48,036 INFO ]: Analyzing trace with hash 1325660194, now seen corresponding path program 4 times [2018-06-25 00:52:48,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:48,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:48,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:48,037 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:52:48,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:48,060 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:48,310 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:52:48,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:48,310 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:52:48,317 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:52:48,357 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:52:48,357 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:48,360 INFO ]: Computing forward predicates... [2018-06-25 00:52:51,660 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:52:51,693 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:52:51,693 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 00:52:51,693 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:52:51,693 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:52:51,693 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:52:51,693 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 9 states. [2018-06-25 00:52:51,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:52:51,877 INFO ]: Finished difference Result 21 states and 23 transitions. [2018-06-25 00:52:51,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:52:51,877 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-25 00:52:51,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:52:51,877 INFO ]: With dead ends: 21 [2018-06-25 00:52:51,877 INFO ]: Without dead ends: 21 [2018-06-25 00:52:51,877 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2018-06-25 00:52:51,877 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:52:51,880 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 11. [2018-06-25 00:52:51,880 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:52:51,880 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-25 00:52:51,880 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-25 00:52:51,880 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:52:51,880 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-25 00:52:51,881 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:52:51,881 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-25 00:52:51,881 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:52:51,881 INFO ]: Found error trace [2018-06-25 00:52:51,881 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-25 00:52:51,881 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:52:51,881 INFO ]: Analyzing trace with hash 1760262001, now seen corresponding path program 5 times [2018-06-25 00:52:51,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:52:51,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:52:51,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:51,882 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:52:51,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:52:51,919 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:52,750 WARN ]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-25 00:52:52,857 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:52:52,857 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:52:52,858 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:52:52,864 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:52:52,922 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 00:52:52,922 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:52:52,925 INFO ]: Computing forward predicates... [2018-06-25 00:52:54,391 WARN ]: expecting exponential blowup for input size 6 Received shutdown request... [2018-06-25 00:53:21,200 INFO ]: Timeout while computing interpolants [2018-06-25 00:53:21,401 WARN ]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:53:21,401 WARN ]: Verification canceled [2018-06-25 00:53:21,403 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:53:21,403 WARN ]: Timeout [2018-06-25 00:53:21,404 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:53:21 BasicIcfg [2018-06-25 00:53:21,404 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:53:21,405 INFO ]: Toolchain (without parser) took 61598.66 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 257.9 MB in the beginning and 257.5 MB in the end (delta: 363.5 kB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-25 00:53:21,405 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:53:21,405 INFO ]: ChcToBoogie took 65.50 ms. Allocated memory is still 309.3 MB. Free memory was 257.9 MB in the beginning and 255.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:53:21,406 INFO ]: Boogie Preprocessor took 43.46 ms. Allocated memory is still 309.3 MB. Free memory was 255.9 MB in the beginning and 253.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:53:21,406 INFO ]: RCFGBuilder took 334.71 ms. Allocated memory is still 309.3 MB. Free memory was 253.9 MB in the beginning and 241.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:53:21,407 INFO ]: BlockEncodingV2 took 178.21 ms. Allocated memory is still 309.3 MB. Free memory was 241.9 MB in the beginning and 234.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:53:21,407 INFO ]: TraceAbstraction took 60968.02 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 234.0 MB in the beginning and 257.5 MB in the end (delta: -23.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-25 00:53:21,410 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, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.50 ms. Allocated memory is still 309.3 MB. Free memory was 257.9 MB in the beginning and 255.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.46 ms. Allocated memory is still 309.3 MB. Free memory was 255.9 MB in the beginning and 253.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 334.71 ms. Allocated memory is still 309.3 MB. Free memory was 253.9 MB in the beginning and 241.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 178.21 ms. Allocated memory is still 309.3 MB. Free memory was 241.9 MB in the beginning and 234.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60968.02 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 234.0 MB in the beginning and 257.5 MB in the end (delta: -23.6 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 11 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while XnfDer was eliminating 5367 quantified variables from 13 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 60.9s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 0 SDslu, 141 SDs, 0 SdLazy, 150 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 68 SyntacticMatches, 25 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 61 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 27.8s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 4972 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2376 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 0/120 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/dillig20.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-53-21-421.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig20.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-53-21-421.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig20.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-53-21-421.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig20.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-53-21-421.csv Completed graceful shutdown