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/sally-chc-benchmarks/misc/mvs_with_timeouts3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 22:22:30,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 22:22:30,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 22:22:30,500 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 22:22:30,500 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 22:22:30,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 22:22:30,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 22:22:30,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 22:22:30,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 22:22:30,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 22:22:30,512 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 22:22:30,512 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 22:22:30,513 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 22:22:30,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 22:22:30,514 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 22:22:30,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 22:22:30,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 22:22:30,527 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 22:22:30,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 22:22:30,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 22:22:30,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 22:22:30,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 22:22:30,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 22:22:30,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 22:22:30,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 22:22:30,537 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 22:22:30,542 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 22:22:30,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 22:22:30,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 22:22:30,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 22:22:30,545 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 22:22:30,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 22:22:30,545 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 22:22:30,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 22:22:30,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 22:22:30,552 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 22:22:30,573 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 22:22:30,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 22:22:30,574 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 22:22:30,574 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 22:22:30,575 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 22:22:30,575 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 22:22:30,575 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 22:22:30,576 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 22:22:30,576 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 22:22:30,576 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 22:22:30,576 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 22:22:30,576 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 22:22:30,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 22:22:30,577 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 22:22:30,577 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 22:22:30,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 22:22:30,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 22:22:30,578 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 22:22:30,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 22:22:30,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 22:22:30,578 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 22:22:30,580 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 22:22:30,580 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 22:22:30,621 INFO ]: Repository-Root is: /tmp [2018-06-24 22:22:30,634 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 22:22:30,637 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 22:22:30,639 INFO ]: Initializing SmtParser... [2018-06-24 22:22:30,639 INFO ]: SmtParser initialized [2018-06-24 22:22:30,640 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/sally-chc-benchmarks/misc/mvs_with_timeouts3.smt2 [2018-06-24 22:22:30,646 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-24 22:22:30,734 INFO ]: Executing SMT file /storage/chc-comp/sally-chc-benchmarks/misc/mvs_with_timeouts3.smt2 unknown [2018-06-24 22:22:31,023 INFO ]: Succesfully executed SMT file /storage/chc-comp/sally-chc-benchmarks/misc/mvs_with_timeouts3.smt2 [2018-06-24 22:22:31,028 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 22:22:31,033 INFO ]: Walking toolchain with 5 elements. [2018-06-24 22:22:31,034 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 22:22:31,034 INFO ]: Initializing ChcToBoogie... [2018-06-24 22:22:31,034 INFO ]: ChcToBoogie initialized [2018-06-24 22:22:31,037 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:22:31" (1/1) ... [2018-06-24 22:22:31,098 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:31 Unit [2018-06-24 22:22:31,098 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 22:22:31,100 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 22:22:31,100 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 22:22:31,100 INFO ]: Boogie Preprocessor initialized [2018-06-24 22:22:31,121 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:31" (1/1) ... [2018-06-24 22:22:31,121 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:31" (1/1) ... [2018-06-24 22:22:31,132 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:31" (1/1) ... [2018-06-24 22:22:31,132 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:31" (1/1) ... [2018-06-24 22:22:31,136 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:31" (1/1) ... [2018-06-24 22:22:31,137 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:31" (1/1) ... [2018-06-24 22:22:31,150 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:31" (1/1) ... [2018-06-24 22:22:31,152 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 22:22:31,152 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 22:22:31,152 INFO ]: Initializing RCFGBuilder... [2018-06-24 22:22:31,152 INFO ]: RCFGBuilder initialized [2018-06-24 22:22:31,153 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:31" (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-24 22:22:31,174 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 22:22:31,174 INFO ]: Found specification of procedure gotoProc [2018-06-24 22:22:31,174 INFO ]: Found implementation of procedure gotoProc [2018-06-24 22:22:31,174 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 22:22:31,174 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 22:22:31,174 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 22:22:31,431 INFO ]: Using library mode [2018-06-24 22:22:31,432 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:22:31 BoogieIcfgContainer [2018-06-24 22:22:31,432 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 22:22:31,432 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 22:22:31,432 INFO ]: Initializing BlockEncodingV2... [2018-06-24 22:22:31,433 INFO ]: BlockEncodingV2 initialized [2018-06-24 22:22:31,434 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:22:31" (1/1) ... [2018-06-24 22:22:31,448 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 22:22:31,449 INFO ]: Using Remove infeasible edges [2018-06-24 22:22:31,450 INFO ]: Using Maximize final states [2018-06-24 22:22:31,450 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 22:22:31,450 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 22:22:31,452 INFO ]: Using Remove sink states [2018-06-24 22:22:31,453 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 22:22:31,453 INFO ]: Using Use SBE [2018-06-24 22:22:31,458 WARN ]: expecting exponential blowup for input size 7 [2018-06-24 22:22:31,563 WARN ]: expecting exponential blowup for input size 7 [2018-06-24 22:22:32,567 INFO ]: SBE split 2 edges [2018-06-24 22:22:32,586 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 22:22:32,588 INFO ]: 0 new accepting states [2018-06-24 22:22:34,759 INFO ]: Removed 131 edges and 2 locations by large block encoding [2018-06-24 22:22:34,761 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:22:34,775 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 22:22:34,775 INFO ]: 0 new accepting states [2018-06-24 22:22:34,775 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 22:22:34,776 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:22:34,793 INFO ]: Encoded RCFG 6 locations, 280 edges [2018-06-24 22:22:34,793 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:22:34 BasicIcfg [2018-06-24 22:22:34,793 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 22:22:34,795 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 22:22:34,795 INFO ]: Initializing TraceAbstraction... [2018-06-24 22:22:34,798 INFO ]: TraceAbstraction initialized [2018-06-24 22:22:34,798 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:22:31" (1/4) ... [2018-06-24 22:22:34,799 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392737a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 10:22:34, skipping insertion in model container [2018-06-24 22:22:34,799 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:31" (2/4) ... [2018-06-24 22:22:34,799 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392737a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 10:22:34, skipping insertion in model container [2018-06-24 22:22:34,799 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:22:31" (3/4) ... [2018-06-24 22:22:34,800 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392737a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:22:34, skipping insertion in model container [2018-06-24 22:22:34,800 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:22:34" (4/4) ... [2018-06-24 22:22:34,801 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 22:22:34,807 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 22:22:34,813 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 22:22:34,854 INFO ]: Using default assertion order modulation [2018-06-24 22:22:34,854 INFO ]: Interprodecural is true [2018-06-24 22:22:34,854 INFO ]: Hoare is false [2018-06-24 22:22:34,854 INFO ]: Compute interpolants for FPandBP [2018-06-24 22:22:34,854 INFO ]: Backedges is TWOTRACK [2018-06-24 22:22:34,854 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 22:22:34,854 INFO ]: Difference is false [2018-06-24 22:22:34,854 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 22:22:34,854 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 22:22:34,867 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 22:22:34,883 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 22:22:34,884 INFO ]: Found error trace [2018-06-24 22:22:34,884 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 22:22:34,885 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:34,888 INFO ]: Analyzing trace with hash 44012161, now seen corresponding path program 1 times [2018-06-24 22:22:34,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:34,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:34,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:34,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:34,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:34,964 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:35,066 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:35,068 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:35,068 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:35,070 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:35,086 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:35,087 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:35,089 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 22:22:36,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:36,705 INFO ]: Finished difference Result 7 states and 280 transitions. [2018-06-24 22:22:36,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:36,706 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 22:22:36,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:36,714 INFO ]: With dead ends: 7 [2018-06-24 22:22:36,714 INFO ]: Without dead ends: 6 [2018-06-24 22:22:36,716 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-24 22:22:36,729 INFO ]: Start minimizeSevpa. Operand 6 states. [2018-06-24 22:22:36,744 INFO ]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-06-24 22:22:36,746 INFO ]: Start removeUnreachable. Operand 6 states. [2018-06-24 22:22:36,746 INFO ]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2018-06-24 22:22:36,748 INFO ]: Start accepts. Automaton has 6 states and 216 transitions. Word has length 5 [2018-06-24 22:22:36,748 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:36,748 INFO ]: Abstraction has 6 states and 216 transitions. [2018-06-24 22:22:36,748 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:36,748 INFO ]: Start isEmpty. Operand 6 states and 216 transitions. [2018-06-24 22:22:36,749 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 22:22:36,749 INFO ]: Found error trace [2018-06-24 22:22:36,749 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 22:22:36,749 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:36,749 INFO ]: Analyzing trace with hash 46931679, now seen corresponding path program 1 times [2018-06-24 22:22:36,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:36,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:36,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:36,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:36,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:36,762 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:36,810 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:36,810 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:36,810 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:36,811 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:36,812 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:36,812 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:36,812 INFO ]: Start difference. First operand 6 states and 216 transitions. Second operand 3 states. [2018-06-24 22:22:37,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:37,663 INFO ]: Finished difference Result 7 states and 216 transitions. [2018-06-24 22:22:37,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:37,663 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 22:22:37,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:37,664 INFO ]: With dead ends: 7 [2018-06-24 22:22:37,664 INFO ]: Without dead ends: 6 [2018-06-24 22:22:37,665 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-24 22:22:37,665 INFO ]: Start minimizeSevpa. Operand 6 states. [2018-06-24 22:22:37,669 INFO ]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-06-24 22:22:37,669 INFO ]: Start removeUnreachable. Operand 6 states. [2018-06-24 22:22:37,670 INFO ]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2018-06-24 22:22:37,670 INFO ]: Start accepts. Automaton has 6 states and 184 transitions. Word has length 5 [2018-06-24 22:22:37,670 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:37,670 INFO ]: Abstraction has 6 states and 184 transitions. [2018-06-24 22:22:37,670 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:37,670 INFO ]: Start isEmpty. Operand 6 states and 184 transitions. [2018-06-24 22:22:37,670 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 22:22:37,670 INFO ]: Found error trace [2018-06-24 22:22:37,670 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 22:22:37,670 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:37,671 INFO ]: Analyzing trace with hash 46991261, now seen corresponding path program 1 times [2018-06-24 22:22:37,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:37,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:37,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:37,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:37,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:37,683 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:37,703 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:37,703 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:37,703 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:37,704 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:37,704 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:37,704 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:37,704 INFO ]: Start difference. First operand 6 states and 184 transitions. Second operand 3 states. [2018-06-24 22:22:38,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:38,375 INFO ]: Finished difference Result 7 states and 184 transitions. [2018-06-24 22:22:38,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:38,376 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 22:22:38,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:38,376 INFO ]: With dead ends: 7 [2018-06-24 22:22:38,376 INFO ]: Without dead ends: 6 [2018-06-24 22:22:38,376 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-24 22:22:38,376 INFO ]: Start minimizeSevpa. Operand 6 states. [2018-06-24 22:22:38,380 INFO ]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-06-24 22:22:38,380 INFO ]: Start removeUnreachable. Operand 6 states. [2018-06-24 22:22:38,380 INFO ]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2018-06-24 22:22:38,380 INFO ]: Start accepts. Automaton has 6 states and 168 transitions. Word has length 5 [2018-06-24 22:22:38,380 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:38,380 INFO ]: Abstraction has 6 states and 168 transitions. [2018-06-24 22:22:38,380 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:38,380 INFO ]: Start isEmpty. Operand 6 states and 168 transitions. [2018-06-24 22:22:38,381 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 22:22:38,381 INFO ]: Found error trace [2018-06-24 22:22:38,381 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 22:22:38,381 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:38,381 INFO ]: Analyzing trace with hash 46127322, now seen corresponding path program 1 times [2018-06-24 22:22:38,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:38,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:38,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:38,382 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:38,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:38,395 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:38,420 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:38,420 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:38,420 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:38,420 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:38,420 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:38,420 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:38,421 INFO ]: Start difference. First operand 6 states and 168 transitions. Second operand 3 states. [2018-06-24 22:22:39,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:39,108 INFO ]: Finished difference Result 7 states and 168 transitions. [2018-06-24 22:22:39,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:39,108 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 22:22:39,109 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:39,109 INFO ]: With dead ends: 7 [2018-06-24 22:22:39,109 INFO ]: Without dead ends: 6 [2018-06-24 22:22:39,109 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-24 22:22:39,109 INFO ]: Start minimizeSevpa. Operand 6 states. [2018-06-24 22:22:39,112 INFO ]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-06-24 22:22:39,112 INFO ]: Start removeUnreachable. Operand 6 states. [2018-06-24 22:22:39,112 INFO ]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2018-06-24 22:22:39,112 INFO ]: Start accepts. Automaton has 6 states and 160 transitions. Word has length 5 [2018-06-24 22:22:39,112 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:39,112 INFO ]: Abstraction has 6 states and 160 transitions. [2018-06-24 22:22:39,112 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:39,112 INFO ]: Start isEmpty. Operand 6 states and 160 transitions. [2018-06-24 22:22:39,113 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 22:22:39,113 INFO ]: Found error trace [2018-06-24 22:22:39,113 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 22:22:39,113 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:39,113 INFO ]: Analyzing trace with hash 46633769, now seen corresponding path program 1 times [2018-06-24 22:22:39,113 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:39,113 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:39,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:39,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:39,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:39,125 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:39,196 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:39,196 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:39,196 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:39,196 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:39,196 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:39,196 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:39,196 INFO ]: Start difference. First operand 6 states and 160 transitions. Second operand 3 states. [2018-06-24 22:22:40,165 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:40,165 INFO ]: Finished difference Result 7 states and 308 transitions. [2018-06-24 22:22:40,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:40,167 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 22:22:40,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:40,167 INFO ]: With dead ends: 7 [2018-06-24 22:22:40,167 INFO ]: Without dead ends: 7 [2018-06-24 22:22:40,168 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-24 22:22:40,168 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 22:22:40,171 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 22:22:40,171 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 22:22:40,172 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 308 transitions. [2018-06-24 22:22:40,172 INFO ]: Start accepts. Automaton has 7 states and 308 transitions. Word has length 5 [2018-06-24 22:22:40,172 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:40,172 INFO ]: Abstraction has 7 states and 308 transitions. [2018-06-24 22:22:40,172 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:40,172 INFO ]: Start isEmpty. Operand 7 states and 308 transitions. [2018-06-24 22:22:40,172 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:22:40,172 INFO ]: Found error trace [2018-06-24 22:22:40,172 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:22:40,172 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:40,173 INFO ]: Analyzing trace with hash 1441359016, now seen corresponding path program 1 times [2018-06-24 22:22:40,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:40,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:40,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:40,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:40,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:40,198 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:40,306 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:40,306 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:40,306 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-24 22:22:40,314 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:40,361 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:40,369 INFO ]: Computing forward predicates... [2018-06-24 22:22:41,303 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:41,325 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:41,325 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 22:22:41,325 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:22:41,325 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:22:41,325 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:22:41,325 INFO ]: Start difference. First operand 7 states and 308 transitions. Second operand 5 states. [2018-06-24 22:22:42,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:42,967 INFO ]: Finished difference Result 10 states and 728 transitions. [2018-06-24 22:22:42,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:22:42,968 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 22:22:42,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:42,968 INFO ]: With dead ends: 10 [2018-06-24 22:22:42,968 INFO ]: Without dead ends: 10 [2018-06-24 22:22:42,969 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:22:42,969 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 22:22:42,974 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 22:22:42,974 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 22:22:42,975 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 728 transitions. [2018-06-24 22:22:42,975 INFO ]: Start accepts. Automaton has 10 states and 728 transitions. Word has length 6 [2018-06-24 22:22:42,976 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:42,976 INFO ]: Abstraction has 10 states and 728 transitions. [2018-06-24 22:22:42,976 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:22:42,976 INFO ]: Start isEmpty. Operand 10 states and 728 transitions. [2018-06-24 22:22:42,976 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:22:42,976 INFO ]: Found error trace [2018-06-24 22:22:42,976 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:22:42,976 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:42,977 INFO ]: Analyzing trace with hash 1441418598, now seen corresponding path program 1 times [2018-06-24 22:22:42,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:42,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:42,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:42,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:42,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:43,011 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:43,064 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:43,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:43,064 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:22:43,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:43,095 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:43,096 INFO ]: Computing forward predicates... [2018-06-24 22:22:50,669 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:50,704 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 22:22:50,704 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-06-24 22:22:50,704 INFO ]: Interpolant automaton has 4 states [2018-06-24 22:22:50,704 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 22:22:50,704 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:22:50,705 INFO ]: Start difference. First operand 10 states and 728 transitions. Second operand 4 states. [2018-06-24 22:22:51,872 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:51,873 INFO ]: Finished difference Result 11 states and 844 transitions. [2018-06-24 22:22:51,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:51,873 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 22:22:51,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:51,874 INFO ]: With dead ends: 11 [2018-06-24 22:22:51,874 INFO ]: Without dead ends: 11 [2018-06-24 22:22:51,874 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:22:51,874 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 22:22:51,879 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 22:22:51,879 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 22:22:51,883 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 844 transitions. [2018-06-24 22:22:51,883 INFO ]: Start accepts. Automaton has 11 states and 844 transitions. Word has length 6 [2018-06-24 22:22:51,883 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:51,883 INFO ]: Abstraction has 11 states and 844 transitions. [2018-06-24 22:22:51,883 INFO ]: Interpolant automaton has 4 states. [2018-06-24 22:22:51,883 INFO ]: Start isEmpty. Operand 11 states and 844 transitions. [2018-06-24 22:22:51,884 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:22:51,884 INFO ]: Found error trace [2018-06-24 22:22:51,884 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:22:51,884 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:51,884 INFO ]: Analyzing trace with hash 1441597344, now seen corresponding path program 1 times [2018-06-24 22:22:51,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:51,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:51,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:51,884 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:51,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:51,897 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:51,951 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:51,951 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:51,951 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-24 22:22:51,959 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:51,996 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:51,997 INFO ]: Computing forward predicates... [2018-06-24 22:22:52,479 WARN ]: Spent 349.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-06-24 22:22:52,480 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:52,513 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:52,513 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 22:22:52,513 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:22:52,513 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:22:52,513 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:22:52,514 INFO ]: Start difference. First operand 11 states and 844 transitions. Second operand 5 states. [2018-06-24 22:22:54,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:54,248 INFO ]: Finished difference Result 14 states and 1256 transitions. [2018-06-24 22:22:54,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:22:54,248 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 22:22:54,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:54,250 INFO ]: With dead ends: 14 [2018-06-24 22:22:54,250 INFO ]: Without dead ends: 14 [2018-06-24 22:22:54,250 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:22:54,250 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 22:22:54,258 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 22:22:54,258 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 22:22:54,259 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1256 transitions. [2018-06-24 22:22:54,259 INFO ]: Start accepts. Automaton has 14 states and 1256 transitions. Word has length 6 [2018-06-24 22:22:54,260 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:54,260 INFO ]: Abstraction has 14 states and 1256 transitions. [2018-06-24 22:22:54,260 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:22:54,260 INFO ]: Start isEmpty. Operand 14 states and 1256 transitions. [2018-06-24 22:22:54,260 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:22:54,260 INFO ]: Found error trace [2018-06-24 22:22:54,260 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:22:54,261 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:54,261 INFO ]: Analyzing trace with hash 1441656926, now seen corresponding path program 1 times [2018-06-24 22:22:54,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:54,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:54,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:54,261 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:54,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:54,271 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:54,302 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:54,302 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:54,302 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-24 22:22:54,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:54,353 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:54,355 INFO ]: Computing forward predicates... [2018-06-24 22:22:54,581 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:54,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:54,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 22:22:54,602 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:22:54,602 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:22:54,602 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:22:54,603 INFO ]: Start difference. First operand 14 states and 1256 transitions. Second operand 5 states. [2018-06-24 22:22:56,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:56,257 INFO ]: Finished difference Result 16 states and 1536 transitions. [2018-06-24 22:22:56,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:22:56,257 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 22:22:56,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:56,259 INFO ]: With dead ends: 16 [2018-06-24 22:22:56,259 INFO ]: Without dead ends: 16 [2018-06-24 22:22:56,259 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:22:56,259 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 22:22:56,267 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 22:22:56,268 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 22:22:56,269 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1536 transitions. [2018-06-24 22:22:56,269 INFO ]: Start accepts. Automaton has 16 states and 1536 transitions. Word has length 6 [2018-06-24 22:22:56,269 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:56,269 INFO ]: Abstraction has 16 states and 1536 transitions. [2018-06-24 22:22:56,269 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:22:56,269 INFO ]: Start isEmpty. Operand 16 states and 1536 transitions. [2018-06-24 22:22:56,272 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:22:56,272 INFO ]: Found error trace [2018-06-24 22:22:56,272 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:22:56,272 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:56,272 INFO ]: Analyzing trace with hash 1441746299, now seen corresponding path program 1 times [2018-06-24 22:22:56,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:56,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:56,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:56,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:56,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:56,287 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:56,455 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-06-24 22:22:56,460 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:56,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:56,460 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-24 22:22:56,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:56,510 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:56,512 INFO ]: Computing forward predicates... [2018-06-24 22:22:56,586 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:56,606 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:56,606 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 22:22:56,606 INFO ]: Interpolant automaton has 6 states [2018-06-24 22:22:56,606 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 22:22:56,606 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 22:22:56,606 INFO ]: Start difference. First operand 16 states and 1536 transitions. Second operand 6 states. [2018-06-24 22:22:57,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:57,817 INFO ]: Finished difference Result 20 states and 2088 transitions. [2018-06-24 22:22:57,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:22:57,818 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 22:22:57,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:57,821 INFO ]: With dead ends: 20 [2018-06-24 22:22:57,821 INFO ]: Without dead ends: 20 [2018-06-24 22:22:57,821 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 22:22:57,821 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 22:22:57,830 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 22:22:57,830 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 22:22:57,832 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2088 transitions. [2018-06-24 22:22:57,832 INFO ]: Start accepts. Automaton has 20 states and 2088 transitions. Word has length 6 [2018-06-24 22:22:57,832 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:57,832 INFO ]: Abstraction has 20 states and 2088 transitions. [2018-06-24 22:22:57,832 INFO ]: Interpolant automaton has 6 states. [2018-06-24 22:22:57,832 INFO ]: Start isEmpty. Operand 20 states and 2088 transitions. [2018-06-24 22:22:57,835 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:22:57,835 INFO ]: Found error trace [2018-06-24 22:22:57,835 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:22:57,835 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:57,835 INFO ]: Analyzing trace with hash 1442014418, now seen corresponding path program 1 times [2018-06-24 22:22:57,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:57,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:57,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:57,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:57,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:57,847 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:57,914 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:57,914 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:57,914 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-24 22:22:57,920 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:57,945 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:57,946 INFO ]: Computing forward predicates... [2018-06-24 22:22:58,315 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:58,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:58,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 22:22:58,336 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:22:58,336 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:22:58,336 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:22:58,336 INFO ]: Start difference. First operand 20 states and 2088 transitions. Second operand 5 states. [2018-06-24 22:22:59,595 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:59,596 INFO ]: Finished difference Result 24 states and 2648 transitions. [2018-06-24 22:22:59,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:22:59,596 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 22:22:59,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:59,600 INFO ]: With dead ends: 24 [2018-06-24 22:22:59,600 INFO ]: Without dead ends: 24 [2018-06-24 22:22:59,600 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:22:59,600 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 22:22:59,617 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-06-24 22:22:59,617 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 22:22:59,621 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2516 transitions. [2018-06-24 22:22:59,621 INFO ]: Start accepts. Automaton has 23 states and 2516 transitions. Word has length 6 [2018-06-24 22:22:59,621 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:59,621 INFO ]: Abstraction has 23 states and 2516 transitions. [2018-06-24 22:22:59,621 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:22:59,621 INFO ]: Start isEmpty. Operand 23 states and 2516 transitions. [2018-06-24 22:22:59,623 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:22:59,623 INFO ]: Found error trace [2018-06-24 22:22:59,623 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:22:59,623 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:59,623 INFO ]: Analyzing trace with hash 1442163373, now seen corresponding path program 1 times [2018-06-24 22:22:59,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:59,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:59,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:59,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:59,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:59,639 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:59,686 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:59,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:59,687 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-24 22:22:59,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:59,716 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:59,718 INFO ]: Computing forward predicates... [2018-06-24 22:23:00,001 WARN ]: Spent 172.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-06-24 22:23:00,002 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:23:00,022 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:23:00,022 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 22:23:00,022 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:23:00,022 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:23:00,022 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:23:00,022 INFO ]: Start difference. First operand 23 states and 2516 transitions. Second operand 5 states. [2018-06-24 22:23:01,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:23:01,186 INFO ]: Finished difference Result 27 states and 3076 transitions. [2018-06-24 22:23:01,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:23:01,186 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 22:23:01,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:23:01,189 INFO ]: With dead ends: 27 [2018-06-24 22:23:01,189 INFO ]: Without dead ends: 27 [2018-06-24 22:23:01,190 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:23:01,190 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 22:23:01,202 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 22:23:01,202 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 22:23:01,205 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3076 transitions. [2018-06-24 22:23:01,205 INFO ]: Start accepts. Automaton has 27 states and 3076 transitions. Word has length 6 [2018-06-24 22:23:01,205 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:23:01,205 INFO ]: Abstraction has 27 states and 3076 transitions. [2018-06-24 22:23:01,205 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:23:01,205 INFO ]: Start isEmpty. Operand 27 states and 3076 transitions. [2018-06-24 22:23:01,207 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:23:01,207 INFO ]: Found error trace [2018-06-24 22:23:01,207 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:23:01,207 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:23:01,208 INFO ]: Analyzing trace with hash 1437933051, now seen corresponding path program 1 times [2018-06-24 22:23:01,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:23:01,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:23:01,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:23:01,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:23:01,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:23:01,219 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:23:01,283 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:23:01,283 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:23:01,283 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-24 22:23:01,289 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:23:01,312 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:23:01,313 INFO ]: Computing forward predicates... [2018-06-24 22:23:01,468 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:23:01,487 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:23:01,487 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 22:23:01,487 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:23:01,487 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:23:01,487 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:23:01,488 INFO ]: Start difference. First operand 27 states and 3076 transitions. Second operand 5 states. [2018-06-24 22:23:02,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:23:02,703 INFO ]: Finished difference Result 30 states and 3504 transitions. [2018-06-24 22:23:02,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:23:02,720 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 22:23:02,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:23:02,722 INFO ]: With dead ends: 30 [2018-06-24 22:23:02,723 INFO ]: Without dead ends: 30 [2018-06-24 22:23:02,723 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:23:02,723 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 22:23:02,738 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-24 22:23:02,738 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 22:23:02,741 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3208 transitions. [2018-06-24 22:23:02,741 INFO ]: Start accepts. Automaton has 28 states and 3208 transitions. Word has length 6 [2018-06-24 22:23:02,742 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:23:02,742 INFO ]: Abstraction has 28 states and 3208 transitions. [2018-06-24 22:23:02,742 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:23:02,742 INFO ]: Start isEmpty. Operand 28 states and 3208 transitions. [2018-06-24 22:23:02,743 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:23:02,743 INFO ]: Found error trace [2018-06-24 22:23:02,743 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:23:02,743 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:23:02,743 INFO ]: Analyzing trace with hash 1385024235, now seen corresponding path program 1 times [2018-06-24 22:23:02,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:23:02,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:23:02,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:23:02,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:23:02,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:23:02,756 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:23:02,820 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:23:02,820 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:23:02,820 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-24 22:23:02,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:23:02,863 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:23:02,865 INFO ]: Computing forward predicates... [2018-06-24 22:23:03,132 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:23:03,153 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:23:03,153 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 22:23:03,153 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:23:03,154 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:23:03,154 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:23:03,154 INFO ]: Start difference. First operand 28 states and 3208 transitions. Second operand 5 states. [2018-06-24 22:23:04,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:23:04,777 INFO ]: Finished difference Result 32 states and 3776 transitions. [2018-06-24 22:23:04,777 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:23:04,777 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 22:23:04,777 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:23:04,779 INFO ]: With dead ends: 32 [2018-06-24 22:23:04,779 INFO ]: Without dead ends: 32 [2018-06-24 22:23:04,780 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:23:04,780 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 22:23:04,789 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 22:23:04,789 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 22:23:04,792 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3776 transitions. [2018-06-24 22:23:04,792 INFO ]: Start accepts. Automaton has 32 states and 3776 transitions. Word has length 6 [2018-06-24 22:23:04,793 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:23:04,793 INFO ]: Abstraction has 32 states and 3776 transitions. [2018-06-24 22:23:04,793 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:23:04,793 INFO ]: Start isEmpty. Operand 32 states and 3776 transitions. [2018-06-24 22:23:04,794 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:23:04,794 INFO ]: Found error trace [2018-06-24 22:23:04,794 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:23:04,794 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:23:04,794 INFO ]: Analyzing trace with hash 1385083817, now seen corresponding path program 1 times [2018-06-24 22:23:04,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:23:04,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:23:04,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:23:04,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:23:04,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:23:04,806 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:23:04,930 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:23:04,930 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:23:04,930 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:23:04,935 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:23:04,957 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:23:04,959 INFO ]: Computing forward predicates... [2018-06-24 22:23:05,931 WARN ]: Spent 156.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2018-06-24 22:23:05,934 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:23:05,961 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:23:05,961 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 22:23:05,961 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:23:05,961 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:23:05,961 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:23:05,961 INFO ]: Start difference. First operand 32 states and 3776 transitions. Second operand 5 states. [2018-06-24 22:23:08,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:23:08,269 INFO ]: Finished difference Result 41 states and 4940 transitions. [2018-06-24 22:23:08,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 22:23:08,294 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 22:23:08,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:23:08,298 INFO ]: With dead ends: 41 [2018-06-24 22:23:08,298 INFO ]: Without dead ends: 41 [2018-06-24 22:23:08,299 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-24 22:23:08,299 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 22:23:08,308 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-06-24 22:23:08,308 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 22:23:08,312 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 4792 transitions. [2018-06-24 22:23:08,312 INFO ]: Start accepts. Automaton has 40 states and 4792 transitions. Word has length 6 [2018-06-24 22:23:08,312 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:23:08,312 INFO ]: Abstraction has 40 states and 4792 transitions. [2018-06-24 22:23:08,312 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:23:08,312 INFO ]: Start isEmpty. Operand 40 states and 4792 transitions. [2018-06-24 22:23:08,314 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:23:08,314 INFO ]: Found error trace [2018-06-24 22:23:08,314 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:23:08,314 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:23:08,314 INFO ]: Analyzing trace with hash 1461825433, now seen corresponding path program 1 times [2018-06-24 22:23:08,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:23:08,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:23:08,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:23:08,314 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:23:08,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:23:08,326 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:23:08,456 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:23:08,456 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:23:08,456 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:23:08,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:23:08,486 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:23:08,487 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-24 22:23:37,271 INFO ]: Timeout while computing interpolants [2018-06-24 22:23:37,472 WARN ]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:23:37,472 WARN ]: Verification canceled [2018-06-24 22:23:37,474 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 22:23:37,475 WARN ]: Timeout [2018-06-24 22:23:37,476 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:23:37 BasicIcfg [2018-06-24 22:23:37,805 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 22:23:37,806 INFO ]: Toolchain (without parser) took 66777.19 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 262.2 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-24 22:23:37,807 INFO ]: SmtParser took 5.48 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 22:23:37,807 INFO ]: ChcToBoogie took 64.57 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:23:37,807 INFO ]: Boogie Preprocessor took 51.45 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 258.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 22:23:37,807 INFO ]: RCFGBuilder took 279.69 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 245.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:23:37,808 INFO ]: BlockEncodingV2 took 3361.25 ms. Allocated memory was 308.8 MB in the beginning and 358.6 MB in the end (delta: 49.8 MB). Free memory was 245.2 MB in the beginning and 312.1 MB in the end (delta: -67.0 MB). Peak memory consumption was 88.1 MB. Max. memory is 3.6 GB. [2018-06-24 22:23:37,808 INFO ]: TraceAbstraction took 63010.27 ms. Allocated memory was 358.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 312.1 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-24 22:23:37,812 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, 280 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 5.48 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.57 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.45 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 258.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 279.69 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 245.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 3361.25 ms. Allocated memory was 308.8 MB in the beginning and 358.6 MB in the end (delta: 49.8 MB). Free memory was 245.2 MB in the beginning and 312.1 MB in the end (delta: -67.0 MB). Peak memory consumption was 88.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 63010.27 ms. Allocated memory was 358.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 312.1 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). 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 7 with TraceHistMax 1, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 2 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 62.6s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 19.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 388 SDtfs, 0 SDslu, 96 SDs, 0 SdLazy, 12932 SolverSat, 3242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=15, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 2803 SizeOfPredicates, 28 NumberOfNonLiveVariables, 2127 ConjunctsInSsa, 226 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 1/20 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/mvs_with_timeouts3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_22-23-37-822.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mvs_with_timeouts3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_22-23-37-822.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mvs_with_timeouts3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_22-23-37-822.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mvs_with_timeouts3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_22-23-37-822.csv Completed graceful shutdown