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/svd1.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 01:30:58,288 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 01:30:58,290 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 01:30:58,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 01:30:58,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 01:30:58,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 01:30:58,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 01:30:58,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 01:30:58,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 01:30:58,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 01:30:58,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 01:30:58,312 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 01:30:58,312 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 01:30:58,313 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 01:30:58,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 01:30:58,318 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 01:30:58,320 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 01:30:58,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 01:30:58,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 01:30:58,333 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 01:30:58,334 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 01:30:58,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 01:30:58,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 01:30:58,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 01:30:58,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 01:30:58,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 01:30:58,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 01:30:58,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 01:30:58,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 01:30:58,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 01:30:58,346 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 01:30:58,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 01:30:58,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 01:30:58,348 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 01:30:58,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 01:30:58,353 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 01:30:58,375 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 01:30:58,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 01:30:58,376 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 01:30:58,376 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 01:30:58,377 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 01:30:58,377 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 01:30:58,377 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 01:30:58,378 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 01:30:58,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 01:30:58,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 01:30:58,379 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 01:30:58,379 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 01:30:58,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 01:30:58,380 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 01:30:58,380 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 01:30:58,380 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 01:30:58,380 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 01:30:58,380 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 01:30:58,381 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 01:30:58,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 01:30:58,381 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 01:30:58,383 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 01:30:58,384 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 01:30:58,430 INFO ]: Repository-Root is: /tmp [2018-06-25 01:30:58,450 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 01:30:58,457 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 01:30:58,458 INFO ]: Initializing SmtParser... [2018-06-25 01:30:58,459 INFO ]: SmtParser initialized [2018-06-25 01:30:58,459 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd1.c.smt2 [2018-06-25 01:30:58,460 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 01:30:58,549 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd1.c.smt2 unknown [2018-06-25 01:30:59,073 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd1.c.smt2 [2018-06-25 01:30:59,079 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 01:30:59,084 INFO ]: Walking toolchain with 5 elements. [2018-06-25 01:30:59,084 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 01:30:59,085 INFO ]: Initializing ChcToBoogie... [2018-06-25 01:30:59,085 INFO ]: ChcToBoogie initialized [2018-06-25 01:30:59,088 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:30:59" (1/1) ... [2018-06-25 01:30:59,166 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:30:59 Unit [2018-06-25 01:30:59,166 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 01:30:59,170 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 01:30:59,170 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 01:30:59,170 INFO ]: Boogie Preprocessor initialized [2018-06-25 01:30:59,190 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:30:59" (1/1) ... [2018-06-25 01:30:59,191 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:30:59" (1/1) ... [2018-06-25 01:30:59,201 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:30:59" (1/1) ... [2018-06-25 01:30:59,202 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:30:59" (1/1) ... [2018-06-25 01:30:59,217 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:30:59" (1/1) ... [2018-06-25 01:30:59,218 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:30:59" (1/1) ... [2018-06-25 01:30:59,222 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:30:59" (1/1) ... [2018-06-25 01:30:59,229 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 01:30:59,229 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 01:30:59,229 INFO ]: Initializing RCFGBuilder... [2018-06-25 01:30:59,230 INFO ]: RCFGBuilder initialized [2018-06-25 01:30:59,230 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:30:59" (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 01:30:59,244 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 01:30:59,244 INFO ]: Found specification of procedure gotoProc [2018-06-25 01:30:59,244 INFO ]: Found implementation of procedure gotoProc [2018-06-25 01:30:59,244 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 01:30:59,244 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 01:30:59,244 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 01:30:59,635 INFO ]: Using library mode [2018-06-25 01:30:59,635 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:30:59 BoogieIcfgContainer [2018-06-25 01:30:59,636 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 01:30:59,636 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 01:30:59,636 INFO ]: Initializing BlockEncodingV2... [2018-06-25 01:30:59,637 INFO ]: BlockEncodingV2 initialized [2018-06-25 01:30:59,638 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:30:59" (1/1) ... [2018-06-25 01:30:59,659 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 01:30:59,660 INFO ]: Using Remove infeasible edges [2018-06-25 01:30:59,661 INFO ]: Using Maximize final states [2018-06-25 01:30:59,661 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 01:30:59,661 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 01:30:59,663 INFO ]: Using Remove sink states [2018-06-25 01:30:59,664 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 01:30:59,664 INFO ]: Using Use SBE [2018-06-25 01:30:59,672 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 01:31:00,466 WARN ]: aborting because of expected exponential blowup for input size 145 [2018-06-25 01:31:00,487 WARN ]: aborting because of expected exponential blowup for input size 145 [2018-06-25 01:31:00,488 INFO ]: SBE split 1 edges [2018-06-25 01:31:00,495 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 01:31:00,497 INFO ]: 0 new accepting states [2018-06-25 01:31:00,919 INFO ]: Removed 27 edges and 2 locations by large block encoding [2018-06-25 01:31:00,921 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:31:00,923 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 01:31:00,923 INFO ]: 0 new accepting states [2018-06-25 01:31:00,923 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 01:31:00,923 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:31:00,923 INFO ]: Encoded RCFG 6 locations, 29 edges [2018-06-25 01:31:00,925 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:31:00 BasicIcfg [2018-06-25 01:31:00,925 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 01:31:00,926 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 01:31:00,926 INFO ]: Initializing TraceAbstraction... [2018-06-25 01:31:00,932 INFO ]: TraceAbstraction initialized [2018-06-25 01:31:00,932 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:30:59" (1/4) ... [2018-06-25 01:31:00,933 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b01fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 01:31:00, skipping insertion in model container [2018-06-25 01:31:00,933 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:30:59" (2/4) ... [2018-06-25 01:31:00,933 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b01fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 01:31:00, skipping insertion in model container [2018-06-25 01:31:00,934 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:30:59" (3/4) ... [2018-06-25 01:31:00,934 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b01fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:31:00, skipping insertion in model container [2018-06-25 01:31:00,934 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:31:00" (4/4) ... [2018-06-25 01:31:00,935 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 01:31:00,948 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 01:31:00,956 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 01:31:00,998 INFO ]: Using default assertion order modulation [2018-06-25 01:31:00,998 INFO ]: Interprodecural is true [2018-06-25 01:31:00,999 INFO ]: Hoare is false [2018-06-25 01:31:00,999 INFO ]: Compute interpolants for FPandBP [2018-06-25 01:31:00,999 INFO ]: Backedges is TWOTRACK [2018-06-25 01:31:00,999 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 01:31:00,999 INFO ]: Difference is false [2018-06-25 01:31:00,999 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 01:31:00,999 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 01:31:01,011 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 01:31:01,024 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:31:01,024 INFO ]: Found error trace [2018-06-25 01:31:01,025 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:31:01,025 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:01,031 INFO ]: Analyzing trace with hash 36162713, now seen corresponding path program 1 times [2018-06-25 01:31:01,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:01,034 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:01,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:01,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:01,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:01,113 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:01,175 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:01,177 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:31:01,178 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:31:01,179 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:31:01,191 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:31:01,192 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:31:01,194 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 01:31:01,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:01,501 INFO ]: Finished difference Result 7 states and 30 transitions. [2018-06-25 01:31:01,502 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:31:01,503 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:31:01,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:01,511 INFO ]: With dead ends: 7 [2018-06-25 01:31:01,511 INFO ]: Without dead ends: 7 [2018-06-25 01:31:01,513 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 01:31:01,531 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 01:31:01,547 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 01:31:01,549 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:31:01,549 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-25 01:31:01,551 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-25 01:31:01,552 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:01,552 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-25 01:31:01,552 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:31:01,552 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-25 01:31:01,552 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:31:01,552 INFO ]: Found error trace [2018-06-25 01:31:01,552 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:31:01,552 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:01,553 INFO ]: Analyzing trace with hash 36192504, now seen corresponding path program 1 times [2018-06-25 01:31:01,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:01,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:01,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:01,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:01,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:01,559 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:01,589 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:01,590 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:31:01,590 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:31:01,591 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:31:01,591 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:31:01,591 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:31:01,592 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 3 states. [2018-06-25 01:31:01,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:01,804 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-25 01:31:01,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:31:01,804 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:31:01,804 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:01,805 INFO ]: With dead ends: 9 [2018-06-25 01:31:01,805 INFO ]: Without dead ends: 9 [2018-06-25 01:31:01,806 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 01:31:01,806 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:31:01,807 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 01:31:01,808 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:31:01,808 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-25 01:31:01,808 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-25 01:31:01,808 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:01,808 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-25 01:31:01,808 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:31:01,808 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-25 01:31:01,809 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:31:01,809 INFO ]: Found error trace [2018-06-25 01:31:01,809 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:31:01,809 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:01,809 INFO ]: Analyzing trace with hash 36281877, now seen corresponding path program 1 times [2018-06-25 01:31:01,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:01,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:01,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:01,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:01,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:01,815 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:01,826 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:01,826 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:31:01,827 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:31:01,827 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:31:01,827 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:31:01,827 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:31:01,827 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 3 states. [2018-06-25 01:31:01,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:01,922 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-25 01:31:01,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:31:01,923 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:31:01,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:01,924 INFO ]: With dead ends: 9 [2018-06-25 01:31:01,924 INFO ]: Without dead ends: 9 [2018-06-25 01:31:01,924 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 01:31:01,924 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:31:01,926 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 01:31:01,926 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:31:01,926 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-25 01:31:01,926 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-25 01:31:01,926 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:01,926 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-25 01:31:01,926 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:31:01,927 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-25 01:31:01,930 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:31:01,930 INFO ]: Found error trace [2018-06-25 01:31:01,930 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:31:01,930 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:01,930 INFO ]: Analyzing trace with hash 36311668, now seen corresponding path program 1 times [2018-06-25 01:31:01,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:01,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:01,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:01,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:01,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:01,946 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:01,976 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:01,977 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:31:01,977 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:31:01,977 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:31:01,977 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:31:01,977 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:31:01,977 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 3 states. [2018-06-25 01:31:02,106 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:02,106 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-25 01:31:02,106 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:31:02,106 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:31:02,106 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:02,107 INFO ]: With dead ends: 9 [2018-06-25 01:31:02,107 INFO ]: Without dead ends: 9 [2018-06-25 01:31:02,107 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 01:31:02,107 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:31:02,108 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 01:31:02,108 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:31:02,108 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-25 01:31:02,108 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-25 01:31:02,108 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:02,109 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-25 01:31:02,109 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:31:02,109 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-25 01:31:02,109 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:31:02,109 INFO ]: Found error trace [2018-06-25 01:31:02,109 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:31:02,109 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:02,109 INFO ]: Analyzing trace with hash 36698951, now seen corresponding path program 1 times [2018-06-25 01:31:02,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:02,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:02,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:02,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:02,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:02,121 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:02,152 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:02,152 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:31:02,152 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:31:02,152 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:31:02,152 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:31:02,152 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:31:02,153 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 3 states. [2018-06-25 01:31:02,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:02,266 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-25 01:31:02,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:31:02,266 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:31:02,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:02,266 INFO ]: With dead ends: 9 [2018-06-25 01:31:02,266 INFO ]: Without dead ends: 9 [2018-06-25 01:31:02,266 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 01:31:02,267 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:31:02,268 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 01:31:02,268 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:31:02,269 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-25 01:31:02,269 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 5 [2018-06-25 01:31:02,269 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:02,269 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-25 01:31:02,269 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:31:02,269 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-25 01:31:02,269 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:31:02,269 INFO ]: Found error trace [2018-06-25 01:31:02,269 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:31:02,269 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:02,269 INFO ]: Analyzing trace with hash 1119393264, now seen corresponding path program 1 times [2018-06-25 01:31:02,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:02,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:02,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:02,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:02,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:02,349 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:02,518 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:02,518 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:31:02,518 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:31:02,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:02,594 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:02,602 INFO ]: Computing forward predicates... [2018-06-25 01:31:07,711 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:07,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:31:07,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 01:31:07,731 INFO ]: Interpolant automaton has 4 states [2018-06-25 01:31:07,731 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 01:31:07,731 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 01:31:07,732 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 4 states. [2018-06-25 01:31:07,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:07,794 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-25 01:31:07,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 01:31:07,795 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 01:31:07,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:07,796 INFO ]: With dead ends: 9 [2018-06-25 01:31:07,796 INFO ]: Without dead ends: 9 [2018-06-25 01:31:07,796 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 01:31:07,796 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:31:07,798 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-25 01:31:07,798 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:31:07,798 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-06-25 01:31:07,798 INFO ]: Start accepts. Automaton has 8 states and 31 transitions. Word has length 6 [2018-06-25 01:31:07,798 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:07,798 INFO ]: Abstraction has 8 states and 31 transitions. [2018-06-25 01:31:07,798 INFO ]: Interpolant automaton has 4 states. [2018-06-25 01:31:07,798 INFO ]: Start isEmpty. Operand 8 states and 31 transitions. [2018-06-25 01:31:07,798 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:31:07,798 INFO ]: Found error trace [2018-06-25 01:31:07,798 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:31:07,798 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:07,799 INFO ]: Analyzing trace with hash 1120316785, now seen corresponding path program 1 times [2018-06-25 01:31:07,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:07,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:07,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:07,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:07,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:07,836 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:08,178 WARN ]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 01:31:08,178 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:08,179 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:31:08,179 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) [2018-06-25 01:31:08,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:31:08,261 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:08,264 INFO ]: Computing forward predicates... [2018-06-25 01:31:09,656 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:09,695 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:31:09,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 01:31:09,695 INFO ]: Interpolant automaton has 4 states [2018-06-25 01:31:09,695 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 01:31:09,695 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 01:31:09,696 INFO ]: Start difference. First operand 8 states and 31 transitions. Second operand 4 states. [2018-06-25 01:31:09,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:09,969 INFO ]: Finished difference Result 12 states and 35 transitions. [2018-06-25 01:31:09,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 01:31:09,970 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 01:31:09,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:09,970 INFO ]: With dead ends: 12 [2018-06-25 01:31:09,970 INFO ]: Without dead ends: 12 [2018-06-25 01:31:09,970 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 01:31:09,971 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 01:31:09,973 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-25 01:31:09,973 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:31:09,973 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-06-25 01:31:09,973 INFO ]: Start accepts. Automaton has 8 states and 31 transitions. Word has length 6 [2018-06-25 01:31:09,974 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:09,974 INFO ]: Abstraction has 8 states and 31 transitions. [2018-06-25 01:31:09,974 INFO ]: Interpolant automaton has 4 states. [2018-06-25 01:31:09,974 INFO ]: Start isEmpty. Operand 8 states and 31 transitions. [2018-06-25 01:31:09,974 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:31:09,974 INFO ]: Found error trace [2018-06-25 01:31:09,974 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:31:09,974 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:09,974 INFO ]: Analyzing trace with hash 1124010869, now seen corresponding path program 1 times [2018-06-25 01:31:09,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:09,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:09,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:09,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:09,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:10,007 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:10,114 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:10,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:31:10,114 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 01:31:10,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:10,176 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:10,178 INFO ]: Computing forward predicates... [2018-06-25 01:31:10,876 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:31:13,601 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:13,620 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:31:13,629 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 01:31:13,629 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:31:13,630 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:31:13,630 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:31:13,630 INFO ]: Start difference. First operand 8 states and 31 transitions. Second operand 5 states. [2018-06-25 01:31:13,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:13,710 INFO ]: Finished difference Result 16 states and 39 transitions. [2018-06-25 01:31:13,711 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 01:31:13,711 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 01:31:13,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:13,712 INFO ]: With dead ends: 16 [2018-06-25 01:31:13,712 INFO ]: Without dead ends: 16 [2018-06-25 01:31:13,712 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:31:13,712 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:31:13,715 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 8. [2018-06-25 01:31:13,715 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:31:13,716 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-06-25 01:31:13,716 INFO ]: Start accepts. Automaton has 8 states and 31 transitions. Word has length 6 [2018-06-25 01:31:13,716 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:13,716 INFO ]: Abstraction has 8 states and 31 transitions. [2018-06-25 01:31:13,716 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:31:13,716 INFO ]: Start isEmpty. Operand 8 states and 31 transitions. [2018-06-25 01:31:13,716 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:31:13,716 INFO ]: Found error trace [2018-06-25 01:31:13,717 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:31:13,717 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:13,717 INFO ]: Analyzing trace with hash 1131399037, now seen corresponding path program 1 times [2018-06-25 01:31:13,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:13,717 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:13,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:13,717 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:13,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:13,740 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:13,845 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:13,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:31:13,846 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:31:13,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:13,907 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:13,908 INFO ]: Computing forward predicates... [2018-06-25 01:31:15,463 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:15,495 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:31:15,495 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 01:31:15,495 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:31:15,495 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:31:15,495 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:31:15,495 INFO ]: Start difference. First operand 8 states and 31 transitions. Second operand 5 states. [2018-06-25 01:31:15,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:15,617 INFO ]: Finished difference Result 14 states and 37 transitions. [2018-06-25 01:31:15,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 01:31:15,618 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 01:31:15,618 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:15,618 INFO ]: With dead ends: 14 [2018-06-25 01:31:15,618 INFO ]: Without dead ends: 14 [2018-06-25 01:31:15,618 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:31:15,618 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 01:31:15,620 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 8. [2018-06-25 01:31:15,620 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:31:15,620 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-06-25 01:31:15,620 INFO ]: Start accepts. Automaton has 8 states and 31 transitions. Word has length 6 [2018-06-25 01:31:15,620 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:15,620 INFO ]: Abstraction has 8 states and 31 transitions. [2018-06-25 01:31:15,620 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:31:15,620 INFO ]: Start isEmpty. Operand 8 states and 31 transitions. [2018-06-25 01:31:15,620 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:31:15,621 INFO ]: Found error trace [2018-06-25 01:31:15,621 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 01:31:15,621 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:15,621 INFO ]: Analyzing trace with hash 339801977, now seen corresponding path program 2 times [2018-06-25 01:31:15,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:15,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:15,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:15,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:15,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:15,678 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:15,805 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:15,805 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:31:15,805 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 01:31:15,811 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 01:31:15,873 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 01:31:15,873 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:15,876 INFO ]: Computing forward predicates... [2018-06-25 01:31:23,900 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:23,920 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:31:23,920 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 01:31:23,921 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:31:23,921 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:31:23,921 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:31:23,921 INFO ]: Start difference. First operand 8 states and 31 transitions. Second operand 6 states. [2018-06-25 01:31:24,105 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:24,106 INFO ]: Finished difference Result 13 states and 36 transitions. [2018-06-25 01:31:24,106 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 01:31:24,106 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 01:31:24,106 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:24,106 INFO ]: With dead ends: 13 [2018-06-25 01:31:24,106 INFO ]: Without dead ends: 13 [2018-06-25 01:31:24,106 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-06-25 01:31:24,106 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 01:31:24,108 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-25 01:31:24,108 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:31:24,108 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-06-25 01:31:24,108 INFO ]: Start accepts. Automaton has 9 states and 32 transitions. Word has length 7 [2018-06-25 01:31:24,108 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:24,108 INFO ]: Abstraction has 9 states and 32 transitions. [2018-06-25 01:31:24,108 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:31:24,108 INFO ]: Start isEmpty. Operand 9 states and 32 transitions. [2018-06-25 01:31:24,108 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:31:24,108 INFO ]: Found error trace [2018-06-25 01:31:24,108 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 01:31:24,109 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:24,109 INFO ]: Analyzing trace with hash 397060279, now seen corresponding path program 1 times [2018-06-25 01:31:24,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:24,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:24,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:24,109 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:31:24,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:24,146 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:24,367 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:24,367 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:31:24,367 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:31:24,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:24,433 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:24,436 INFO ]: Computing forward predicates... [2018-06-25 01:31:25,409 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:25,431 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:31:25,431 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 01:31:25,431 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:31:25,431 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:31:25,431 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:31:25,431 INFO ]: Start difference. First operand 9 states and 32 transitions. Second operand 6 states. [2018-06-25 01:31:25,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:25,553 INFO ]: Finished difference Result 19 states and 42 transitions. [2018-06-25 01:31:25,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 01:31:25,553 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 01:31:25,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:25,553 INFO ]: With dead ends: 19 [2018-06-25 01:31:25,553 INFO ]: Without dead ends: 19 [2018-06-25 01:31:25,554 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 01:31:25,554 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 01:31:25,556 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 9. [2018-06-25 01:31:25,556 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:31:25,557 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-06-25 01:31:25,557 INFO ]: Start accepts. Automaton has 9 states and 32 transitions. Word has length 7 [2018-06-25 01:31:25,557 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:25,557 INFO ]: Abstraction has 9 states and 32 transitions. [2018-06-25 01:31:25,557 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:31:25,557 INFO ]: Start isEmpty. Operand 9 states and 32 transitions. [2018-06-25 01:31:25,557 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:31:25,557 INFO ]: Found error trace [2018-06-25 01:31:25,557 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 01:31:25,557 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:25,557 INFO ]: Analyzing trace with hash 482947732, now seen corresponding path program 2 times [2018-06-25 01:31:25,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:25,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:25,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:25,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:25,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:25,589 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:25,760 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:25,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:31:25,760 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 01:31:25,767 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 01:31:25,838 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 01:31:25,838 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:25,840 INFO ]: Computing forward predicates... [2018-06-25 01:31:25,955 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:31:28,872 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:28,893 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:31:28,893 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 01:31:28,893 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:31:28,893 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:31:28,893 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:31:28,893 INFO ]: Start difference. First operand 9 states and 32 transitions. Second operand 5 states. [2018-06-25 01:31:28,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:28,991 INFO ]: Finished difference Result 15 states and 38 transitions. [2018-06-25 01:31:29,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 01:31:29,039 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-25 01:31:29,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:29,039 INFO ]: With dead ends: 15 [2018-06-25 01:31:29,039 INFO ]: Without dead ends: 15 [2018-06-25 01:31:29,040 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:31:29,040 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 01:31:29,041 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-25 01:31:29,041 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:31:29,041 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-06-25 01:31:29,041 INFO ]: Start accepts. Automaton has 9 states and 32 transitions. Word has length 7 [2018-06-25 01:31:29,041 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:29,041 INFO ]: Abstraction has 9 states and 32 transitions. [2018-06-25 01:31:29,041 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:31:29,041 INFO ]: Start isEmpty. Operand 9 states and 32 transitions. [2018-06-25 01:31:29,042 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:31:29,042 INFO ]: Found error trace [2018-06-25 01:31:29,042 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 01:31:29,042 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:29,042 INFO ]: Analyzing trace with hash 941014148, now seen corresponding path program 1 times [2018-06-25 01:31:29,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:29,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:29,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:29,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:31:29,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:29,073 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:29,835 WARN ]: Spent 552.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-25 01:31:30,026 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 01:31:30,027 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:30,027 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:31:30,027 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 01:31:30,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:30,092 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:30,094 INFO ]: Computing forward predicates... [2018-06-25 01:31:30,138 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:31:41,697 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:41,717 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:31:41,717 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 01:31:41,717 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:31:41,717 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:31:41,717 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:31:41,717 INFO ]: Start difference. First operand 9 states and 32 transitions. Second operand 6 states. [2018-06-25 01:31:41,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:31:41,846 INFO ]: Finished difference Result 17 states and 40 transitions. [2018-06-25 01:31:41,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 01:31:41,846 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 01:31:41,846 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:31:41,847 INFO ]: With dead ends: 17 [2018-06-25 01:31:41,847 INFO ]: Without dead ends: 17 [2018-06-25 01:31:41,847 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:31:41,847 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 01:31:41,849 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 9. [2018-06-25 01:31:41,849 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:31:41,849 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-06-25 01:31:41,849 INFO ]: Start accepts. Automaton has 9 states and 32 transitions. Word has length 7 [2018-06-25 01:31:41,849 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:31:41,849 INFO ]: Abstraction has 9 states and 32 transitions. [2018-06-25 01:31:41,849 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:31:41,849 INFO ]: Start isEmpty. Operand 9 states and 32 transitions. [2018-06-25 01:31:41,849 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:31:41,849 INFO ]: Found error trace [2018-06-25 01:31:41,849 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 01:31:41,849 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:31:41,850 INFO ]: Analyzing trace with hash 1942275856, now seen corresponding path program 3 times [2018-06-25 01:31:41,850 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:31:41,850 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:31:41,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:41,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:31:41,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:31:41,918 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:42,191 WARN ]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 01:31:42,267 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:31:42,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:31:42,267 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 01:31:42,273 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 01:31:42,359 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 01:31:42,359 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:31:42,362 INFO ]: Computing forward predicates... [2018-06-25 01:31:47,505 WARN ]: Spent 318.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 7 [2018-06-25 01:31:48,639 WARN ]: expecting exponential blowup for input size 7 Received shutdown request... [2018-06-25 01:32:03,043 INFO ]: Timeout while computing interpolants [2018-06-25 01:32:03,265 WARN ]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:32:03,266 WARN ]: Verification canceled [2018-06-25 01:32:03,267 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 01:32:03,268 WARN ]: Timeout [2018-06-25 01:32:03,268 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:32:03 BasicIcfg [2018-06-25 01:32:03,268 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 01:32:03,269 INFO ]: Toolchain (without parser) took 64189.82 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 238.8 MB in the beginning and 1.0 GB in the end (delta: -798.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-25 01:32:03,270 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:32:03,270 INFO ]: ChcToBoogie took 85.42 ms. Allocated memory is still 309.3 MB. Free memory was 238.8 MB in the beginning and 235.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:32:03,270 INFO ]: Boogie Preprocessor took 58.73 ms. Allocated memory is still 309.3 MB. Free memory was 235.8 MB in the beginning and 233.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:32:03,274 INFO ]: RCFGBuilder took 406.10 ms. Allocated memory is still 309.3 MB. Free memory was 233.8 MB in the beginning and 208.1 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 3.6 GB. [2018-06-25 01:32:03,274 INFO ]: BlockEncodingV2 took 1289.10 ms. Allocated memory was 309.3 MB in the beginning and 327.7 MB in the end (delta: 18.4 MB). Free memory was 208.1 MB in the beginning and 259.8 MB in the end (delta: -51.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 3.6 GB. [2018-06-25 01:32:03,275 INFO ]: TraceAbstraction took 62342.10 ms. Allocated memory was 327.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 258.3 MB in the beginning and 1.0 GB in the end (delta: -778.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-25 01:32:03,285 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, 29 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 85.42 ms. Allocated memory is still 309.3 MB. Free memory was 238.8 MB in the beginning and 235.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 58.73 ms. Allocated memory is still 309.3 MB. Free memory was 235.8 MB in the beginning and 233.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 406.10 ms. Allocated memory is still 309.3 MB. Free memory was 233.8 MB in the beginning and 208.1 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1289.10 ms. Allocated memory was 309.3 MB in the beginning and 327.7 MB in the end (delta: 18.4 MB). Free memory was 208.1 MB in the beginning and 259.8 MB in the end (delta: -51.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 62342.10 ms. Allocated memory was 327.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 258.3 MB in the beginning and 1.0 GB in the end (delta: -778.9 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 613 quantified variables from 15 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 62.2s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 367 SDtfs, 0 SDslu, 78 SDs, 0 SdLazy, 335 SolverSat, 380 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 12 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=10, 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, 13 MinimizatonAttempts, 55 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 37.4s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 1709 SizeOfPredicates, 56 NumberOfNonLiveVariables, 2324 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 0/32 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/svd1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_01-32-03-302.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_01-32-03-302.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_01-32-03-302.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_01-32-03-302.csv Completed graceful shutdown