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/cav12/s3_srvr_7.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:48:58,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:48:58,720 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:48:58,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:48:58,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:48:58,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:48:58,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:48:58,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:48:58,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:48:58,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:48:58,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:48:58,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:48:58,744 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:48:58,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:48:58,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:48:58,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:48:58,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:48:58,752 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:48:58,765 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:48:58,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:48:58,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:48:58,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:48:58,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:48:58,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:48:58,770 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:48:58,771 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:48:58,772 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:48:58,772 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:48:58,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:48:58,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:48:58,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:48:58,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:48:58,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:48:58,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:48:58,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:48:58,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:48:58,780 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:48:58,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:48:58,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:48:58,794 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:48:58,794 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:48:58,795 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:48:58,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:48:58,795 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:48:58,795 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:48:58,795 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:48:58,796 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:48:58,796 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:48:58,796 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:48:58,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:48:58,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:48:58,797 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:48:58,797 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:48:58,797 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:48:58,797 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:48:58,797 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:48:58,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:48:58,798 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:48:58,800 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:48:58,800 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:48:58,851 INFO ]: Repository-Root is: /tmp [2018-06-26 20:48:58,866 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:48:58,873 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:48:58,874 INFO ]: Initializing SmtParser... [2018-06-26 20:48:58,874 INFO ]: SmtParser initialized [2018-06-26 20:48:58,875 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_7.cil.smt2 [2018-06-26 20:48:58,876 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 20:48:58,963 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_7.cil.smt2 unknown [2018-06-26 20:48:59,478 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_7.cil.smt2 [2018-06-26 20:48:59,482 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:48:59,487 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:48:59,488 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:48:59,488 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:48:59,488 INFO ]: ChcToBoogie initialized [2018-06-26 20:48:59,491 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:48:59" (1/1) ... [2018-06-26 20:48:59,557 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:48:59 Unit [2018-06-26 20:48:59,557 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:48:59,558 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:48:59,558 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:48:59,558 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:48:59,578 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:48:59" (1/1) ... [2018-06-26 20:48:59,578 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:48:59" (1/1) ... [2018-06-26 20:48:59,602 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:48:59" (1/1) ... [2018-06-26 20:48:59,602 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:48:59" (1/1) ... [2018-06-26 20:48:59,620 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:48:59" (1/1) ... [2018-06-26 20:48:59,621 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:48:59" (1/1) ... [2018-06-26 20:48:59,627 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:48:59" (1/1) ... [2018-06-26 20:48:59,632 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:48:59,632 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:48:59,632 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:48:59,632 INFO ]: RCFGBuilder initialized [2018-06-26 20:48:59,634 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:48: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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:48:59,644 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:48:59,644 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:48:59,644 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:48:59,644 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:48:59,644 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:48:59,644 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 20:49:00,034 INFO ]: Using library mode [2018-06-26 20:49:00,034 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:49:00 BoogieIcfgContainer [2018-06-26 20:49:00,034 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:49:00,035 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:49:00,035 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:49:00,036 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:49:00,036 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:49:00" (1/1) ... [2018-06-26 20:49:00,053 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:49:00,056 INFO ]: Using Remove infeasible edges [2018-06-26 20:49:00,057 INFO ]: Using Maximize final states [2018-06-26 20:49:00,057 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:49:00,057 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:49:00,062 INFO ]: Using Remove sink states [2018-06-26 20:49:00,063 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:49:00,063 INFO ]: Using Use SBE [2018-06-26 20:49:01,936 INFO ]: SBE split 1 edges [2018-06-26 20:49:02,067 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:49:02,069 INFO ]: 0 new accepting states [2018-06-26 20:49:02,125 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:49:02,127 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:49:02,254 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:49:02,255 INFO ]: 0 new accepting states [2018-06-26 20:49:02,256 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:49:02,256 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:49:02,435 INFO ]: Encoded RCFG 6 locations, 1084 edges [2018-06-26 20:49:02,435 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:49:02 BasicIcfg [2018-06-26 20:49:02,435 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:49:02,436 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:49:02,436 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:49:02,439 INFO ]: TraceAbstraction initialized [2018-06-26 20:49:02,440 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:48:59" (1/4) ... [2018-06-26 20:49:02,444 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331635a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:49:02, skipping insertion in model container [2018-06-26 20:49:02,445 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:48:59" (2/4) ... [2018-06-26 20:49:02,445 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331635a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:49:02, skipping insertion in model container [2018-06-26 20:49:02,445 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:49:00" (3/4) ... [2018-06-26 20:49:02,445 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331635a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:49:02, skipping insertion in model container [2018-06-26 20:49:02,445 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:49:02" (4/4) ... [2018-06-26 20:49:02,446 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:49:02,457 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:49:02,465 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:49:02,514 INFO ]: Using default assertion order modulation [2018-06-26 20:49:02,515 INFO ]: Interprodecural is true [2018-06-26 20:49:02,515 INFO ]: Hoare is false [2018-06-26 20:49:02,515 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:49:02,515 INFO ]: Backedges is TWOTRACK [2018-06-26 20:49:02,515 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:49:02,515 INFO ]: Difference is false [2018-06-26 20:49:02,515 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:49:02,515 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:49:02,529 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:49:02,548 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:49:02,548 INFO ]: Found error trace [2018-06-26 20:49:02,549 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:49:02,549 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:02,552 INFO ]: Analyzing trace with hash 68583970, now seen corresponding path program 1 times [2018-06-26 20:49:02,554 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:02,554 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:02,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:02,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:02,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:02,657 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:02,754 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:49:02,756 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:02,756 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:02,758 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:02,768 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:02,768 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:02,770 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:49:09,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:09,347 INFO ]: Finished difference Result 7 states and 1181 transitions. [2018-06-26 20:49:09,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:09,348 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:49:09,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:09,369 INFO ]: With dead ends: 7 [2018-06-26 20:49:09,373 INFO ]: Without dead ends: 7 [2018-06-26 20:49:09,375 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:09,390 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:49:09,419 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:49:09,420 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:49:09,423 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1181 transitions. [2018-06-26 20:49:09,424 INFO ]: Start accepts. Automaton has 7 states and 1181 transitions. Word has length 5 [2018-06-26 20:49:09,425 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:09,425 INFO ]: Abstraction has 7 states and 1181 transitions. [2018-06-26 20:49:09,425 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:09,425 INFO ]: Start isEmpty. Operand 7 states and 1181 transitions. [2018-06-26 20:49:09,426 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:49:09,426 INFO ]: Found error trace [2018-06-26 20:49:09,426 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:49:09,426 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:09,426 INFO ]: Analyzing trace with hash 2101611183, now seen corresponding path program 1 times [2018-06-26 20:49:09,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:09,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:09,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:09,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:09,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:09,478 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:09,525 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:49:09,526 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:09,526 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:09,527 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:09,527 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:09,527 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:09,527 INFO ]: Start difference. First operand 7 states and 1181 transitions. Second operand 3 states. [2018-06-26 20:49:12,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:12,557 INFO ]: Finished difference Result 8 states and 1183 transitions. [2018-06-26 20:49:12,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:12,558 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:49:12,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:12,560 INFO ]: With dead ends: 8 [2018-06-26 20:49:12,560 INFO ]: Without dead ends: 8 [2018-06-26 20:49:12,561 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:12,561 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:49:12,580 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:49:12,580 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:49:12,582 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1183 transitions. [2018-06-26 20:49:12,583 INFO ]: Start accepts. Automaton has 8 states and 1183 transitions. Word has length 6 [2018-06-26 20:49:12,583 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:12,583 INFO ]: Abstraction has 8 states and 1183 transitions. [2018-06-26 20:49:12,583 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:12,583 INFO ]: Start isEmpty. Operand 8 states and 1183 transitions. [2018-06-26 20:49:12,583 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:49:12,583 INFO ]: Found error trace [2018-06-26 20:49:12,583 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:49:12,583 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:12,583 INFO ]: Analyzing trace with hash 2123656523, now seen corresponding path program 1 times [2018-06-26 20:49:12,584 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:12,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:12,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:12,584 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:12,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:12,617 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:12,656 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:49:12,656 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:12,656 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:12,657 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:12,657 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:12,657 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:12,657 INFO ]: Start difference. First operand 8 states and 1183 transitions. Second operand 3 states. [2018-06-26 20:49:15,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:15,999 INFO ]: Finished difference Result 9 states and 1193 transitions. [2018-06-26 20:49:16,000 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:16,000 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:49:16,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:16,002 INFO ]: With dead ends: 9 [2018-06-26 20:49:16,002 INFO ]: Without dead ends: 9 [2018-06-26 20:49:16,002 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:16,002 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:49:16,008 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:49:16,008 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:49:16,010 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1193 transitions. [2018-06-26 20:49:16,010 INFO ]: Start accepts. Automaton has 9 states and 1193 transitions. Word has length 6 [2018-06-26 20:49:16,010 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:16,010 INFO ]: Abstraction has 9 states and 1193 transitions. [2018-06-26 20:49:16,010 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:16,010 INFO ]: Start isEmpty. Operand 9 states and 1193 transitions. [2018-06-26 20:49:16,011 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:49:16,011 INFO ]: Found error trace [2018-06-26 20:49:16,011 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:16,011 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:16,011 INFO ]: Analyzing trace with hash -79604843, now seen corresponding path program 1 times [2018-06-26 20:49:16,011 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:16,011 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:16,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:16,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:16,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:16,068 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:16,134 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:49:16,134 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:16,134 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:16,134 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:16,134 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:16,134 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:16,134 INFO ]: Start difference. First operand 9 states and 1193 transitions. Second operand 3 states. [2018-06-26 20:49:19,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:19,110 INFO ]: Finished difference Result 11 states and 1345 transitions. [2018-06-26 20:49:19,111 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:19,111 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:49:19,111 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:19,113 INFO ]: With dead ends: 11 [2018-06-26 20:49:19,113 INFO ]: Without dead ends: 11 [2018-06-26 20:49:19,113 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:19,114 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:49:19,120 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 20:49:19,120 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:49:19,123 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1345 transitions. [2018-06-26 20:49:19,123 INFO ]: Start accepts. Automaton has 11 states and 1345 transitions. Word has length 8 [2018-06-26 20:49:19,123 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:19,123 INFO ]: Abstraction has 11 states and 1345 transitions. [2018-06-26 20:49:19,123 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:19,124 INFO ]: Start isEmpty. Operand 11 states and 1345 transitions. [2018-06-26 20:49:19,124 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:49:19,124 INFO ]: Found error trace [2018-06-26 20:49:19,124 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:19,124 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:19,126 INFO ]: Analyzing trace with hash 629659285, now seen corresponding path program 1 times [2018-06-26 20:49:19,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:19,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:19,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:19,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:19,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:19,176 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:19,274 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:49:19,274 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:19,274 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:19,274 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:19,274 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:19,274 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:19,275 INFO ]: Start difference. First operand 11 states and 1345 transitions. Second operand 3 states. [2018-06-26 20:49:21,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:21,822 INFO ]: Finished difference Result 13 states and 1633 transitions. [2018-06-26 20:49:21,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:21,824 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:49:21,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:21,827 INFO ]: With dead ends: 13 [2018-06-26 20:49:21,827 INFO ]: Without dead ends: 13 [2018-06-26 20:49:21,827 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:21,827 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:49:21,834 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 20:49:21,834 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:49:21,837 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1623 transitions. [2018-06-26 20:49:21,837 INFO ]: Start accepts. Automaton has 12 states and 1623 transitions. Word has length 8 [2018-06-26 20:49:21,837 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:21,837 INFO ]: Abstraction has 12 states and 1623 transitions. [2018-06-26 20:49:21,838 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:21,838 INFO ]: Start isEmpty. Operand 12 states and 1623 transitions. [2018-06-26 20:49:21,840 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:49:21,840 INFO ]: Found error trace [2018-06-26 20:49:21,840 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:21,840 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:21,840 INFO ]: Analyzing trace with hash -1761736909, now seen corresponding path program 1 times [2018-06-26 20:49:21,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:21,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:21,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:21,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:21,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:21,890 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:21,971 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:49:21,971 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:21,971 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:21,971 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:21,971 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:21,971 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:21,971 INFO ]: Start difference. First operand 12 states and 1623 transitions. Second operand 3 states. [2018-06-26 20:49:24,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:24,538 INFO ]: Finished difference Result 14 states and 1963 transitions. [2018-06-26 20:49:24,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:24,539 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:49:24,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:24,542 INFO ]: With dead ends: 14 [2018-06-26 20:49:24,542 INFO ]: Without dead ends: 14 [2018-06-26 20:49:24,542 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:24,542 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 20:49:24,549 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-26 20:49:24,549 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:49:24,551 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1953 transitions. [2018-06-26 20:49:24,551 INFO ]: Start accepts. Automaton has 13 states and 1953 transitions. Word has length 9 [2018-06-26 20:49:24,551 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:24,551 INFO ]: Abstraction has 13 states and 1953 transitions. [2018-06-26 20:49:24,551 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:24,551 INFO ]: Start isEmpty. Operand 13 states and 1953 transitions. [2018-06-26 20:49:24,553 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:49:24,553 INFO ]: Found error trace [2018-06-26 20:49:24,553 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:24,553 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:24,553 INFO ]: Analyzing trace with hash 2086246223, now seen corresponding path program 1 times [2018-06-26 20:49:24,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:24,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:24,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:24,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:24,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:24,587 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:24,663 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:49:24,663 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:24,663 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:24,663 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:24,663 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:24,663 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:24,663 INFO ]: Start difference. First operand 13 states and 1953 transitions. Second operand 3 states. [2018-06-26 20:49:27,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:27,501 INFO ]: Finished difference Result 15 states and 2109 transitions. [2018-06-26 20:49:27,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:27,501 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:49:27,501 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:27,504 INFO ]: With dead ends: 15 [2018-06-26 20:49:27,504 INFO ]: Without dead ends: 14 [2018-06-26 20:49:27,504 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:27,504 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 20:49:27,521 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 20:49:27,521 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 20:49:27,522 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2108 transitions. [2018-06-26 20:49:27,522 INFO ]: Start accepts. Automaton has 14 states and 2108 transitions. Word has length 9 [2018-06-26 20:49:27,522 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:27,522 INFO ]: Abstraction has 14 states and 2108 transitions. [2018-06-26 20:49:27,522 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:27,522 INFO ]: Start isEmpty. Operand 14 states and 2108 transitions. [2018-06-26 20:49:27,524 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:49:27,524 INFO ]: Found error trace [2018-06-26 20:49:27,524 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:27,524 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:27,524 INFO ]: Analyzing trace with hash 2109334248, now seen corresponding path program 1 times [2018-06-26 20:49:27,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:27,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:27,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:27,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:27,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:27,554 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:27,649 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:49:27,650 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:27,650 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:27,650 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:27,650 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:27,650 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:27,650 INFO ]: Start difference. First operand 14 states and 2108 transitions. Second operand 3 states. [2018-06-26 20:49:30,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:30,605 INFO ]: Finished difference Result 21 states and 3544 transitions. [2018-06-26 20:49:30,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:30,605 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:49:30,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:30,609 INFO ]: With dead ends: 21 [2018-06-26 20:49:30,609 INFO ]: Without dead ends: 21 [2018-06-26 20:49:30,609 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:30,609 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 20:49:30,623 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-26 20:49:30,623 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 20:49:30,627 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3528 transitions. [2018-06-26 20:49:30,627 INFO ]: Start accepts. Automaton has 19 states and 3528 transitions. Word has length 9 [2018-06-26 20:49:30,627 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:30,627 INFO ]: Abstraction has 19 states and 3528 transitions. [2018-06-26 20:49:30,627 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:30,627 INFO ]: Start isEmpty. Operand 19 states and 3528 transitions. [2018-06-26 20:49:30,629 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:49:30,629 INFO ]: Found error trace [2018-06-26 20:49:30,629 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:30,629 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:30,630 INFO ]: Analyzing trace with hash 1666044168, now seen corresponding path program 1 times [2018-06-26 20:49:30,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:30,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:30,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:30,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:30,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:30,660 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:30,826 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:49:30,826 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:30,826 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:30,827 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:30,827 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:30,827 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:30,827 INFO ]: Start difference. First operand 19 states and 3528 transitions. Second operand 3 states. [2018-06-26 20:49:33,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:33,797 INFO ]: Finished difference Result 23 states and 3584 transitions. [2018-06-26 20:49:33,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:33,797 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:49:33,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:33,801 INFO ]: With dead ends: 23 [2018-06-26 20:49:33,801 INFO ]: Without dead ends: 23 [2018-06-26 20:49:33,801 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:33,801 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 20:49:33,812 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-26 20:49:33,812 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:49:33,816 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3568 transitions. [2018-06-26 20:49:33,816 INFO ]: Start accepts. Automaton has 21 states and 3568 transitions. Word has length 9 [2018-06-26 20:49:33,816 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:33,816 INFO ]: Abstraction has 21 states and 3568 transitions. [2018-06-26 20:49:33,816 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:33,816 INFO ]: Start isEmpty. Operand 21 states and 3568 transitions. [2018-06-26 20:49:33,818 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:49:33,818 INFO ]: Found error trace [2018-06-26 20:49:33,818 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:33,818 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:33,818 INFO ]: Analyzing trace with hash -456003391, now seen corresponding path program 1 times [2018-06-26 20:49:33,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:33,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:33,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:33,820 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:33,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:33,851 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:33,934 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:49:33,934 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:33,934 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:33,934 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:33,935 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:33,935 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:33,935 INFO ]: Start difference. First operand 21 states and 3568 transitions. Second operand 3 states. [2018-06-26 20:49:37,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:37,045 INFO ]: Finished difference Result 34 states and 6266 transitions. [2018-06-26 20:49:37,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:37,046 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:49:37,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:37,053 INFO ]: With dead ends: 34 [2018-06-26 20:49:37,053 INFO ]: Without dead ends: 34 [2018-06-26 20:49:37,054 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:37,054 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 20:49:37,082 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 20:49:37,082 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 20:49:37,088 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6266 transitions. [2018-06-26 20:49:37,088 INFO ]: Start accepts. Automaton has 34 states and 6266 transitions. Word has length 10 [2018-06-26 20:49:37,088 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:37,088 INFO ]: Abstraction has 34 states and 6266 transitions. [2018-06-26 20:49:37,088 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:37,088 INFO ]: Start isEmpty. Operand 34 states and 6266 transitions. [2018-06-26 20:49:37,092 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:49:37,092 INFO ]: Found error trace [2018-06-26 20:49:37,092 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:37,092 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:37,092 INFO ]: Analyzing trace with hash 1448562682, now seen corresponding path program 1 times [2018-06-26 20:49:37,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:37,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:37,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:37,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:37,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:37,126 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:37,291 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:49:37,291 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:37,291 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:37,291 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:37,291 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:37,291 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:37,291 INFO ]: Start difference. First operand 34 states and 6266 transitions. Second operand 3 states. [2018-06-26 20:49:39,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:39,972 INFO ]: Finished difference Result 41 states and 5910 transitions. [2018-06-26 20:49:39,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:39,973 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:49:39,973 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:39,979 INFO ]: With dead ends: 41 [2018-06-26 20:49:39,980 INFO ]: Without dead ends: 41 [2018-06-26 20:49:39,980 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:39,980 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 20:49:39,999 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-06-26 20:49:39,999 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 20:49:40,004 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5890 transitions. [2018-06-26 20:49:40,004 INFO ]: Start accepts. Automaton has 38 states and 5890 transitions. Word has length 10 [2018-06-26 20:49:40,004 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:40,004 INFO ]: Abstraction has 38 states and 5890 transitions. [2018-06-26 20:49:40,004 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:40,004 INFO ]: Start isEmpty. Operand 38 states and 5890 transitions. [2018-06-26 20:49:40,007 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:49:40,007 INFO ]: Found error trace [2018-06-26 20:49:40,007 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:40,007 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:40,007 INFO ]: Analyzing trace with hash 808891504, now seen corresponding path program 1 times [2018-06-26 20:49:40,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:40,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:40,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:40,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:40,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:40,043 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:40,129 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:49:40,129 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:40,129 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:40,129 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:40,129 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:40,129 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:40,129 INFO ]: Start difference. First operand 38 states and 5890 transitions. Second operand 3 states. [2018-06-26 20:49:42,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:42,903 INFO ]: Finished difference Result 69 states and 6992 transitions. [2018-06-26 20:49:42,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:42,938 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:49:42,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:42,943 INFO ]: With dead ends: 69 [2018-06-26 20:49:42,943 INFO ]: Without dead ends: 69 [2018-06-26 20:49:42,943 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:42,943 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-26 20:49:42,963 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-26 20:49:42,963 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-26 20:49:42,971 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 6992 transitions. [2018-06-26 20:49:42,971 INFO ]: Start accepts. Automaton has 69 states and 6992 transitions. Word has length 10 [2018-06-26 20:49:42,971 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:42,971 INFO ]: Abstraction has 69 states and 6992 transitions. [2018-06-26 20:49:42,971 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:42,971 INFO ]: Start isEmpty. Operand 69 states and 6992 transitions. [2018-06-26 20:49:42,974 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:49:42,974 INFO ]: Found error trace [2018-06-26 20:49:42,974 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:42,974 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:42,974 INFO ]: Analyzing trace with hash 860876799, now seen corresponding path program 1 times [2018-06-26 20:49:42,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:42,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:42,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:42,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:42,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:43,001 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:43,137 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:49:43,137 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:49:43,137 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:49:43,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:43,343 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:43,357 INFO ]: Computing forward predicates... [2018-06-26 20:49:43,511 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:49:43,538 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:49:43,538 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:49:43,538 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:49:43,538 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:49:43,538 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:49:43,538 INFO ]: Start difference. First operand 69 states and 6992 transitions. Second operand 6 states. [2018-06-26 20:49:52,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:52,927 INFO ]: Finished difference Result 201 states and 24540 transitions. [2018-06-26 20:49:52,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 20:49:52,927 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 20:49:52,927 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:52,957 INFO ]: With dead ends: 201 [2018-06-26 20:49:52,957 INFO ]: Without dead ends: 201 [2018-06-26 20:49:52,957 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:49:52,957 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-26 20:49:53,021 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 173. [2018-06-26 20:49:53,021 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-26 20:49:53,037 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 19968 transitions. [2018-06-26 20:49:53,037 INFO ]: Start accepts. Automaton has 173 states and 19968 transitions. Word has length 10 [2018-06-26 20:49:53,037 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:53,037 INFO ]: Abstraction has 173 states and 19968 transitions. [2018-06-26 20:49:53,037 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:49:53,037 INFO ]: Start isEmpty. Operand 173 states and 19968 transitions. [2018-06-26 20:49:53,044 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:49:53,044 INFO ]: Found error trace [2018-06-26 20:49:53,044 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:53,044 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:53,044 INFO ]: Analyzing trace with hash 1400213063, now seen corresponding path program 1 times [2018-06-26 20:49:53,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:53,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:53,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:53,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:53,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:53,072 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:53,156 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:49:53,156 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:53,199 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:53,199 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:53,199 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:53,199 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:53,200 INFO ]: Start difference. First operand 173 states and 19968 transitions. Second operand 3 states. [2018-06-26 20:49:55,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:55,825 INFO ]: Finished difference Result 209 states and 23052 transitions. [2018-06-26 20:49:55,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:55,825 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:49:55,826 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:55,840 INFO ]: With dead ends: 209 [2018-06-26 20:49:55,840 INFO ]: Without dead ends: 209 [2018-06-26 20:49:55,840 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:55,841 INFO ]: Start minimizeSevpa. Operand 209 states. [2018-06-26 20:49:55,897 INFO ]: Finished minimizeSevpa. Reduced states from 209 to 197. [2018-06-26 20:49:55,897 INFO ]: Start removeUnreachable. Operand 197 states. [2018-06-26 20:49:55,908 INFO ]: Finished removeUnreachable. Reduced from 197 states to 197 states and 22944 transitions. [2018-06-26 20:49:55,908 INFO ]: Start accepts. Automaton has 197 states and 22944 transitions. Word has length 10 [2018-06-26 20:49:55,909 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:55,909 INFO ]: Abstraction has 197 states and 22944 transitions. [2018-06-26 20:49:55,909 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:55,909 INFO ]: Start isEmpty. Operand 197 states and 22944 transitions. [2018-06-26 20:49:55,915 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:49:55,915 INFO ]: Found error trace [2018-06-26 20:49:55,916 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:55,916 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:55,916 INFO ]: Analyzing trace with hash 432708225, now seen corresponding path program 1 times [2018-06-26 20:49:55,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:55,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:55,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:55,916 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:55,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:55,940 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:56,020 INFO ]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:49:56,020 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:56,020 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:56,020 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:56,020 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:56,020 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:56,020 INFO ]: Start difference. First operand 197 states and 22944 transitions. Second operand 3 states. [2018-06-26 20:49:59,431 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:59,431 INFO ]: Finished difference Result 361 states and 39530 transitions. [2018-06-26 20:49:59,431 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:59,431 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:49:59,431 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:59,448 INFO ]: With dead ends: 361 [2018-06-26 20:49:59,448 INFO ]: Without dead ends: 361 [2018-06-26 20:49:59,448 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:59,452 INFO ]: Start minimizeSevpa. Operand 361 states. [2018-06-26 20:49:59,503 INFO ]: Finished minimizeSevpa. Reduced states from 361 to 213. [2018-06-26 20:49:59,503 INFO ]: Start removeUnreachable. Operand 213 states. [2018-06-26 20:49:59,520 INFO ]: Finished removeUnreachable. Reduced from 213 states to 213 states and 26178 transitions. [2018-06-26 20:49:59,520 INFO ]: Start accepts. Automaton has 213 states and 26178 transitions. Word has length 11 [2018-06-26 20:49:59,520 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:59,520 INFO ]: Abstraction has 213 states and 26178 transitions. [2018-06-26 20:49:59,520 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:59,520 INFO ]: Start isEmpty. Operand 213 states and 26178 transitions. [2018-06-26 20:49:59,528 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:49:59,528 INFO ]: Found error trace [2018-06-26 20:49:59,528 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:59,528 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:59,528 INFO ]: Analyzing trace with hash 564771728, now seen corresponding path program 1 times [2018-06-26 20:49:59,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:59,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:59,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:59,529 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:59,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:59,553 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:59,636 INFO ]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 20:49:59,637 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:59,637 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:59,637 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:59,637 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:59,637 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:59,637 INFO ]: Start difference. First operand 213 states and 26178 transitions. Second operand 3 states. [2018-06-26 20:50:02,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:02,681 INFO ]: Finished difference Result 383 states and 44460 transitions. [2018-06-26 20:50:02,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:02,682 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:50:02,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:02,700 INFO ]: With dead ends: 383 [2018-06-26 20:50:02,700 INFO ]: Without dead ends: 383 [2018-06-26 20:50:02,701 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:02,701 INFO ]: Start minimizeSevpa. Operand 383 states. [2018-06-26 20:50:02,779 INFO ]: Finished minimizeSevpa. Reduced states from 383 to 359. [2018-06-26 20:50:02,779 INFO ]: Start removeUnreachable. Operand 359 states. [2018-06-26 20:50:02,809 INFO ]: Finished removeUnreachable. Reduced from 359 states to 359 states and 44292 transitions. [2018-06-26 20:50:02,809 INFO ]: Start accepts. Automaton has 359 states and 44292 transitions. Word has length 11 [2018-06-26 20:50:02,809 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:02,809 INFO ]: Abstraction has 359 states and 44292 transitions. [2018-06-26 20:50:02,809 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:02,809 INFO ]: Start isEmpty. Operand 359 states and 44292 transitions. [2018-06-26 20:50:02,822 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:50:02,822 INFO ]: Found error trace [2018-06-26 20:50:02,822 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:02,822 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:02,822 INFO ]: Analyzing trace with hash -1294542166, now seen corresponding path program 1 times [2018-06-26 20:50:02,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:02,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:02,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:02,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:02,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:02,851 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:02,939 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:50:02,940 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:02,940 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:02,940 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:02,940 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:02,940 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:02,940 INFO ]: Start difference. First operand 359 states and 44292 transitions. Second operand 3 states. [2018-06-26 20:50:05,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:05,839 INFO ]: Finished difference Result 679 states and 81074 transitions. [2018-06-26 20:50:05,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:05,842 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:50:05,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:05,875 INFO ]: With dead ends: 679 [2018-06-26 20:50:05,875 INFO ]: Without dead ends: 679 [2018-06-26 20:50:05,875 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:05,876 INFO ]: Start minimizeSevpa. Operand 679 states. [2018-06-26 20:50:06,021 INFO ]: Finished minimizeSevpa. Reduced states from 679 to 655. [2018-06-26 20:50:06,021 INFO ]: Start removeUnreachable. Operand 655 states. [2018-06-26 20:50:06,082 INFO ]: Finished removeUnreachable. Reduced from 655 states to 655 states and 80906 transitions. [2018-06-26 20:50:06,082 INFO ]: Start accepts. Automaton has 655 states and 80906 transitions. Word has length 12 [2018-06-26 20:50:06,082 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:06,082 INFO ]: Abstraction has 655 states and 80906 transitions. [2018-06-26 20:50:06,082 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:06,082 INFO ]: Start isEmpty. Operand 655 states and 80906 transitions. [2018-06-26 20:50:06,096 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:50:06,096 INFO ]: Found error trace [2018-06-26 20:50:06,096 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:06,096 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:06,096 INFO ]: Analyzing trace with hash -897441246, now seen corresponding path program 1 times [2018-06-26 20:50:06,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:06,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:06,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:06,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:06,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:06,159 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:06,287 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:50:06,287 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:06,287 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:06,287 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:06,287 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:06,287 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:06,287 INFO ]: Start difference. First operand 655 states and 80906 transitions. Second operand 3 states. Received shutdown request... [2018-06-26 20:50:06,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:06,497 WARN ]: Verification canceled [2018-06-26 20:50:06,499 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:50:06,500 WARN ]: Timeout [2018-06-26 20:50:06,500 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:50:06 BasicIcfg [2018-06-26 20:50:06,500 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:50:06,501 INFO ]: Toolchain (without parser) took 67018.55 ms. Allocated memory was 308.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 239.6 MB in the beginning and 468.8 MB in the end (delta: -229.1 MB). Peak memory consumption was 794.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:06,502 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:50:06,502 INFO ]: ChcToBoogie took 69.41 ms. Allocated memory is still 308.3 MB. Free memory was 239.6 MB in the beginning and 236.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:06,503 INFO ]: Boogie Preprocessor took 74.04 ms. Allocated memory is still 308.3 MB. Free memory was 236.7 MB in the beginning and 234.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:06,503 INFO ]: RCFGBuilder took 402.28 ms. Allocated memory is still 308.3 MB. Free memory was 234.7 MB in the beginning and 201.4 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:06,503 INFO ]: BlockEncodingV2 took 2400.48 ms. Allocated memory was 308.3 MB in the beginning and 401.1 MB in the end (delta: 92.8 MB). Free memory was 201.4 MB in the beginning and 245.8 MB in the end (delta: -44.4 MB). Peak memory consumption was 132.6 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:06,504 INFO ]: TraceAbstraction took 64063.95 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 930.6 MB). Free memory was 242.4 MB in the beginning and 468.8 MB in the end (delta: -226.4 MB). Peak memory consumption was 704.2 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:06,506 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, 1084 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.41 ms. Allocated memory is still 308.3 MB. Free memory was 239.6 MB in the beginning and 236.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 74.04 ms. Allocated memory is still 308.3 MB. Free memory was 236.7 MB in the beginning and 234.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 402.28 ms. Allocated memory is still 308.3 MB. Free memory was 234.7 MB in the beginning and 201.4 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2400.48 ms. Allocated memory was 308.3 MB in the beginning and 401.1 MB in the end (delta: 92.8 MB). Free memory was 201.4 MB in the beginning and 245.8 MB in the end (delta: -44.4 MB). Peak memory consumption was 132.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 64063.95 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 930.6 MB). Free memory was 242.4 MB in the beginning and 468.8 MB in the end (delta: -226.4 MB). Peak memory consumption was 704.2 MB. 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 constructing difference of abstraction (655states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (4 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 64.0s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 60.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 87 SDtfs, 0 SDslu, 74 SDs, 0 SdLazy, 18572 SolverSat, 17735 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=655occurred in iteration=17, 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.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 245 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1185 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 240/242 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/s3_srvr_7.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-50-06-517.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_7.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-50-06-517.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_7.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-50-06-517.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_7.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-50-06-517.csv Completed graceful shutdown